Digital asset voucher decomposition and transaction verification method based on block chain

Abstract

The invention discloses a digital asset voucher decomposition and transaction verification method based on a block chain, and belongs to the field of digital currency transaction. The method comprises the following steps: encrypting transaction information by using a zero-knowledge proof algorithm based on an elliptic curve encryption technology and forming an input voucher; decomposing the input voucher to obtain a change voucher and a collection voucher, generating a transaction proof containing the input voucher, the change voucher and the collection voucher, and sending the transaction proof to a payee; and the payee verifies the transaction by verifying the sum conditions of the input voucher, the change voucher and the collection voucher. Through a zero-knowledge proof technology and an asset voucher decomposition technology, the problems of inflexible right confirmation of assets, insufficient transaction security, poor privacy protection and the like in the prior art are solved, and flexible right confirmation and transfer of the assets are realized.

Description

Technical Field

[0001] The present invention belongs to the field of off-chain digital currency transactions, and particularly relates to a method for decomposing digital asset vouchers and verifying transactions based on blockchain. Background Art

[0002] With the continuous development and popularization of blockchain technology, digital currency, as a new financial form, has gradually emerged on the global stage. Among them, off-chain digital currency transactions, as an important application direction of blockchain technology, are increasingly attracting wide attention and in-depth research in the industry. Off-chain digital currency transactions refer to the transfer and verification of digital currency without network connection. The emergence of this technology not only greatly expands the usage scenarios of digital currency but also significantly improves the convenience and security of transactions.

[0003] Although off-chain digital currency transactions have many advantages, they still face a series of technical challenges in the actual application process. In the field of digital currency, asset right confirmation is one of the core links of transactions. However, due to the anonymity and decentralization characteristics of digital currency, it makes asset right confirmation particularly complex. Especially in complex financial scenarios where asset forms are diverse and the equity relationships are intricate, how to achieve flexible and accurate right confirmation has become a technical problem that urgently needs to be solved. Traditional right confirmation methods often rely on centralized trust institutions, but this method is not only inefficient but also has a high trust risk. Therefore, how to achieve efficient, secure, and trustworthy asset right confirmation in a decentralized environment is the key problem that urgently needs to be overcome in the field of off-chain digital currency transactions. At the same time, the security of off-chain digital currency transactions is another important technical challenge. Without network connection, the two parties to the transaction cannot confirm the authenticity and legality of the transaction through traditional online verification means. This requires that the transaction process must rely on more advanced security technologies to ensure the security of transactions. However, existing security technologies often have various loopholes and defects and are easily attacked and exploited by hackers. Therefore, how to build a secure and reliable off-chain digital currency transaction mechanism to ensure the fund security of both parties to the transaction is an important issue faced by the field of off-chain digital currency transactions.

[0004] Meanwhile, with the increasing awareness of privacy protection, the privacy protection issue of off-chain digital currency transactions has become increasingly prominent. In the traditional online transaction mode, users' transaction information and identity information are often easily leaked and misused. In the off-chain digital currency transaction mode, since the two parties to the transaction do not need to directly expose their identities and transaction information, there is a higher demand for privacy protection. However, how to effectively protect users' privacy while ensuring transaction security is also one of the technical problems that urgently need to be solved in the field of off-chain digital currency transactions. Summary of the Invention

[0005] The object of the present invention is to provide a method for decomposing digital asset vouchers and verifying transactions based on blockchain, so as to solve problems such as poor privacy protection in offline transactions of existing digital currencies and low efficiency of the confirmation process.

[0006] In order to achieve the above object, the technical solution of the present invention is as follows: The present invention relates to a method for decomposing digital asset vouchers and verifying transactions based on blockchain, which includes the following steps: S1. The payer inputs transaction information, encrypts the transaction information using a zero-knowledge proof algorithm based on elliptic curve cryptography technology to form an input voucher; decomposes the input voucher to obtain a change voucher and a receipt voucher, generates a transaction proof containing the input voucher, the change voucher and the receipt voucher, and sends the transaction proof to the payee; S2. The payee verifies the transaction by verifying the zero-sum condition of the input voucher, the change voucher and the receipt voucher.

