CN114565384A - NFT privacy transaction method, computer device and storage medium - Google Patents

NFT privacy transaction method, computer device and storage medium Download PDF

Info

Publication number
CN114565384A
CN114565384A CN202210203719.XA CN202210203719A CN114565384A CN 114565384 A CN114565384 A CN 114565384A CN 202210203719 A CN202210203719 A CN 202210203719A CN 114565384 A CN114565384 A CN 114565384A
Authority
CN
China
Prior art keywords
amount
nft
check
hash
expendable
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210203719.XA
Other languages
Chinese (zh)
Inventor
马登极
吴思进
王志文
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Fuzamei Technology Co Ltd
Original Assignee
Hangzhou Fuzamei Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hangzhou Fuzamei Technology Co Ltd filed Critical Hangzhou Fuzamei Technology Co Ltd
Priority to CN202210203719.XA priority Critical patent/CN114565384A/en
Publication of CN114565384A publication Critical patent/CN114565384A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/383—Anonymous user system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3821—Electronic credentials
    • G06Q20/38215—Use of certificates or encrypted proofs of transaction rights
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Landscapes

  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Engineering & Computer Science (AREA)
  • Finance (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Technology Law (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)

Abstract

The invention provides an NFT private transaction method, computer equipment and a storage medium, wherein the method comprises the following steps: performing a NFT anonymous sell transaction: inputting the first hash ID and the first certification information into a first verification algorithm; inputting the second hash ID, the amount of collection and the second certification information into a second verification algorithm; if all items are verified, recording the anonymous selling order on the chain; perform NFT anonymous purchase transaction: inputting the third hash ID and the third certification information into a third verification algorithm; inputting the fourth hash ID, the first encryption amount and the fourth certification information into a fourth verification algorithm; inputting the fifth hash ID, the second encryption amount and the fifth certification information into a fifth verification algorithm; verifying whether a difference between the first encrypted amount and the second encrypted amount is equal to a product of the collected amount and a first ellipse base point; each validation passes, invalidating the second expendable check, validating the first and third expendable checks, and updating the NFT owner to a third hash ID. The invention realizes the private NFT transaction.

Description

NFT privacy transaction method, computer device and storage medium
Technical Field
The present application relates to the field of blockchain technologies, and in particular, to a NFT privacy transaction method, a computer device, and a storage medium.
Background
The NFT is called Non-feather Token in english, i.e. Non-homogeneous Token, and has the characteristics of inseparability, irreplaceability, uniqueness, etc.
Correspondingly, a homogenous token is a token where each token is identical, e.g. one token and another token, which are identical without any difference;
current NFTs are applied in such a way that each unique NFT can serve as an ownership label for a unique digital asset, e.g., NFT1NFT as a digital avatar ownership tag2As a ownership token for a virtual cat in a game, etc.
The current NFT transaction scheme has difficulty in realizing transactions that guarantee complete privacy of other information besides the amount of public transactions.
Disclosure of Invention
In view of the above-mentioned deficiencies or inadequacies in the prior art, it would be desirable to provide a NFT privacy transaction method, computer device, and storage medium that ensures complete privacy of information in addition to the transaction amount during the transaction.
In a first aspect, the present invention provides an NFT private transaction method applicable to a blockchain node, the blockchain deployed with an NFT private transaction contract, the NFT private transaction contract configured with a first zero knowledge proof circuit for verifying whether a seller transacts an owner of an NFT, a second zero knowledge proof circuit for verifying the legitimacy of an unproductive expendable check to be collected, a third zero knowledge proof circuit for verifying the legitimacy of an unproductive new hash ID of the transacted NFT submitted by a buyer, a fourth zero knowledge proof circuit for verifying the legitimacy of an validated expendable check used by the buyer, a fifth zero knowledge proof circuit for verifying the legitimacy of an unproductive expendable check submitted by the buyer with change, the method comprising:
performing NFT anonymous sell transactions:
inputting a first Hash ID and first certification information of a first NFT to be sold into a verification algorithm of a first zero-knowledge certification circuit for verification;
inputting the second Hash ID of the first expendable check to be paid, the amount of the check to be paid and the second proof information into a verification algorithm of a second zero knowledge proof circuit for verification;
if any verification fails, the execution of the NFT anonymous selling transaction fails;
if all the items are verified, recording the anonymous selling order of the first NFT on a block chain for the buyer to obtain;
perform NFT anonymous purchase transaction:
inputting the non-validated third hash ID and the third certification information of the first NFT into a verification algorithm of a third zero knowledge certification circuit for verification;
inputting the fourth hash ID, the first encrypted amount, and the fourth proof information of the validated second expendable check for payment into a verification algorithm of a fourth zero knowledge proof circuit for verification;
inputting a fifth hash ID, a second encryption amount and fifth proof information of the third expendable check for change, which is not validated, into a verification algorithm of a fifth change knowledge proof circuit for verification;
verifying whether a difference between the first encrypted amount and the second encrypted amount is equal to a product of the collected amount and a first ellipse base point;
if any one of the verification fails, the execution of the NFT anonymous purchase transaction fails;
the second expendable check is invalidated, the first expendable check and the third expendable check are validated, and the owner of the first NFT is updated to a third Hash ID.
Wherein the first encryption amount E1＝amount1*G+r*H；
A second encrypted amount E2＝amount2*G+r*H；
amount1Amount of second costable check, amount2The third amount of check spent, r is a random number, G is the base point of the first elliptic curve, and H is the base point of the second elliptic curve.
In a second aspect, the present invention provides a NFT private transaction method applicable to a user terminal of a seller, the blockchain deploying a NFT private transaction contract, the NFT private transaction contract being configured with a first zero knowledge proof circuit for verifying whether the seller is the owner of an NFT transacted by the seller, a second zero knowledge proof circuit for verifying the legitimacy of an uneffected expendable check to be collected, a third zero knowledge proof circuit for verifying the legitimacy of an uneffected new hash ID of the NFT transacted by a buyer, a fourth zero knowledge proof circuit for verifying the legitimacy of an already validated expendable check used by the buyer, and a fifth zero knowledge proof circuit for verifying the legitimacy of an uneffected change expendable check submitted by the buyer, the method comprising:
generating first proof information according to a first proof algorithm of a first zero-knowledge proof circuit; wherein the public input of the first attestation algorithm comprises a first hashed ID of a first NFT to be sold, and the private input of the first attestation algorithm comprises a first address of an owner of the first NFT and a first private key;
generating second proof information according to a second proof algorithm of a second zero knowledge proof circuit; wherein the public input of the second attestation algorithm comprises a second hash ID of the non-validated first expendable check to be paid and a payment amount, and the private input of the second attestation algorithm comprises the first address;
packaging to generate an NFT anonymous selling transaction comprising a first Hash ID, first certification information, a second Hash ID, a collection amount and second certification information, and sending the NFT anonymous selling transaction to a blockchain network for execution by blockchain nodes:
inputting the first Hash ID and the first certification information into a verification algorithm of a first zero knowledge certification circuit for verification;
inputting the second Hash ID, the collection amount and the second certification information into a verification algorithm of a second zero knowledge certification circuit for verification;
if any verification fails, the execution of the NFT anonymous selling transaction fails;
and recording the anonymous selling order of the first NFT to a blockchain for the buyer to obtain by the device when each item passes the verification.
Wherein the block link point is further configured for performing an NFT anonymous purchase transaction:
inputting the third hash ID and the third certification information of the first NFT into a verification algorithm of a third zero knowledge certification circuit for verification;
inputting the fourth hash ID, the first encrypted amount, and the fourth proof information of the validated second expendable check for payment into a verification algorithm of a fourth zero knowledge proof circuit for verification;
inputting a fifth hash ID, a second encryption amount and fifth proof information of the third expendable check for change, which is not validated, into a verification algorithm of a fifth change knowledge proof circuit for verification;
verifying whether a difference between the first encrypted amount and the second encrypted amount is equal to a product of the collected amount and a first ellipse base point;
if any one of the verification fails, the execution of the NFT anonymous purchase transaction fails;
invalidating the second expendable check, validating the first expendable check and the third expendable check, and updating the owner of the first NFT to the third hash ID, each validation pass;
first encryption amount E1＝amount1*G+r*H；
A second encrypted amount E2＝amount2*G+r*H；
amount1For the second amount of payable checks, amount2The third amount of check spent, r is a random number, G is the base point of the first elliptic curve, and H is the base point of the second elliptic curve.
In a third aspect, the present invention further provides an NFT private transaction method applied to a user side of a buyer, where a blockchain deploys an NFT private transaction contract, where the NFT private transaction contract is configured with a first zero knowledge proof circuit for verifying whether a seller transacts an owner of an NFT, a second zero knowledge proof circuit for verifying the validity of an unproductive expendable check to be collected, a third zero knowledge proof circuit for verifying the validity of an unproductive new hash ID of the transacted NFT submitted by the buyer, a fourth zero knowledge proof circuit for verifying the validity of an validated expendable check used by the buyer, and a fifth zero knowledge proof circuit for verifying the validity of an unproductive zero-changed expendable check submitted by the buyer, the method including:
generating third proof information according to a third proof algorithm of a third zero knowledge proof circuit; wherein the public input of the third attestation algorithm includes a third hash ID of the purchased first NFT that is not validated, and the private input of the third attestation algorithm includes a second address of the buyer;
generating fourth proof information according to a fourth proof algorithm of a fourth zero knowledge proof circuit; wherein the public input of the fourth attestation algorithm comprises the first encrypted amount, the private input of the fourth attestation algorithm comprises a fourth hash ID of the validated second expendable check, the second address and the second private key of the buyer, the amount of the second expendable check for payment;
generating fifth proof information according to a fifth proof algorithm of a fifth zero knowledge proof circuit; wherein the public input of the fifth proofing algorithm comprises a fifth hash ID of the non-validated third expendable check for change and the second encrypted amount, and the private input of the fifth proofing algorithm comprises the second address, the amount of the third expendable check;
packaging to generate an NFT anonymous purchase transaction comprising a third Hash ID, third certification information, a fourth Hash ID, a first encryption amount, fourth certification information, a fifth Hash ID, a second encryption amount and fifth certification information, and sending the NFT anonymous purchase transaction to a block chain network for execution by block chain nodes:
inputting the third Hash ID and the third certification information into a verification algorithm of a third zero knowledge certification circuit for verification;
inputting the fourth Hash ID, the first encryption amount and the fourth certification information into a verification algorithm of a fourth zero knowledge certification circuit for verification;
inputting the fifth Hash ID, the second encryption amount and the fifth certification information into a verification algorithm of a fifth zero knowledge certification circuit for verification;
verifying whether the difference between the first encryption amount and the second encryption amount is equal to the product of the collection amount and the first ellipse base point;
if any authentication fails, the NFT anonymous purchase transaction fails to execute;
the second expendable check is invalidated, the first expendable check and the third expendable check are validated, and the owner of the first NFT is updated to a third Hash ID.
Wherein an anonymous sale order for a first NFT is to perform an NFT anonymous sale transaction from a blockchain node, and is to be recorded on the blockchain upon verification by:
inputting the first Hash ID and the first certification information of the first NFT into a verification algorithm of a first zero knowledge certification circuit for verification;
inputting the second Hash ID of the first expendable check to be paid, the amount of the check to be paid and the second proof information into a verification algorithm of a second zero knowledge proof circuit for verification;
first encryption amount E1＝amount1*G+r*H；
A second encrypted amount E2＝amount2*G+r*H；
amount1Amount of second costable check, amount2The third amount of check spent, r is a random number, G is the base point of the first elliptic curve, and H is the base point of the second elliptic curve.
In a fourth aspect, the present invention also provides a computer device comprising one or more processors and memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform the NFT privacy transaction method provided in accordance with embodiments of the present invention.
In a fifth aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute the NFT privacy transaction method provided according to the embodiments of the present invention.
According to the NFT private transaction method, the computer device and the storage medium provided by the embodiments of the invention, the first zero-knowledge proving circuit used for verifying whether the seller is the NFT owner is configured on the block chain, so that the seller can be guaranteed to sell anonymously; the third zero knowledge proving circuit for verifying the validity of the new Hash ID provided by the buyer is configured, so that the anonymous purchase of the buyer is guaranteed; by configuring the second/fourth/fifth zero knowledge proving circuit and designing the specific first encryption amount and the second encryption amount, the complete privacy of information such as a payment account, a spent amount, a change amount and the like except the transaction fund in the transaction process is guaranteed, and finally the NFT privacy transaction method for guaranteeing the complete privacy of other information except the transaction fund in the transaction process is realized.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of an NFT privacy transaction method according to an embodiment of the present invention.
Fig. 2 is a flowchart of another NFT privacy transaction method according to an embodiment of the present invention.
Fig. 3 is a flowchart of another NFT privacy transaction method according to an embodiment of the present invention.
Fig. 4 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 is a flowchart of an NFT privacy transaction method according to an embodiment of the present invention.
As shown in fig. 1, in the present embodiment, the present invention provides an NFT private transaction method applicable to a blockchain node, where a NFT private transaction contract is deployed, the NFT private transaction contract being configured with a first zero knowledge proof circuit for verifying whether a seller transacts an owner of an NFT, a second zero knowledge proof circuit for verifying the validity of an unproductive expendable check to be collected, a third zero knowledge proof circuit for verifying the validity of an unproductive new hash ID of the transacted NFT submitted by a buyer, a fourth zero knowledge proof circuit for verifying the validity of an validated expendable check used by the buyer, and a fifth zero knowledge proof circuit for verifying the validity of an unproductive zero-changed expendable check submitted by the buyer, the method including:
s11: performing a NFT anonymous sell transaction:
s111: inputting a first Hash ID and first certification information of a first NFT to be sold into a verification algorithm of a first zero-knowledge certification circuit for verification;
s113: inputting the second Hash ID of the first expendable check to be collected which does not take effect, the collection amount and the second certification information into a verification algorithm of a second zero knowledge certification circuit for verification;
if any authentication fails, the execution of the NFT anonymous selling transaction fails;
if the items pass the verification, step S115 is executed: recording anonymous sale orders of the first NFT onto a blockchain for acquisition by a buyer's device;
s13: perform NFT anonymous purchase transaction:
s131: inputting the non-validated third hash ID and the third certification information of the first NFT into a verification algorithm of a third zero knowledge certification circuit for verification;
s133: inputting the fourth hashID, the first encryption amount, and the fourth proof information of the validated second expendable check for payment into a verification algorithm of a fourth zero knowledge proof circuit for verification;
s135: inputting a fifth hash ID, a second encryption amount and fifth proof information of the third expendable check for change, which is not validated, into a verification algorithm of a fifth change knowledge proof circuit for verification;
s137: verifying whether a difference between the first encrypted amount and the second encrypted amount is equal to a product of the collected amount and a first ellipse base point;
if any one of the verification fails, the execution of the NFT anonymous purchase transaction fails;
if the items are verified, step S139 is executed: invalidating the second expendable check, validating the first expendable check and the third expendable check, and updating the owner of the first NFT to the third Hash ID.
Wherein the first encryption amount E1＝amount1*G+r*H；
A second encrypted amount E2＝amount2*G+r*H；
amount1Amount of second costable check, amount2The third check amount is spent, r is a random number, G is a first elliptic curve base point, and H is a second elliptic curve base point.
In the present application, the verification principle of each zero-knowledge proof circuit is as follows:
1. the first zero knowledge proof circuit is verified based on the following principle:
HashID1＝hash(ownerAddr+r1)；
ownerAddr＝Addr(Pub(ownerPrivateKey))；
wherein, HashID1For the first hash ID, owereraddr is the first address of the owner of the first NFT, r1 is a random number, owerprivatekey is the first private key of the owner of the first NFT, Pub () is the algorithm that generates the public key from the private key, Addr () is the algorithm that generates the address from the public key, and hash () is the hash algorithm.
Wherein those skilled in the art will appreciate that the random number r1 may be replaced by other (unpublished) information to achieve the same technical effect.
2. The second zero knowledge proof circuit is verified based on the following principle:
HashID2＝hash(ownerAddr+amount+r2)；
wherein, HashID2Where amount is the transaction amount (i.e., the amount of the first expendable check to be collected), r2 is a random number. Those skilled in the art will appreciate that ownerAddr can be replaced by corresponding public key information, and r2 can be replaced by other (unpublished) information to achieve the same technical effect.
3. The third zero knowledge proof circuit is verified based on the following principle:
HashID3＝hash(buyerAddr+r3)；
wherein, HashID3Is a thirdHash ID, buyerAddr is the second address of the buyer, r3 is a random number. It will be appreciated by those skilled in the art that the random number r3 can be replaced by other (owner not disclosed) information to achieve the same technical effect.
4. The fourth zero knowledge proof circuit is verified based on the following principle:
HashID4＝hash(buyerAddr+amount1+r4)；
buyerAddr＝Addr(Pub(buyerPrivateKey))；
HashID4*merkle_path＝merkle_root；
wherein, HashID4Is a fourth Hash ID, amount1For the amount of the second expendable check, r4 is a random number, buyerPrivateKey is the second private key of the buyer, merkle _ path is the corresponding merkel path of the second expendable check in the merkel tree of the expendable check, and merkle _ root is the root of the merkel tree of the expendable check.
Specifically, in this embodiment, the blockchain marks whether a costable check is in effect by recording the hash ID of the validated costable check into the costable merck tree. The expendable checks whose hash IDs are not in the expendable Mercker tree are not validated. Another use of a waste merkel tree for marking that a cheque has been used and is wasted, and is not expanded in particular.
It will be appreciated by those skilled in the art that while in other embodiments the blockchain marks whether the expendable checks are in effect using other means commonly used in the art, it may be verified that the expendable checks are in effect by a corresponding verification means (rather than the verification means described above in connection with the mercker path/root).
Those skilled in the art will also understand that the same technical effects can be achieved by replacing buyerAddr with corresponding public key information, and replacing r4 with other (unpublished) information.
5. The fifth zero knowledge proof circuit is verified based on the following principle:
HashID5＝hash(buyerAddr+amount2+r5)；
buyerAddr＝Addr(Pub(buyerPrivateKey))；
wherein, HashID5Is a fifth Hash ID, amount2R5 is a random number for the third amount of expendable checks.
Those skilled in the art will also understand that the same technical effects can be achieved by replacing buyerAddr with corresponding public key information, and replacing r5 with other (unpublished) information.
Those skilled in the art will understand how to generate a zero-knowledge proof circuit according to the above verification principles in a zero-knowledge proof architecture, and:
the generated first zero-knowledge proof circuit comprises a first proof algorithm progress (), a first verification algorithm Verify1(), and may further comprise a first generation algorithm Setup1 ();
the generated second zero-knowledge proof circuit includes a second proof algorithm pro 2(), a second verification algorithm Verify2(), and may further include a second generation algorithm Setup2 ();
the generated third zero knowledge proof circuit comprises a third proof algorithm pro 3(), a third verification algorithm Verify3(), and may further comprise a third generation algorithm Setup3 ();
the generated fourth zero knowledge proof circuit comprises a fourth proof algorithm pro 4(), a fourth verification algorithm Verify4(), and may further comprise a fourth generation algorithm Setup4 ();
the generated fifth zero knowledge proof circuit includes a fifth proof algorithm pro 5(), a fifth verification algorithm Verify5(), and may further include a fifth generation algorithm Setup5 ();
the detailed process is not described herein.
NFT is sold as user A below3User B purchases NFT3The block chain implements the private transaction by the method shown in fig. 1, and fig. 1 is exemplarily illustrated.
When the user A wants to sell NFT at the price of 100-element digital RMB3When the user A uses NFT3HashID of (HashID)NFT3) As public input of the first proof algorithm pro 1(), a first address Addr1, a first private key p1 and a random number are usedr1 as private input to the first proof algorithm pro 1(), first proof information pro1：
Provel(HashIDNFT3，Addrl、p1、r1)→prove1；
A second hash ID of the first non-validated expendable check to be collected is then generated from the first address Addr1, the collection amount 100, and the random number r 2:
HashlDCheck1＝hash(Addrl+100+r2)；
and a second HashID (HashID)Check1) The collection amount 100 is used as the public input of the second proof algorithm pro 2(), the first address Addr1 and the random number r2 are used as the private input of the second proof algorithm pro 2(), and the second proof information pro is generated2：
Prove2(HashID Check1、100，Addr1、r2)→prove2；
The final packing generation includes a first HashID (HashID)NFT3) First proof information prove1Second HashID (HashID)Check1) Amount of collection 100 and second proof information cave2The NFT anonymous sale transaction tx1 and sends it to the blockchain network.
In step S11, the tile chain node performs NFT anonymous sell transaction tx 1:
in step S111, the first hash ID (HashID) is addedNFT3) First proof information prove1Inputting a first verification algorithm Verify1() for verification:
Verify1(HashIDNFT3，provel)→Yes/No；
when the output result of the first verification algorithm Verify1() is No, the verification fails, tx1 execution fails;
in step S113, the second hash ID (HashID) is addedCheck1) Amount of collection 100 and second proof information cave2Inputting a second verification algorithm Verify2() for verification:
Verify2(HashID Check1、100，prove2)→Yes/No；
when the output result of the second verification algorithm Verify2() is No, the verification fails, tx1 execution fails;
when both output results of Verify1() and Verify2() are Yes, step S115 is executed to put NFT on3The anonymous selling order (public information is only selling price 100-element digital RMB) is recorded on the block chain for the buyer to obtain.
When the user B sees the order and decides to spend 100-element digital RMB to purchase NFT3In this case, the ue of the user b first needs to be NFT according to the address Addr2 of the user b3Construct a new non-validated hash ID:
HashIDNFT3_new＝hash(Addr2+r3)；
and generating third proof information pro by taking a newly constructed Hash ID (Hash ID FT3) as the public input of a third proof algorithm pro 3(), taking a second address Addr2 and a random number r3 as the private input of a third proof algorithm pro 3(), and3：
Prove3(HashIDNFT3_new，Addr2、r3)→prove3；
and the user end of the user B also needs to search for a expendable check (note: here, payment is performed by one expendable check for example, in more embodiments, payment may be performed by a plurality of expendable checks with the amount smaller than the transaction amount and the total amount not smaller than the transaction amount), the amount of change is determined to be 28 yuan (i.e., the amount of the third expendable check) according to the amount of the second expendable check being 128 yuan and the transaction amount being 100 yuan, and a first encrypted amount E is generated respectively, if the user end of the user B needs to search for a expendable check with the amount not smaller than 100 yuan (note: here, the example, payment is performed by a plurality of expendable checks with the amount smaller than the transaction amount and the total amount not smaller than the transaction amount), for example, if a second expendable check with the amount of 128 yuan is found1And a second encrypted amount E2：
E1＝128*G+r*H；
E2＝28*G+r*H；
Using the root merkle _ root of the mercker tree of the second costable check, the waste hash of the second costable checkvoidA first encryption amount E1As public input to the fourth proofing algorithm, Prove4(), the hash ID (HashID) of the second expendable check is usedCheck2) Second, secondMerker path merkle _ path, second address Addr2, random number r, second private key p2, amount of second costable check 128 and random number r4 corresponding to costable check in merkel tree of costable check are used as private input of fourth proof algorithm pro 4(), and fourth proof information pro is generated4：
Prove4(merkle_root、hashvoid、E1，HashIDCheck2、merkle_path、
Addr2、r、128、r4)→prove4；
Generating a fifth hash ID of the non-validated third expendable check to be changed from the second address Addr2, the change amount 28, and the random number r 5:
HashIDCheck3＝hash(Addr2+28+r5)；
and a fifth HashID (HashID)Check3) A second encryption amount E2As a public input of the fifth proof algorithm pro 5(), the second address Addr2, the change amount 28, the random number r, and the random number r5 are used as private inputs of the fifth proof algorithm pro 5(), and fifth proof information pro is generated5：
Prove5(HashIDCheck3、E2，Addr2、28、r、r5)→prove5；
Final packing generation includes HashIDNFT3_new、prove3、merkle_root、hashvoid、E1、prove4、HashIDCheck3、E2、prove5And sent to the blockchain network, the NFT anonymous purchase transaction tx 2.
In step S13, the tile chain node performs the NFT anonymous purchase transaction tx 2:
in step S131, the HashID is addedNFT3_new、prove3Inputting a verification algorithm of a third zero knowledge proof circuit for verification:
Verify3(HashIDNFT3_new，prove3)→Yes/No；
when the output result of the third verification algorithm Verify3() is No, the verification fails, tx2 execution fails;
in step S133, merge _ root、hashvoid、E1、prove4Inputting a verification algorithm of a fourth zero knowledge proof circuit for verification:
Verify4(merkle_root、hashvoid、E1，prove4)→Yes/No；
when the output result of the fourth verification algorithm Verify4() is No, the verification fails, and the tx2 execution fails;
in step S135, the HashID is addedCheck3、E2、prove5Inputting a verification algorithm of a fifth zero knowledge proof circuit for verification:
Verify5(HashIDCheck3、E2，prove5)→Yes/No；
when the output result of the fifth verification algorithm Verify5() is No, the verification fails, tx2 execution fails;
in step S137, E is verified1-E2Whether or not equal to 100 × G: if not, the verification fails, and the tx2 execution fails;
when all of the verifications of steps S131-S137 pass, step S139 is performed, the voided hash of the second expendable check is added to the voided Mercker tree to invalidate the second expendable check, the hash IDs of the first expendable check and the third expendable check are added to the expendable check Mercker tree to validate the first expendable check and the third expendable check, and NFT is performed3By HashIDNFT3Update to HashIDNFT3_new。
In the above example, only the transaction amount of 100 dollars is disclosed throughout the transaction.
The above embodiment ensures that the seller can sell anonymously by configuring the first zero-knowledge proof circuit for verifying whether the seller is the NFT owner on the blockchain; the third zero knowledge proving circuit for verifying the validity of the new Hash ID provided by the buyer is configured, so that the anonymous purchase of the buyer is guaranteed; by configuring the second/fourth/fifth zero knowledge proving circuit and designing the specific first encryption amount and the second encryption amount, the complete privacy of information such as a payment account, a spent amount, a change amount and the like except the transaction fund in the transaction process is guaranteed, and finally the NFT privacy transaction method for guaranteeing the complete privacy of other information except the transaction fund in the transaction process is realized.
Fig. 2 is a flowchart of another NFT privacy transaction method according to an embodiment of the present invention. The method illustrated in fig. 2 may be performed in conjunction with the method illustrated in fig. 1.
As shown in fig. 2, in this embodiment, the present invention further provides an NFT private transaction method applied to a user side of a seller, where a NFT private transaction contract is deployed in a blockchain, where the NFT private transaction contract is configured with a first zero knowledge proof circuit for verifying whether the seller is the owner of the NFT transacted by the seller, a second zero knowledge proof circuit for verifying the validity of an unproductive expendable check to be collected, a third zero knowledge proof circuit for verifying the validity of an unproductive new hash ID of the NFT transacted by a buyer, a fourth zero knowledge proof circuit for verifying the validity of an validated expendable check used by the buyer, and a fifth zero knowledge proof circuit for verifying the validity of an unproductive zero-changed expendable check submitted by the buyer, the method including:
s21: generating first proof information according to a first proof algorithm of a first zero-knowledge proof circuit; wherein the public input of the first attestation algorithm comprises a first hashed ID of a first NFT to be sold, and the private input of the first attestation algorithm comprises a first address of an owner of the first NFT and a first private key;
s23: generating second proof information according to a second proof algorithm of a second zero knowledge proof circuit; wherein the public input of the second attestation algorithm comprises a second hash ID of the non-validated first expendable check to be collected and the amount collected, and the private input of the second attestation algorithm comprises the first address;
s25: packaging to generate an NFT anonymous selling transaction comprising a first Hash ID, first certification information, a second Hash ID, a collection amount and second certification information, and sending the NFT anonymous selling transaction to a blockchain network for execution by blockchain nodes:
inputting the first Hash ID and the first certification information into a verification algorithm of a first zero knowledge certification circuit for verification;
inputting the second Hash ID, the collection amount and the second certification information into a verification algorithm of a second zero knowledge certification circuit for verification;
if any verification fails, the execution of the NFT anonymous selling transaction fails;
and recording the anonymous selling order of the first NFT to a blockchain for the buyer to obtain by the device when each item passes the verification.
Wherein the block link point is further configured for performing an NFT anonymous purchase transaction:
inputting the third hash ID and the third certification information of the first NFT into a verification algorithm of a third zero knowledge certification circuit for verification;
inputting the fourth hash ID, the first encrypted amount, and the fourth proof information of the validated second expendable check for payment into a verification algorithm of a fourth zero knowledge proof circuit for verification;
inputting a fifth hash ID, a second encryption amount and fifth proof information of the third expendable check for change, which is not validated, into a verification algorithm of a fifth change knowledge proof circuit for verification;
verifying whether a difference between the first encrypted amount and the second encrypted amount is equal to a product of the collected amount and a first ellipse base point;
if any one of the verification fails, the execution of the NFT anonymous purchase transaction fails;
invalidating the second expendable check, validating the first expendable check and the third expendable check, and updating the owner of the first NFT to the third hash ID, each validation pass;
first encryption amount E1＝amount1*G+r*H；
A second encrypted amount E2＝amount2*G+r*H；
amount1Amount of second costable check, amount2The third amount of check spent, r is a random number, G is the base point of the first elliptic curve, and H is the base point of the second elliptic curve.
The transaction principle of the method shown in fig. 2 can refer to the method shown in fig. 1, and the detailed process is not described again.
Fig. 3 is a flowchart of another NFT privacy transaction method according to an embodiment of the present invention. The method illustrated in FIG. 3 may be performed in conjunction with the method illustrated in FIG. 1/2.
As shown in fig. 3, in this embodiment, the present invention further provides an NFT private transaction method applied to a user side of a buyer, where a NFT private transaction contract is deployed at a blockchain, where the NFT private transaction contract is configured with a first zero knowledge proof circuit for verifying whether a seller is an owner of an NFT transacted by the seller, a second zero knowledge proof circuit for verifying the validity of an unproductive expendable check to be collected, a third zero knowledge proof circuit for verifying the validity of an unproductive new hash ID of the NFT transacted by the buyer, a fourth zero knowledge proof circuit for verifying the validity of an validated expendable check used by the buyer, and a fifth zero knowledge proof circuit for verifying the validity of an unproductive zero-changed expendable check submitted by the buyer, the method including:
s31: generating third proof information according to a third proof algorithm of a third zero knowledge proof circuit; wherein the public input of the third attestation algorithm includes a third hash ID of the purchased first NFT that is not validated, and the private input of the third attestation algorithm includes a second address of the buyer;
s33: generating fourth proof information according to a fourth proof algorithm of a fourth zero knowledge proof circuit; wherein the public input of the fourth attestation algorithm comprises the first encrypted amount, the private input of the fourth attestation algorithm comprises a fourth hash ID of the validated second expendable check, the second address and the second private key of the buyer, the amount of the second expendable check for payment;
s35: generating fifth proof information according to a fifth proof algorithm of a fifth zero knowledge proof circuit; wherein the public input of the fifth proofing algorithm comprises a fifth hash ID of the non-validated third expendable check for change and the second encrypted amount, and the private input of the fifth proofing algorithm comprises the second address, the amount of the third expendable check;
s37: packaging to generate an NFT anonymous purchase transaction comprising a third Hash ID, third certification information, a fourth Hash ID, a first encryption amount, fourth certification information, a fifth Hash ID, a second encryption amount and fifth certification information, and sending the NFT anonymous purchase transaction to a block chain network for execution by block chain nodes:
inputting the third Hash ID and the third certification information into a verification algorithm of a third zero knowledge certification circuit for verification;
inputting the fourth Hash ID, the first encryption amount and the fourth certification information into a verification algorithm of a fourth zero-knowledge certification circuit for verification;
inputting the fifth Hash ID, the second encryption amount and the fifth certification information into a verification algorithm of a fifth zero knowledge certification circuit for verification;
verifying whether a difference between the first encrypted amount and the second encrypted amount is equal to a product of the collected amount and a first ellipse base point;
if any one of the verification fails, the execution of the NFT anonymous purchase transaction fails;
the second expendable check is invalidated, the first expendable check and the third expendable check are validated, and the owner of the first NFT is updated to a third Hash ID.
Wherein an anonymous sale order for a first NFT is to perform an NFT anonymous sale transaction from a blockchain node, and is to be recorded on the blockchain upon verification by:
inputting the first Hash ID and the first certification information of the first NFT into a verification algorithm of a first zero knowledge certification circuit for verification;
inputting the second Hash ID of the first expendable check to be paid, the amount of the check to be paid and the second proof information into a verification algorithm of a second zero knowledge proof circuit for verification;
first encryption amount E1＝amount1*G+r*H；
A second encrypted amount E2＝amount2*G+r*H；
amount1Amount of second costable check, amount2The third amount of check spent, r is a random number, G is the base point of the first elliptic curve, and H is the base point of the second elliptic curve.
The transaction principle of the method shown in fig. 3 can also refer to the method shown in fig. 1, and the detailed process is not repeated.
Fig. 4 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
As shown in fig. 4, as another aspect, the present application also provides a computer apparatus including one or more Central Processing Units (CPUs) 401 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)402 or a program loaded from a storage section 408 into a Random Access Memory (RAM) 403. In the RAM403, various programs and data necessary for the operation of the device 400 are also stored. The CPU401, ROM402, and RAM403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
The following components are connected to the I/O interface 405: an input portion 406 including a keyboard, a mouse, and the like; an output section 407 including a display device such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 408 including a hard disk and the like; and a communication section 409 including a network interface card such as a LAN card, a modem, or the like. The communication section 409 performs communication processing via a network such as the internet. A driver 410 is also connected to the I/O interface 405 as needed. A removable medium 411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 410 as necessary, so that a computer program read out therefrom is mounted into the storage section 408 as necessary.
In particular, according to an embodiment of the present disclosure, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing any of the methods described above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 409 and/or installed from the removable medium 411.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present application.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each unit may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of such a unit or module does not in some way constitute a limitation on the unit or module itself.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements in which any combination of the above features or their equivalents is incorporated without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.