[0007] Preferably, the transaction information input in S1 includes the transaction amount. Encrypting the transaction information using a zero-knowledge proof algorithm based on elliptic curve cryptography technology to form an input voucher means encrypting the transaction amount, and the encryption formula is: Pi = Ri × G + Vi × H, where Pi is the input voucher, Ri is the decoy factor, Vi is the input transaction amount, and G and H are predefined base points on the elliptic curve; Decomposing the input voucher in S1 to obtain a change voucher and a receipt voucher, the change voucher and the receipt voucher are respectively expressed as: Pc = Rc × G + Vc × H, Pr = Rr × G + Vr × H, where Pc is the change voucher, Rc is the decoy factor, Vc is the change amount, Pr is the receipt voucher, Rr is the decoy factor, Vr is the receipt amount, and Vi = Vc + Vr; The specific way for the payee to verify the transaction by verifying the zero-sum condition of the input voucher, the change voucher and the receipt voucher is: verifying whether the decoy factors in the input voucher, the change voucher and the receipt voucher satisfy Pc + Pr – Pi = (Rc + Rr−Ri ) × G. If it is satisfied, the verification is successful; if not, the verification fails.

[0008] Preferably, the transaction proof in S1 further includes the signature Ss of the payer, the signature Sr of the payee, the temporary public keys Ks and Kr, and the hash value E, and forms the final signature as S′ = Ss + Sr; The verification of S2 also includes verifying the ownership of the certificate. The specific verification method is as follows: verify whether the final signature satisfies the equation S′×G = (Ks + Kr)×G + E × (Rc + Rr − Ri)×G. If it is satisfied, the verification of the certificate ownership is successful; if not, the verification of the certificate ownership fails.

[0009] Preferably, the hash value E is calculated by the following formula: E = SHA256 (uuid || P || P ||(Ks + Kr)×G), where SHA256 represents the 256-bit cryptographic hash algorithm, uuid represents the universally unique identifier used to uniquely identify the transaction request, and P represents the certificate generated by elliptic curve encryption, including the input certificate Pi, the change certificate Pc, and the receipt certificate Pr.

[0010] Preferably, S0 is also included before S1. S0. The payer and the payee establish a secure channel through Bluetooth pairing.

[0011] Preferably, the transaction information input by the payer in S1 also includes a timestamp, and the payee in S2 must perform the verification within the timestamp, otherwise it is considered a verification failure.

[0012] Preferably, in S2, if the verification is successful, the payer and the payee store and update the asset certificate information in the transaction proof, and send a feedback message of successful transaction to the payer; if the verification fails, the transaction is rejected, and a feedback message of failed transaction is sent to the payer.

[0013] Preferably, when the payer and the payee in S2 store and update the asset certificate information in the transaction proof, it specifically means that the payer deletes the original input certificate and only retains the change certificate; the payee stores the receipt certificate.

[0014] Adopting the technical solution provided by the present invention, compared with the prior art, it has the following beneficial effects: 1. The method for decomposing and verifying digital asset certificates based on blockchain involved in the present invention uses the zero-knowledge proof algorithm based on elliptic curve encryption technology to encrypt transaction information. The two parties to the transaction can complete the transaction verification without disclosing the specific transaction information and identities, effectively protecting the privacy of users. During the transaction process, sensitive data such as users' asset information and transaction amounts are processed in encrypted form, avoiding the risk of being stolen or tampered with during the transmission and verification of transaction information, and ensuring the confidentiality of the transaction and the anonymity of the user identity.

[0015] 2. The method for decomposing digital asset vouchers and verifying transactions based on blockchain according to the present invention decomposes transaction vouchers, that is, decomposes the input vouchers generated based on the transaction information input by the payer into change vouchers and receipt vouchers. The asset voucher decomposition technology enables complex assets to be carefully split according to different attributes, rights, and risks, and recombined according to actual needs. This not only simplifies the asset right confirmation process but also realizes the efficient transfer of assets and diverse transaction modes, making the management and transaction of assets more flexible and capable of meeting transaction requirements in different scenarios.

[0016] 3. The method for decomposing digital asset vouchers and verifying transactions based on blockchain according to the present invention adopts elliptic curve encryption technology and zero-knowledge proof algorithms to ensure that the security and legality of transactions can be verified without a network connection. Through secure communication channels such as Bluetooth, the two parties to the transaction can complete the transfer of assets and the generation and verification of proofs, reducing transaction risks and meeting the real-time requirements in high-frequency trading scenarios, making the transaction process more convenient and efficient. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] FIG. 1 is a schematic diagram of the transaction process of the present invention; FIG. 2 is a schematic diagram of the process of generating an asset decomposition proof; FIG. 3 is a schematic diagram of the process of verifying an asset decomposition proof. DETAILED DESCRIPTION OF THE INVENTION

[0018] To further understand the content of the present invention, the present invention will be described in detail in combination with embodiments. The following embodiments are used to illustrate the present invention but are not used to limit the scope of the present invention.

[0019] Referring to the attached Figure 1 As shown, the present invention relates to a method for decomposing digital asset vouchers and verifying transactions based on blockchain, which includes the following steps: S0. The payer opens the trading software, selects the "send" function, inputs the pairing code and confirms; the payee opens the trading software, selects the "receive" function, inputs the same pairing code, completes the Bluetooth pairing, and thus establishes a secure channel.

[0020] S1. Referring to the attached Figure 2 As shown, the payer inputs transaction information, that is, initiates an asset transfer operation through the trading center, transfers the assets to the trading software, and the trading software receives and stores the asset vouchers. The input transaction information includes the transaction amount, etc., and generates a transaction request including the transaction amount, the payer's asset voucher, and the payee's asset voucher; uses the zero-knowledge proof algorithm based on elliptic curve encryption technology to encrypt the transaction information and form an input voucher, specifically referring to encrypting the transaction amount, and the encryption formula is: Pi = Ri × G + Vi × H, Where, Pi is the input voucher, Ri is the decoy factor, Vi is the input transaction amount, and G and H are predefined base points on the elliptic curve; The input voucher is decomposed to obtain the change voucher and the receipt voucher, which are respectively expressed as: Pc = Rc × G + Vc × H, Pr = Rr × G + Vr × H, Where, Pc is the change voucher, Rc is the decoy factor, Vc is the change amount, Pr is the receipt voucher, Rr is the decoy factor, Vr is the receipt amount, and Vi = Vc + Vr; So far, a transaction proof (transaction commitment) containing the input voucher, the change voucher, and the receipt voucher is generated. The payer signs it through the zero-knowledge proof algorithm, and the signature is Ss. Then the transaction proof is sent to the payee.

[0021] The principle of elliptic curve encryption is as follows: Suppose two predefined base points G and H are on the elliptic curve. Given the private keys, that is, the decoy factors Ri, Rc, and Rr, the public keys P are Ri×G, Rc×G, and Rr×G respectively. Given the public key P, it is impossible to reverse-derive the private keys Ri, Rc, and Rr. Therefore, information such as the payer's assets, the payee's assets, and the transaction amount is hidden.

[0022] S2. Refer to the appendix Figure 3 As shown, after receiving the transaction proof, the payee extracts the verification parameters and verifies the transaction by verifying the zero-sum condition of the input voucher, the change voucher, and the receipt voucher, that is, verifying the zero-sum condition of the amount, and verifying whether the decoy factors in the input voucher, the change voucher, and the receipt voucher satisfy the following formula: Pc + Pr – Pi = ( Rc + Rr−Ri ) × G Meanwhile, the payee completes the signature Sr of the payee. Based on the payer's signature Ss, the final signature S′ is formed, S′ = Ss + Sr. The transaction software generates the temporary public keys Ks and Kr, and calculates the obtained hash value E. The calculation formula is: E = SHA256 (uuid || P || P ||( Ks + Kr)×G), where, SHA256 represents the 256-bit encryption hash algorithm, uuid represents the universally unique identifier used to uniquely identify the transaction request, and P represents the voucher generated by elliptic curve encryption, including the input voucher Pi, the change voucher Pc, and the receipt voucher Pr; verify the voucher ownership, that is, whether the final signature satisfies the following formula: S′× G = ( Ks + Kr )×G + E × ( Rc + Rr − Ri)×G; If the zero-sum condition of the amount and the voucher ownership respectively meet the above two verification formulas, the verification is successful; otherwise, the verification fails. If the verification is successful, feedback the successful verification to the payee. The payee sends the asset voucher (payment receipt Pr) to the trading software. The trading software checks the uniqueness of the payment receipt Pr. If the payment receipt Pr has not been used, transfer the corresponding amount to the payee's account and mark the payment receipt Pr as settled. If the payment receipt Pr already exists, reject the transaction and prompt "double-spending attack". After the transaction is successful, the payee stores the payment receipt Pr. The trading software sends a transaction success message to the payer, deletes the original input voucher, and only retains the change voucher. If the verification fails, feedback the failed verification to the payer. The trading software rejects the transaction and sends a feedback message of transaction failure to the payer.