Claims (5)

1. An NFT private transaction method, characterized in that a blockchain deploys NFT private transaction contracts configured with a first zero knowledge proof circuit for verifying whether a seller transacts an owner of an NFT, a second zero knowledge proof circuit for verifying the legitimacy of an unproductive expendable check to be paid, a third zero knowledge proof circuit for verifying the legitimacy of an unproductive new hash ID of a transacted NFT submitted by a buyer, a fourth zero knowledge proof circuit for verifying the legitimacy of a validated expendable check used by a buyer, a fifth zero knowledge proof circuit for verifying the legitimacy of an unproductive expendable check submitted by a buyer with changes, the method being applicable to blockchain nodes, the method comprising:
performing NFT anonymous sell transactions:
inputting a first Hash ID and first certification information of a first NFT to be sold into a verification algorithm of the first zero-knowledge certification circuit for verification;
inputting a second hash ID of the first expendable check to be paid for which the check is not validated, a payment amount, and second proof information into a verification algorithm of the second zero knowledge proof circuit for verification;
if any verification fails, the NFT anonymous selling transaction fails to execute;
if all the items are verified, recording the anonymous selling order of the first NFT on a block chain for the buyer to obtain;
perform NFT anonymous purchase transaction:
inputting the non-validated third hash ID and third attestation information of the first NFT into a verification algorithm of the third zero knowledge attestation circuit for verification;
inputting a fourth hash ID of the validated second expendable check for payment, the first encrypted amount, and fourth proof information into a verification algorithm of the fourth zero knowledge proof circuit for verification;
inputting a fifth hash ID of a non-validated third expendable check for change, a second encrypted amount, and fifth proof information into a verification algorithm of the fifth change knowledge proof circuit for verification;
verifying whether a difference between the first encrypted amount and the second encrypted amount is equal to a product of the collected amount and a first ellipse base point;
if any authentication fails, the execution of the NFT anonymous purchase transaction fails;
invalidating the second expendable check, validating the first expendable check and the third expendable check, and updating an owner of the first NFT to the third Hash ID, each validation pass;
wherein the first encryption amount E1＝amount1*G+r*H；
A second encryption amount E2＝amount2*G+r*H；
amount1Amount of said second costable check, amount2The amount of the third spending check, r is a random number, G is the first elliptic curve base point, and H is the second elliptic curve base point.
2. An NFT private transaction method, wherein a blockchain deploys an NFT private transaction contract configured with a first zero knowledge proof circuit for verifying whether a seller transacts an NFT owner, a second zero knowledge proof circuit for verifying the legitimacy of an unproductive expendable check to be collected, a third zero knowledge proof circuit for verifying the legitimacy of an unproductive new hash ID of a transacted NFT submitted by a buyer, a fourth zero knowledge proof circuit for verifying the legitimacy of a validated expendable check used by the buyer, a fifth zero knowledge proof circuit for verifying the legitimacy of an unproductive expendable check submitted by the buyer with zero change, the method being applicable to a user end of the seller, the method comprising:
generating first proof information according to a first proof algorithm of the first zero knowledge proof circuit; wherein the public input of the first attestation algorithm comprises a first hashed ID of a first NFT to be sold, and the private input of the first attestation algorithm comprises a first address and a first private key of an owner of the first NFT;
generating second proof information according to a second proof algorithm of the second zero knowledge proof circuit; wherein the public input of the second attestation algorithm comprises a second hash ID of the non-validated first expendable check to be paid and a payment amount, the private input of the second attestation algorithm comprising the first address;
packaging and generating an NFT anonymous selling transaction comprising the first Hash ID, the first certification information, the second Hash ID, the collection amount and the second certification information, and sending the NFT anonymous selling transaction to a block chain network for a block chain node to execute:
inputting the first hash ID and the first proof information into a verification algorithm of the first zero knowledge proof circuit for verification;
inputting the second hash ID, the amount received and the second proof information into a verification algorithm of the second zero knowledge proof circuit for verification;
if any verification fails, the NFT anonymous selling transaction fails to execute;
if all the items are verified, recording the anonymous selling order of the first NFT on a block chain for the buyer to obtain;
wherein the block link point is further configured for performing an NFT anonymous purchase transaction:
inputting a third hash ID and third attestation information of the first NFT into a verification algorithm of the third zero knowledge attestation circuit for verification;
inputting a fourth hash ID of the validated second expendable check for payment, the first encrypted amount, and fourth proof information into a verification algorithm of the fourth zero knowledge proof circuit for verification;
inputting a fifth hash ID of a non-validated third expendable check for change, a second encrypted amount, and fifth proof information into a verification algorithm of the fifth change knowledge proof circuit for verification;
verifying whether a difference between the first encrypted amount and the second encrypted amount is equal to a product of the collected amount and a first ellipse base point;
if any authentication fails, the execution of the NFT anonymous purchase transaction fails;
invalidating the second expendable check, validating the first expendable check and the third expendable check, and updating an owner of the first NFT to the third Hash ID, each validation pass;
first encryption amount E1＝amount1*G+r*H；
A second encryption amount E2＝amount2*G+r*H；
amount1Amount of said second costable check, amount2The amount of the third spending check, r is a random number, G is the first elliptic curve base point, and H is the second elliptic curve base point.
3. An NFT private transaction method, wherein a blockchain deploys an NFT private transaction contract configured with a first zero knowledge proof circuit for verifying whether a seller transacts an NFT owner, a second zero knowledge proof circuit for verifying the legitimacy of an unproductive expendable check to be collected, a third zero knowledge proof circuit for verifying the legitimacy of an unproductive new hash ID of a transacted NFT submitted by a buyer, a fourth zero knowledge proof circuit for verifying the legitimacy of an validated expendable check used by the buyer, a fifth zero knowledge proof circuit for verifying the legitimacy of an unproductive expendable check submitted by the buyer with zero change, the method being applicable to a user end of the buyer, the method comprising:
generating third proof information according to a third proof algorithm of the third zero knowledge proof circuit; wherein the public input of the third attestation algorithm comprises a non-validated third hash ID of the purchased first NFT and the private input of the third attestation algorithm comprises a second address of the buyer;
generating fourth proof information according to a fourth proof algorithm of the fourth zero knowledge proof circuit; wherein the public input of the fourth attestation algorithm comprises a first encrypted amount, the private input of the fourth attestation algorithm comprises a fourth hash ID of a validated second expendable check for payment, a second address and a second private key of the buyer, an amount of the second expendable check;
generating fifth attestation information according to a fifth attestation algorithm of the fifth zero knowledge attestation circuit; wherein the public input of the fifth attestation algorithm includes a fifth hash ID of a non-validated third expendable check for change and a second encrypted amount, and the private input of the fifth attestation algorithm includes the second address, the amount of the third expendable check;
packaging and generating an NFT anonymous purchase transaction comprising the third Hash ID, the third certification information, the fourth Hash ID, the first encryption amount, the fourth certification information, the fifth Hash ID, the second encryption amount and the fifth certification information, and sending the NFT anonymous purchase transaction to a blockchain network for execution by a blockchain node:
inputting the third hash ID and the third proof information into a verification algorithm of the third zero knowledge proof circuit for verification;
inputting the fourth hash ID, the first encryption amount and the fourth certification information into a verification algorithm of the fourth zero knowledge proof circuit for verification;
inputting the fifth hash ID, the second encryption amount and the fifth proof information into a verification algorithm of the fifth zero knowledge proof circuit for verification;
verifying whether a difference between the first encrypted amount and the second encrypted amount is equal to a product of the collected amount and a first ellipse base point;
if any authentication fails, the execution of the NFT anonymous purchase transaction fails;
invalidating the second expendable check, validating the first expendable check and the third expendable check, and updating the owner of the first NFT to the third Hash ID, each validation pass;
wherein the anonymous sale order for the first NFT is to execute an NFT anonymous sale transaction from a blockchain node, and is to be recorded on the blockchain upon verification by:
inputting the first hash ID and the first certification information of the first NFT into a verification algorithm of the first zero knowledge certification circuit for verification;
inputting a second hash ID of the first expendable check to be paid for which the check is not validated, a payment amount, and second proof information into a verification algorithm of the second zero knowledge proof circuit for verification;
first encryption amount E1＝amountl*G+r*H；
A second encrypted amount E2＝amount2*G+r*H；
amount1Amount of second costable checks, amount2The amount of the third spending check, r is a random number, G is the first elliptic curve base point, and H is the second elliptic curve base point.
4. A computer device, characterized in that the device comprises:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-3.
5. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-3.
CN202210203719.XA 2022-03-03 2022-03-03 NFT privacy transaction method, computer device and storage medium Pending CN114565384A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210203719.XA CN114565384A (en) 2022-03-03 2022-03-03 NFT privacy transaction method, computer device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210203719.XA CN114565384A (en) 2022-03-03 2022-03-03 NFT privacy transaction method, computer device and storage medium