[0023] The transaction information input by the payer in S1 further includes a timestamp. The payee in S2 must perform the verification within the timestamp, otherwise it is considered a failed verification.

[0024] The present invention has been described in detail in combination with the embodiments, but the above content is only the preferred embodiment of the present invention and cannot be considered as limiting the scope of implementation of the present invention. All equivalent changes and improvements made according to the scope of the application of the present invention should still fall within the scope covered by the patent of the present invention.

Claims

1. A method for decomposing digital asset vouchers and verifying transactions based on blockchain, characterized in that: It includes the following steps: S1. The payer inputs transaction information, encrypts the transaction information using a zero-knowledge proof algorithm based on elliptic curve cryptography technology, and forms an input voucher; Decompose the input voucher to obtain a change voucher and a receipt voucher, generate a transaction proof containing the input voucher, the change voucher, and the receipt voucher, and send the transaction proof to the payee; S2. The payee verifies the transaction by verifying the zero-sum conditions of the input voucher, the change voucher, and the receipt voucher.

2. The method for decomposing digital asset vouchers and transaction verification based on blockchain according to claim 1, characterized in that: The transaction information input in S1 includes the transaction amount. Encrypting the transaction information using a zero-knowledge proof algorithm based on elliptic curve cryptography technology and forming an input voucher means encrypting the transaction amount. The encryption formula is: Pi = Ri × G + Vi × H, where Pi is the input voucher, Ri is the decoy factor, Vi is the input transaction amount, and G and H are predefined base points on the elliptic curve; In S1, decomposing the input voucher to obtain a change voucher and a receipt voucher. The change voucher and the receipt voucher are respectively expressed as: Pc = Rc × G + Vc × H, Pr = Rr × G + Vr × H, where Pc is the change voucher, Rc is the decoy factor, Vc is the change amount, Pr is the receipt voucher, Rr is the decoy factor, Vr is the receipt amount, and Vi = Vc + Vr; The specific way for S2 to verify the transaction by verifying the zero-sum conditions of the input voucher, the change voucher, and the receipt voucher is: verify whether the decoy factors in the input voucher, the change voucher, and the receipt voucher satisfy Pc + Pr – Pi = ( Rc +Rr−Ri ) × G. If satisfied, the verification is successful; if not, the verification fails.

3. The method for decomposing digital asset vouchers and verifying transactions based on blockchain according to claim 2, wherein: The transaction proof in S1 also includes the payer's signature Ss, the payee's signature Sr, the temporary public keys Ks and Kr, and the hash value E, and forms the final signature S′ = Ss + Sr; The verification in S2 also includes verifying the voucher ownership. The specific verification method is: verify whether the final signature satisfies the equation S′× G = ( Ks + Kr )×G + E × ( Rc + Rr − Ri)×G. If satisfied, the voucher ownership verification is successful; if not, the voucher ownership verification fails.

4. The method for decomposing digital asset vouchers and verifying transactions based on blockchain according to claim 3, wherein: The hash value E is obtained by calculating through the following formula: E = SHA256 ( uuid || P || P ||( Ks + Kr)×G), where SHA256 represents the 256-bit encryption hash algorithm, uuid represents the universally unique identifier used to uniquely identify the transaction request, and P represents the voucher generated by elliptic curve encryption, including the input voucher Pi, the change voucher Pc, and the receipt voucher Pr.

5. The method for decomposing digital asset vouchers and trading verification based on blockchain according to claim 1, characterized in that: Before S1, there is also S0, S0. The payer and the payee establish a secure channel through Bluetooth pairing.

6. The method for decomposing digital asset vouchers and verifying transactions based on blockchain according to claim 1, characterized in that: The transaction information input by the payer in S1 also includes a time stamp. The payee in S2 must verify within the time stamp, otherwise it is considered a verification failure.

7. The method for decomposing digital asset vouchers and verifying transactions based on blockchain according to claim 1, wherein: In S2, if the verification is successful, the payer and the payee will store and update the asset voucher information in the transaction certificate, and send a feedback message of successful transaction to the payer; if the verification fails, the transaction will be rejected and a feedback message of failed transaction will be sent to the payer.

8. The method for decomposing digital asset vouchers and verifying transactions on a blockchain according to claim 7, wherein: The specific meaning of the payer and the payee storing and updating the asset voucher information in the transaction certificate in S2 is as follows: the payer deletes the original input voucher and only retains the change voucher; the payee stores the receipt voucher.

Images