Publications (1)

Publication Number Publication Date
CN114565384A true CN114565384A (en) 2022-05-31

Family

ID=81717743

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210203719.XA Pending CN114565384A (en) 2022-03-03 2022-03-03 NFT privacy transaction method, computer device and storage medium

Country Status (1)

Country Link
CN (1) CN114565384A (en)

Similar Documents

Publication Publication Date Title
US11244313B2 (en) Systems, methods, and apparatuses for implementing declarative smart actions for coins and assets transacted onto a blockchain using distributed ledger technology (DLT)
US11488176B2 (en) Systems, methods, and apparatuses for implementing certificates of authenticity of digital twins transacted onto a blockchain using distributed ledger technology (DLT)
US11694207B2 (en) Securing an exchange item associated with fraud
JP6925346B2 (en) Exchange using blockchain-based tokenization
JP6957482B2 (en) Methods and systems for secure transfer of entities on a blockchain basis
JP2023134665A (en) Blockchain implemented method and system
US20170243193A1 (en) Hybrid blockchain
JP7173976B2 (en) Computer-implemented method and system
EP4315214A2 (en) Advanced transactional protocols and ecosystem for smart contract authoring and deployment
WO2020253682A1 (en) Coupon management method, apparatus and device, and storage medium
CN111414650A (en) Order processing method and system based on block chain storage certificate
EP3435310A1 (en) System and method of a decentralized payment network
US11798359B2 (en) Blockchain-based smart contract instant lottery ticket
Hill et al. Blockchain Developer's Guide: Develop smart applications with Blockchain technologies-Ethereum, JavaScript, Hyperledger Fabric, and Corda
Shaker et al. Online rating system development using blockchain-based distributed ledger technology
CN113283957A (en) Block chain-based entity product transaction method
CN114529283A (en) Internet of things equipment transaction method based on block chain
CN113592478A (en) Digital commodity transaction method, computer device and storage medium
JP2023510320A (en) Systems and Methods for Secure Peer-to-Peer Transmission of Content in Distributed Ledger Networks
US20220414667A1 (en) Dynamically sharing an exchange item
CN114565384A (en) NFT privacy transaction method, computer device and storage medium
Anderson et al. Standards and verification for fair-exchange and atomicity in e-commerce transactions
US20200372496A1 (en) System and method for validation of business transactions
CN111709838B (en) Transaction method based on intellectual property standardized digital asset and related equipment
CN114615083B (en) NFT semi-private transaction method, computer equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination