[go: up one dir, main page]

CN113592469B - Red packet processing method based on zero knowledge proof, computer equipment and storage medium - Google Patents

Red packet processing method based on zero knowledge proof, computer equipment and storage medium Download PDF

Info

Publication number
CN113592469B
CN113592469B CN202110883014.2A CN202110883014A CN113592469B CN 113592469 B CN113592469 B CN 113592469B CN 202110883014 A CN202110883014 A CN 202110883014A CN 113592469 B CN113592469 B CN 113592469B
Authority
CN
China
Prior art keywords
red packet
address
red
contract
public key
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.)
Active
Application number
CN202110883014.2A
Other languages
Chinese (zh)
Other versions
CN113592469A (en
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.)
Nanjing Beiyinte Internet Technology Co ltd
Original Assignee
Nanjing Beiyinte Internet 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 Nanjing Beiyinte Internet Technology Co ltd filed Critical Nanjing Beiyinte Internet Technology Co ltd
Priority to CN202110883014.2A priority Critical patent/CN113592469B/en
Publication of CN113592469A publication Critical patent/CN113592469A/en
Application granted granted Critical
Publication of CN113592469B publication Critical patent/CN113592469B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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/387—Payment using discounts or coupons
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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/04—Payment circuits
    • G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
    • G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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/3825—Use of electronic signatures
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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/3827—Use of message hashing
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
    • G06Q30/0208—Trade or exchange of goods or services in exchange for incentives or rewards
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
    • G06Q30/0239—Online discounts or incentives

Landscapes

  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Engineering & Computer Science (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Development Economics (AREA)
  • Computer Security & Cryptography (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention provides a red packet processing method based on zero knowledge proof, a computer device and a storage medium, wherein the method comprises the following steps: receiving first data, a first public key, and first signature information in response to receiving the first red packet; the first signature information and the second private key corresponding to the second address are used as private inputs of the proving algorithm to generate first proving information; a first red packet pickup transaction including the first data, the first public key, the second address, and the first attestation information is generated and sent to the blockchain network for execution by the blockchain node through a red packet contract. The invention realizes that lawless persons cannot get the trade stolen collar red packet by analyzing the red packet.

Description

Red packet processing method based on zero knowledge proof, computer equipment and storage medium
Technical Field
The application relates to the technical field of Internet, in particular to a red packet processing method, computer equipment and storage medium based on zero knowledge proof.
Background
In the existing block chain red packet solution, one implementation mode is that verification information of a red packet acquisition certificate is recorded in a red packet contract on a block chain, when a user acquires the red packet, the user side generates a red packet acquisition transaction by packing according to the corresponding red packet acquisition certificate and sends the red packet acquisition transaction; and when the red packet acquisition transaction is executed, verifying the red packet acquisition certificate according to the verification information to judge whether the acquisition is successful.
For example, in the scheme disclosed in CN201910077876.9 application filed before the applicant, a random number is used as the verification information of the red packet reception certificate, and a hash value of the random number is used as the verification information of the red packet reception certificate.
The problem with the above solution is that when the packet retrieval transaction is intercepted by a malicious node at the beginning of the transmission, the packet retrieval certificate may be stolen, resulting in the theft of the packet.
For example, the user side of the user a obtains the random number r1 as the red packet pickup certificate, packages the random number r1 to generate the red packet pickup transaction tx1 including r1, and sends the red packet pickup transaction tx1 to the blockchain node a. Normally, node a will broadcast tx1 to other nodes in the blockchain network, eventually tx1 is packaged for execution. However, when the node a is a malicious node controlled by an lawbreaker, the node a may parse the random number r1 from tx1, discard tx1, and regenerate a red packet pickup transaction tx2 including r1 to steal the red packet. Even though the user side of user a is simultaneously sending tx1 to other blockchain nodes, there is still the possibility that tx2 is packaged for uplink execution prior to tx 1.
Disclosure of Invention
In view of the foregoing drawbacks or shortcomings in the prior art, it is desirable to provide a zero knowledge proof based red packet processing method, computer device and storage medium that prevent lawbreakers from picking up transaction theft-collar red packets by parsing the red packets.
In a first aspect, the present invention provides a method for processing a packet based on zero knowledge proof, applicable to a user terminal, wherein a packet contract is configured on a blockchain, and a zero knowledge proof circuit for verifying a packet pickup certificate and a packet collection address is configured in the packet contract, the method comprising:
receiving first data, a first public key, and first signature information in response to receiving the first red packet; wherein the first signature information is generated by the redpack user signing the first data with a first private key corresponding to the first public key, the redpack contract further configured to record the first data and the first public key into the redpack contract when performing the corresponding redpack transaction;
The first signature information and the second private key corresponding to the second address are used as private inputs of the proving algorithm to generate first proving information;
Generating a first red packet pickup transaction comprising the first data, the first public key, the second address, and the first attestation information and sending the first red packet pickup transaction to the blockchain network for execution by the blockchain node through a red packet contract, inputting the first data, the first public key, the second address, and the first attestation information into a verification algorithm of the zero knowledge attestation circuit to verify:
whether the redbag-leading user holds a redbag-leading voucher signed by a first private key held by the redbag-leading user;
whether the second address is the address corresponding to the second private key held by the packet-capturing user;
if any one of the above verification fails, the red packet is not picked up;
And if the two verification steps are successful, transferring the corresponding red packet money to a second address.
In a second aspect, the present invention provides a zero knowledge proof based red packet processing method for a blockchain node, the blockchain having red packet contracts configured thereon, the red packet contracts having zero knowledge proof circuitry configured therein for verifying red packet pick-up credentials and a red packet checkout address, the method comprising:
Executing a first package pickup transaction through a package contract, and inputting first data, a first public key, a second address and first proving information into a verification algorithm of a zero knowledge proving circuit to verify:
whether the redbag-leading user holds a redbag-leading voucher signed by a first private key held by the redbag-leading user;
whether the second address is the address corresponding to the second private key held by the packet-capturing user;
if any one of the above verification fails, the red packet is not picked up;
And if the two verification steps are successful, transferring the corresponding red packet money to a second address.
The first red package pickup transaction comprises first data, a first public key, a second address and first proving information, and is generated by packing a first user side;
The first certification information is generated by taking the first data, the first public key and the second address as public inputs of a certification algorithm of a zero knowledge certification circuit and taking the first signature information and a second private key corresponding to the second address as private inputs of the certification algorithm after the first user side receives the first red packet and receives the first data, the first public key and the first signature information;
The red pack contract is further configured to record the first data and the first public key into the red pack contract when performing the corresponding red pack transaction.
In a third aspect, the present invention also provides another method for processing a red packet based on zero knowledge proof, where a red packet contract is configured on a blockchain, and a zero knowledge proof circuit for verifying a red packet pickup certificate and a red packet collection address is configured in the red packet contract, and the method includes:
Receiving a third public key and a third private key in response to receiving the second red packet; wherein the package contract is further configured to record a third public key into the package contract when performing the corresponding package transaction;
The third public key and the fourth address of the current user are used as public inputs of a proving algorithm of the zero knowledge proving circuit, and the third private key and the fourth private key corresponding to the fourth address are used as private inputs of the proving algorithm, so that second proving information is generated;
generating a second red packet pickup transaction comprising a third public key, a fourth address and second attestation information and sending the second red packet pickup transaction to the blockchain network for execution by the blockchain node through a red packet contract, inputting the third public key, the fourth address and the second attestation information into a verification algorithm of a zero knowledge attestation circuit to verify:
Whether the user of the red-envelope holds a third private key corresponding to the third public key or not;
whether the fourth address is the address corresponding to the fourth private key held by the packet-capturing user;
if any one of the above verification fails, the red packet is not picked up;
and if the two verification steps are successful, transferring the corresponding red packet money to a fourth address.
In a fourth aspect, the present invention also provides another zero knowledge proof based red packet processing method suitable for a blockchain node, wherein a red packet contract is configured on the blockchain, and a zero knowledge proof circuit for verifying a red packet acquisition certificate and a red packet collection address is configured in the red packet contract, and the method comprises:
executing a second package pickup transaction through the package contract, and inputting the third public key, the fourth address and the second certification information into a verification algorithm of the zero knowledge proof circuit to verify:
Whether the user of the red-envelope holds a third private key corresponding to the third public key or not;
whether the fourth address is the address corresponding to the fourth private key held by the packet-capturing user;
if any one of the above verification fails, the red packet is not picked up;
and if the two verification steps are successful, transferring the corresponding red packet money to a fourth address.
The second red packet pickup transaction comprises a third public key, a fourth address and second certification information, and is generated by packing a second user side;
The second certification information is generated by taking the third public key and the fourth address as public input of a certification algorithm of the zero knowledge certification circuit and taking the third private key and the fourth private key corresponding to the fourth address as private input of the certification algorithm after the second user side receives the third public key and the third private key after receiving the second red packet;
the red package contract is further configured to record a third public key into the red package contract when performing the corresponding red package transaction.
In a fifth aspect, the present invention further provides a method for processing a red packet based on zero knowledge proof, where a red packet contract is configured on a blockchain, and a zero knowledge proof circuit for verifying a red packet acquisition certificate and a red packet collection address is configured in the red packet contract, where the method includes:
Receiving a first random number in response to receiving the third red packet; wherein the red pack contract is further configured to record a hash value of the first random number into the red pack contract when performing the corresponding red pack transaction;
The hash value of the first random number and the fifth address of the current user are used as public input of a proving algorithm of a zero knowledge proving circuit, and the first random number and a fifth private key corresponding to the fifth address are used as private input of the proving algorithm, so that third proving information is generated;
generating a third red packet comprising the hash value of the first random number, the fifth address and the third attestation information, and sending the third red packet to the blockchain network for execution by the blockchain node through the red packet contract, and inputting the hash value of the first random number, the fifth address and the third attestation information into a verification algorithm of the zero knowledge attestation circuit to verify:
Whether the user of the red-lead packet holds a first random number;
whether the fifth address is the address corresponding to the fifth private key held by the user for red envelope;
if any one of the above verification fails, the red packet is not picked up;
and if the two verification steps are successful, transferring the corresponding red packet money to a fifth address.
In a sixth aspect, the present invention also provides a zero knowledge proof-based red packet processing method applicable to a blockchain node, wherein a red packet contract is configured on the blockchain, and a zero knowledge proof circuit for verifying a red packet acquisition certificate and a red packet collection address is configured in the red packet contract, the method comprising:
Executing a third red package pickup transaction through the red package contract, and inputting the hash value of the first random number, the fifth address and the third proving information into a verification algorithm of the zero knowledge proving circuit to verify:
Whether the user of the red-lead packet holds a first random number;
whether the fifth address is the address corresponding to the fifth private key held by the user for red envelope;
if any one of the above verification fails, the red packet is not picked up;
and if the two verification steps are successful, transferring the corresponding red packet money to a fifth address.
The third red packet pickup transaction comprises a hash value of the first random number, a fifth address and third proving information, and is generated by packing a third user terminal;
The third proving information is generated by a third user side taking the hash value of the first random number and a fifth address as public input of a proving algorithm of a zero knowledge proving circuit and taking the first random number and a fifth private key corresponding to the fifth address as private input of the proving algorithm after receiving the first random number after receiving the third red packet;
the red pack contract is further configured to record a hash value of the first random number into the red pack contract when performing the corresponding red pack transaction.
In a seventh aspect, the present invention also provides a computer device comprising one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform the zero knowledge proof based red packet processing method provided in accordance with various embodiments of the invention.
In an eighth aspect, the present invention also provides a storage medium storing a computer program for causing a computer to execute the zero-knowledge-proof-based red packet processing method provided according to the embodiments of the present invention.
According to the zero-knowledge-evidence-based red packet processing method, the computer equipment and the storage medium provided by the embodiments of the invention, the zero-knowledge-evidence-based red packet processing circuit for verifying the red packet retrieval certificate and the red packet collection address is configured in the red packet contract, the user side which acquires the red packet retrieval certificate generates the evidence information according to the red packet retrieval certificate and the collection account private key, and then the red packet retrieval transaction is generated by packaging, so that an lawbreaker cannot steal the red packet even if the lawbreaker analyzes the evidence information from the red packet retrieval transaction, and the lawbreaker cannot parse the red packet to steal the red packet in the red packet retrieval transaction.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the detailed description of non-limiting embodiments, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of a method for processing a red packet based on zero knowledge proof, which is applicable to a user terminal according to an embodiment of the present invention.
Fig. 2 is a flowchart of a method for processing a red packet based on zero knowledge proof applicable to a blockchain node according to an embodiment of the present invention.
Fig. 3 is a flowchart of another method for processing a red packet based on zero knowledge proof, which is applicable to a client according to an embodiment of the present invention.
FIG. 4 is a flowchart of another method for processing red packets based on zero knowledge proof for blockchain nodes, in accordance with an embodiment of the invention.
Fig. 5 is a flowchart of another method for processing red packets based on zero knowledge proof applicable to a client according to an embodiment of the present invention.
FIG. 6 is a flowchart of yet another zero knowledge proof based red packet processing method for blockchain nodes in accordance with an embodiment of the invention.
Fig. 7 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The application is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the application and are not limiting of the application. It should be noted that, for convenience of description, only the portions related to the application are shown in the drawings.
It should be noted that, without conflict, the embodiments of the present application and features of the embodiments may be combined with each other. The application will be described in detail below with reference to the drawings in connection with embodiments.
Fig. 1 is a flowchart of a method for processing a red packet based on zero knowledge proof, which is applicable to a user terminal according to an embodiment of the present invention.
As shown in fig. 1, in this embodiment, the present invention provides a method for processing a red packet based on zero knowledge proof applicable to a user side, wherein a red packet contract is configured on a blockchain, and a zero knowledge proof circuit for verifying a red packet receipt and a red packet receipt is configured in the red packet contract, and the method includes:
s11: receiving first data, a first public key, and first signature information in response to receiving the first red packet; wherein the first signature information is generated by the redpack user signing the first data with a first private key corresponding to the first public key, the redpack contract further configured to record the first data and the first public key into the redpack contract when performing the corresponding redpack transaction;
S13: the first signature information and the second private key corresponding to the second address are used as private inputs of the proving algorithm to generate first proving information;
s15: generating a first red packet pickup transaction comprising the first data, the first public key, the second address, and the first attestation information and sending the first red packet pickup transaction to the blockchain network for execution by the blockchain node through a red packet contract, inputting the first data, the first public key, the second address, and the first attestation information into a verification algorithm of the zero knowledge attestation circuit to verify:
whether the redbag-leading user holds a redbag-leading voucher signed by a first private key held by the redbag-leading user;
whether the second address is the address corresponding to the second private key held by the packet-capturing user;
if any one of the above verification fails, the red packet is not picked up;
And if the two verification steps are successful, transferring the corresponding red packet money to a second address.
In this embodiment, the packet retrieval certificate is first signature information, and the verification algorithm of the packet retrieval certificate is a signature verification algorithm, that is, whether the first signature information is generated by signing the first data according to the first private key is verified according to the first public key; the verification algorithm of the red packet collection address is to generate an address according to the private key and verify whether the two addresses are identical, namely, verify whether the second address is generated according to the second private key. Those skilled in the art will understand the principles of signature verification algorithms in the art, as well as the principles of one-to-one correspondence of private keys, public keys, and addresses.
The zero knowledge proof circuit configured in the red package contract is generated according to the above algorithms. In particular, one skilled in the art will understand how to generate a zero-knowledge proof circuit according to an algorithm in a zero-knowledge proof system, where the zero-knowledge proof circuit includes at least a proof algorithm Prove () and a verification algorithm Verify (), and may further include a generation algorithm Setup (). The specific process is not described here in detail.
The method shown in fig. 1 will be exemplarily described below by taking an example that the user b sends a 3-person red packet and the user c robs to one of the red packets.
When the user side of the user B sends the 3-person red packet, 3 items of data1, data2 and data3 are randomly selected or generated, the data1, the data2 and the data3 are packed to generate a red packet transaction tx3 comprising the data1, the data2 and the data3 and the public key P 1 of the user B, and the red packet transaction tx3 is sent directly or packed with a red packet payment transaction to form a transaction group to be sent to the blockchain network in any mode.
When tx3 executes successfully, the block link records data1, data2, data3, and P 1 into the red packet contract.
When the user c robs one of the red packets, the user c performs step S11, and receives the data1 and signature information sign (data 1) corresponding to the red packet sent by the centralized red packet server, and the public key P 1.
In step S13, the user side of the user c uses the data1, the public key P 1, and the address addr 2 of the user c as the public input of the proof algorithm Prove () of the zero knowledge proof circuit, and uses the signature information sign (data 1) and the private key P 2 corresponding to the address addr 2 as the private input of the proof algorithm Prove () to generate the first proof information prove1:
Prove(data1、P1、addr2,sign(data1)、p2)→prove1。
In step S15, the client of the user c packages to generate a red packet pickup transaction tx4 including the data1, the public key P 1, the address addr 2 and the certification information prove1, and sends tx4 to the blockchain network.
The block link point receives, broadcasts, packages, and executes tx4 through the red packet contract, inputs data1, public key P 1, address addr 2, and certification information prove1 into the verification algorithm Verify () of the zero knowledge proof circuit to Verify:
Verify(data1，P1,addr2，prove1)→Yes/No。
Specifically, the verification algorithm Verify () guarantees that the zero knowledge proof circuit internally performs the following two verifications at the same time:
Verifying whether signature information sign (data 1) is generated by signing data1 by a private key P 1 held by a reddish pack user according to the public key P 1 and the data 1;
Verifying whether the address addr 2 corresponds to the address corresponding to the private key p 2;
When any one of the above verification fails, the output result of the verification algorithm Verify () is No, tx4 fails to execute, and red packet retrieval fails;
When the above verification is successful, the output result of the verification algorithm Verify () is Yes, tx4 is successfully executed, and the red packet corresponding to data1/sign (data 1) is transferred to address addr 2.
Specifically, in the above embodiment, if there is a malicious node that parses and discards tx4, the malicious node can only parse data1, public key P 1, address addr 2, and attestation information prove1 from tx4, but cannot parse sign (data 1):
If the malicious node repacks a red packet to get a transaction with the data1, the public key P 1, the address addr 2 and the proof information prove1, the execution result of the transaction is still that the red packet money is transferred to the address addr 2;
If a malicious node replaces addr 2 with an address addr x of an lawbreaker, repackages another red packet pickup transaction with data1, a public key P 1, an address addr x and proof information prove1, when executing the transaction, the red packet contract judges that the address addr x is not an address corresponding to the private key P 2 through a verification algorithm Verify (), and the transaction cannot pass verification, so that the lawbreaker cannot steal the red packet.
According to the embodiment, the zero knowledge proof circuit for verifying the red packet receiving evidence and the red packet collecting address is configured in the red packet contract, the user side obtaining the red packet receiving evidence generates the proof information according to the red packet receiving evidence and the collecting account private key, and then the proof information is packaged to generate the red packet receiving transaction, so that lawbreakers cannot steal the red packet even if the lawbreaker analyzes the proof information from the red packet receiving transaction, and therefore the lawbreaker cannot steal the red packet through analyzing the red packet receiving transaction.
Fig. 2 is a flowchart of a method for processing a red packet based on zero knowledge proof applicable to a blockchain node according to an embodiment of the present invention. The method shown in fig. 2 may be performed in conjunction with the method shown in fig. 1.
As shown in fig. 2, the present invention further provides a zero knowledge proof-based red packet processing method applicable to a blockchain node, wherein a red packet contract is configured on the blockchain, and a zero knowledge proof circuit for verifying a red packet acquisition certificate and a red packet collection address is configured in the red packet contract, and the method comprises:
S21: executing a first package pickup transaction through a package contract, and inputting first data, a first public key, a second address and first proving information into a verification algorithm of a zero knowledge proving circuit to verify:
whether the redbag-leading user holds a redbag-leading voucher signed by a first private key held by the redbag-leading user;
whether the second address is the address corresponding to the second private key held by the packet-capturing user;
if any one of the above verification fails, the red packet is not picked up;
And if the two verification steps are successful, transferring the corresponding red packet money to a second address.
The first red package pickup transaction comprises first data, a first public key, a second address and first proving information, and is generated by packing a first user side;
The first certification information is generated by taking the first data, the first public key and the second address as public inputs of a certification algorithm of a zero knowledge certification circuit and taking the first signature information and a second private key corresponding to the second address as private inputs of the certification algorithm after the first user side receives the first red packet and receives the first data, the first public key and the first signature information;
The red pack contract is further configured to record the first data and the first public key into the red pack contract when performing the corresponding red pack transaction.
The principle of red packet processing in the method shown in fig. 2 can refer to the method shown in fig. 1, and will not be described herein.
Fig. 3 is a flowchart of another method for processing a red packet based on zero knowledge proof, which is applicable to a client according to an embodiment of the present invention.
As shown in fig. 3, the present invention further provides another method for processing a red packet based on zero knowledge proof applicable to a user side, wherein a red packet contract is configured on a blockchain, and a zero knowledge proof circuit for verifying a red packet acquisition certificate and a red packet collection address is configured in the red packet contract, and the method comprises:
S31: receiving a third public key and a third private key in response to receiving the second red packet; wherein the package contract is further configured to record a third public key into the package contract when performing the corresponding package transaction;
S33: the third public key and the fourth address of the current user are used as public inputs of a proving algorithm of the zero knowledge proving circuit, and the third private key and the fourth private key corresponding to the fourth address are used as private inputs of the proving algorithm, so that second proving information is generated;
S35: generating a second red packet pickup transaction comprising a third public key, a fourth address and second attestation information and sending the second red packet pickup transaction to the blockchain network for execution by the blockchain node through a red packet contract, inputting the third public key, the fourth address and the second attestation information into a verification algorithm of a zero knowledge attestation circuit to verify:
Whether the user of the red-envelope holds a third private key corresponding to the third public key or not;
whether the fourth address is the address corresponding to the fourth private key held by the packet-capturing user;
if any one of the above verification fails, the red packet is not picked up;
and if the two verification steps are successful, transferring the corresponding red packet money to a fourth address.
Specifically, the method shown in fig. 3 differs from the method shown in fig. 1 in that:
In the method shown in fig. 3, the red-envelope-derived credential is a (disposable) third private key, and the verification algorithm of the red-envelope-derived credential is a public-private key verification algorithm, i.e., the third private key is verified from the third public key.
Taking the example that the user B sends a 3-person red packet as an example, in the method shown in fig. 3, the user side of the user B needs to randomly generate 3 pairs of disposable public and private key pairs, and records the 3 disposable public keys into a red packet contract through red packet transaction;
in step S31, the user side of the user c receives the disposable public key P 3 and the private key P 3 in the same manner;
in step S33, the user side of the user c generates the certification information prove2 in the same manner:
Prove(P3、addr4,p3、p4)→prove2。
In step S35, the client of the user c packages and generates a red packet pickup transaction tx5 including the public key P 3, the address addr 4, and the certification information prove2, and sends tx5 to the blockchain network.
The blockchain node performs tx5 through the red package contract, inputs the public key P 3, the address addr 4, and the certification information prove2 into the verification algorithm Verify () to Verify:
Verify(P3,addr4，prove2)→Yes/No。
Similarly, when a malicious node parses and discards tx5, only the public key P 3, the address addr 4, and the attestation information prove2 can be parsed from tx5, but the private key P 3 cannot be parsed;
Whether or not the malicious node replaces addr 4 with the address addr x of the lawless person cannot steal the red packet.
FIG. 4 is a flowchart of another method for processing red packets based on zero knowledge proof for blockchain nodes, in accordance with an embodiment of the invention. The method of fig. 4 may be performed in conjunction with the method of fig. 3.
As shown in fig. 4, the present invention further provides another zero knowledge proof-based red packet processing method applicable to a blockchain node, wherein a red packet contract is configured on the blockchain, and a zero knowledge proof circuit for verifying a red packet acquisition certificate and a red packet collection address is configured in the red packet contract, and the method comprises:
executing a second package pickup transaction through the package contract, and inputting the third public key, the fourth address and the second certification information into a verification algorithm of the zero knowledge proof circuit to verify:
Whether the user of the red-envelope holds a third private key corresponding to the third public key or not;
whether the fourth address is the address corresponding to the fourth private key held by the packet-capturing user;
if any one of the above verification fails, the red packet is not picked up;
and if the two verification steps are successful, transferring the corresponding red packet money to a fourth address.
The second red packet pickup transaction comprises a third public key, a fourth address and second certification information, and is generated by packing a second user side;
The second certification information is generated by taking the third public key and the fourth address as public input of a certification algorithm of the zero knowledge certification circuit and taking the third private key and the fourth private key corresponding to the fourth address as private input of the certification algorithm after the second user side receives the third public key and the third private key after receiving the second red packet;
the red package contract is further configured to record a third public key into the red package contract when performing the corresponding red package transaction.
The principle of red packet processing in the method shown in fig. 4 can refer to the method shown in fig. 3, and will not be described herein.
Fig. 5 is a flowchart of another method for processing red packets based on zero knowledge proof applicable to a client according to an embodiment of the present invention.
As shown in fig. 5, the present invention further provides a method for processing a red packet based on zero knowledge proof applicable to a user side, wherein a red packet contract is configured on a blockchain, and a zero knowledge proof circuit for verifying a red packet acquisition certificate and a red packet collection address is configured in the red packet contract, and the method comprises:
s51: receiving a first random number in response to receiving the third red packet; wherein the red pack contract is further configured to record a hash value of the first random number into the red pack contract when performing the corresponding red pack transaction;
S53: the hash value of the first random number and the fifth address of the current user are used as public input of a proving algorithm of a zero knowledge proving circuit, and the first random number and a fifth private key corresponding to the fifth address are used as private input of the proving algorithm, so that third proving information is generated;
s55: generating a third red packet comprising the hash value of the first random number, the fifth address and the third attestation information, and sending the third red packet to the blockchain network for execution by the blockchain node through the red packet contract, and inputting the hash value of the first random number, the fifth address and the third attestation information into a verification algorithm of the zero knowledge attestation circuit to verify:
Whether the user of the red-lead packet holds a first random number;
whether the fifth address is the address corresponding to the fifth private key held by the user for red envelope;
if any one of the above verification fails, the red packet is not picked up;
and if the two verification steps are successful, transferring the corresponding red packet money to a fifth address.
Specifically, the method shown in FIG. 5 differs from the method shown in FIG. 1/3 in that:
In the method shown in fig. 5, the red packet pickup certificate is a first random number, and the verification algorithm of the red packet pickup certificate is a hash algorithm, that is, it is verified whether the hash value of the first random number is the same as the hash value recorded in the contract.
Taking the example that the user B sends a 3-person red packet as an example, in the method shown in fig. 5, the user side of the user B needs to randomly generate 3 random numbers r1, r2 and r3, and records hash values hash (r 1), hash (r 2) and hash (r 3) of the 3 random numbers into a red packet contract through red packet sending transaction;
In step S51, the user side of the user c receives the random number r1 in the same manner;
In step S53, the user side of the user c generates the certification information prove in the same manner:
Prove(hash(r1)、addr5,r1、p5)→prove3。
In step S55, the client of the user c packages to generate a red packet pickup transaction tx6 including hash (r 1), addr 5, prove3, and sends tx6 to the blockchain network.
The blockchain node performs tx6 through the red packet contract, inputs hash (r 1), addr 5, prove3 into verification algorithm Verify () to Verify:
Verify(hash(r1)，addr5，prove3)→Yes/No。
Similarly, when a malicious node parses and discards tx6, it can only parse hash (r 1), addr 5, prove3 from tx6, but cannot parse r1;
Whether or not the malicious node replaces addr 5 with the address addr x of the lawless person cannot steal the red packet.
FIG. 6 is a flowchart of yet another zero knowledge proof based red packet processing method for blockchain nodes in accordance with an embodiment of the invention. The method of fig. 6 may be performed in conjunction with the method of fig. 5.
As shown in fig. 6, the present invention further provides a zero knowledge proof red packet processing method applicable to a blockchain node, wherein a red packet contract is configured on the blockchain, and a zero knowledge proof circuit for verifying a red packet receipt and a red packet receipt is configured in the red packet contract, and the method comprises:
S61: executing a third red package pickup transaction through the red package contract, and inputting the hash value of the first random number, the fifth address and the third proving information into a verification algorithm of the zero knowledge proving circuit to verify:
Whether the user of the red-lead packet holds a first random number;
whether the fifth address is the address corresponding to the fifth private key held by the user for red envelope;
if any one of the above verification fails, the red packet is not picked up;
and if the two verification steps are successful, transferring the corresponding red packet money to a fifth address.
The third red packet pickup transaction comprises a hash value of the first random number, a fifth address and third proving information, and is generated by packing a third user terminal;
The third proving information is generated by a third user side taking the hash value of the first random number and a fifth address as public input of a proving algorithm of a zero knowledge proving circuit and taking the first random number and a fifth private key corresponding to the fifth address as private input of the proving algorithm after receiving the first random number after receiving the third red packet;
the red pack contract is further configured to record a hash value of the first random number into the red pack contract when performing the corresponding red pack transaction.
The principle of red packet processing in the method shown in fig. 6 can refer to the method shown in fig. 5, and will not be described herein.
Fig. 7 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
As shown in fig. 7, as another aspect, the present application also provides a computer apparatus 700 including one or more Central Processing Units (CPUs) 701, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 702 or a program loaded from a storage section 708 into a Random Access Memory (RAM) 703. In the RAM703, various programs and data required for the operation of the device 700 are also stored. The CPU701, ROM702, and RAM703 are connected to each other through a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.
The following components are connected to the I/O interface 705: an input section 706 including a keyboard, a mouse, and the like; an output portion 707 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, a speaker, and the like; a storage section 708 including a hard disk or the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs communication processing via a network such as the internet. The drive 710 is also connected to the I/O interface 705 as needed. A removable medium 711 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read therefrom is mounted into the storage section 708 as necessary.
In particular, according to embodiments 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 present 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 via the communication portion 709, and/or installed from the removable medium 711.
As still another aspect, the present application also provides a computer-readable storage medium, which may be a computer-readable storage medium contained in the apparatus of the above-described embodiment; or may be a computer-readable storage medium, alone, that is not assembled into a device. The computer-readable storage medium stores one or more programs for use by one or more processors to perform the methods described herein.
The flowcharts 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 involved in the embodiments of the present application may be implemented in software or in hardware. The described units or modules may also be provided in a processor, for example, the units may be software programs provided in a computer or a mobile smart device, or may be separately configured hardware devices. Wherein the names of the units or modules do not in some cases constitute a limitation of the units or modules themselves.
The above description is only illustrative of the preferred embodiments of the present application and of the principles of the technology employed. It will be appreciated by persons skilled in the art that the scope of the application referred to in the present application is not limited to the specific combinations of the technical features described above, but also covers other technical features formed by any combination of the technical features described above or their equivalents without departing from the spirit of the application. Such as the above-mentioned features and the technical features disclosed in the present application (but not limited to) having similar functions are replaced with each other.

Claims (6)

1. A method for processing a red packet based on zero knowledge proof, wherein a red packet contract is configured on a blockchain, and a zero knowledge proof circuit for verifying a red packet pickup certificate and a red packet collection address is configured in the red packet contract, the method is applicable to a user side, and the method comprises: receiving first data, a first public key, and first signature information in response to receiving the first red packet; wherein the first signature information is generated by a redpack user signing the first data with a first private key corresponding to the first public key, the redpack contract further configured to record the first data and the first public key into a redpack contract when performing a respective redpack transaction;
Taking the first data, the first public key and a second address of a current user as public inputs of a proving algorithm of the zero knowledge proving circuit, and taking the first signature information and a second private key corresponding to the second address as private inputs of the proving algorithm to generate first proving information;
Generating a first red packet pickup transaction comprising the first data, the first public key, the second address, and the first attestation information and sending to a blockchain network for blockchain nodes to execute through the red packet contract, inputting the first data, the first public key, the second address, and the first attestation information into a verification algorithm of the zero knowledge attestation circuit to verify: whether the redbag-leading user holds a redbag-leading voucher signed by a first private key held by the redbag-leading user;
whether the second address is the address corresponding to the second private key held by the user for red envelope or not;
if any one of the above verification fails, the red packet is not picked up;
and if the two verification steps are successful, transferring the corresponding red packet money to the second address.
2. A method of processing a red packet based on zero knowledge proof, wherein a red packet contract is configured on a blockchain, wherein a zero knowledge proof circuit for verifying a red packet pickup voucher and a red packet collection address is configured in the red packet contract, the method being applicable to a blockchain node, the method comprising: executing a first red package pickup transaction through the red package contract, and inputting first data, a first public key, a second address and first proving information into a verification algorithm of the zero knowledge proving circuit to verify: whether the redbag-leading user holds a redbag-leading voucher signed by a first private key held by the redbag-leading user;
whether the second address is the address corresponding to the second private key held by the user for red envelope or not;
if any one of the above verification fails, the red packet is not picked up;
if the two verification steps are successful, transferring the corresponding red packet money to the second address;
the first red package pickup transaction comprises the first data, the first public key, the second address and the first proving information, and is generated by packing a first user side;
The first proving information is generated by taking the first data, the first public key and the second address as public inputs of a proving algorithm of the zero knowledge proving circuit and taking the first signature information and a second private key corresponding to the second address as private inputs of the proving algorithm after the first user side receives a first red packet and receives the first data, the first public key and the first signature information;
the package contract is further configured to record the first data and the first public key into the package contract when performing a corresponding package transaction.
3. A method for processing a red packet based on zero knowledge proof, wherein a red packet contract is configured on a blockchain, and a zero knowledge proof circuit for verifying a red packet pickup certificate and a red packet collection address is configured in the red packet contract, the method is applicable to a user side, and the method comprises: receiving a third public key and a third private key in response to receiving the second red packet; wherein the subcontracting contract is further configured to record the third public key into the subcontracting contract when performing a corresponding subcontracting transaction;
Taking the third public key and a fourth address of a current user as public inputs of a proving algorithm of the zero knowledge proving circuit, and taking the third private key and a fourth private key corresponding to the fourth address as private inputs of the proving algorithm to generate second proving information;
Generating a second red packet pickup transaction comprising the third public key, the fourth address and the second attestation information and sending the second red packet pickup transaction to a blockchain network for execution by a blockchain node through the red packet contract, and inputting the third public key, the fourth address and the second attestation information into a verification algorithm of the zero knowledge attestation circuit to verify: whether the user of the red-packet is in possession of a third private key corresponding to the third public key;
whether the fourth address is the address corresponding to the fourth private key held by the user for red envelope or not;
if any one of the above verification fails, the red packet is not picked up;
and if the two verification steps are successful, transferring the corresponding red packet money to the fourth address.
4. A method of processing a red packet based on zero knowledge proof, wherein a red packet contract is configured on a blockchain, wherein a zero knowledge proof circuit for verifying a red packet pickup voucher and a red packet collection address is configured in the red packet contract, the method being applicable to a blockchain node, the method comprising: executing a second red envelope pickup transaction through the red envelope contract, and inputting a third public key, a fourth address and second proof information into a verification algorithm of the zero knowledge proof circuit to verify: whether the user of the red-packet is in possession of a third private key corresponding to the third public key;
whether the fourth address is the address corresponding to the fourth private key held by the user for red envelope or not;
if any one of the above verification fails, the red packet is not picked up;
If the two verification steps are successful, transferring the corresponding red packet money to the fourth address;
the second red packet pickup transaction comprises the third public key, the fourth address and the second proving information, and is generated by packing a second user side;
The second proving information is generated by the second user side taking the third public key and the fourth address as public inputs of a proving algorithm of the zero knowledge proving circuit and taking the third private key and a fourth private key corresponding to the fourth address as private inputs of the proving algorithm after receiving a second red packet and receiving the third public key and the third private key;
the subcontracting contract is further configured to record the third public key into the subcontracting contract when performing a corresponding subcontracting transaction.
5. A computer device, the device comprising:
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 of any of claims 1-4.
6. 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-4.
CN202110883014.2A 2021-08-02 2021-08-02 Red packet processing method based on zero knowledge proof, computer equipment and storage medium Active CN113592469B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110883014.2A CN113592469B (en) 2021-08-02 2021-08-02 Red packet processing method based on zero knowledge proof, computer equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110883014.2A CN113592469B (en) 2021-08-02 2021-08-02 Red packet processing method based on zero knowledge proof, computer equipment and storage medium

Publications (2)

Publication Number Publication Date
CN113592469A CN113592469A (en) 2021-11-02
CN113592469B true CN113592469B (en) 2024-09-24

Family

ID=78254009

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110883014.2A Active CN113592469B (en) 2021-08-02 2021-08-02 Red packet processing method based on zero knowledge proof, computer equipment and storage medium

Country Status (1)

Country Link
CN (1) CN113592469B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115694840B (en) * 2022-11-07 2025-09-26 上海加密原生科技有限公司 Proof method and device for blockchain, electronic device, and storage medium

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109727009A (en) * 2019-01-28 2019-05-07 杭州复杂美科技有限公司 Red envelope processing method, equipment and storage medium

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB201806112D0 (en) * 2018-04-13 2018-05-30 Nchain Holdings Ltd Computer-implemented system and method
CN108764874B (en) * 2018-05-17 2021-09-07 深圳前海微众银行股份有限公司 Blockchain-based anonymous transfer method, system and storage medium
CN110535648B (en) * 2018-05-24 2022-05-06 腾讯科技（深圳）有限公司 Electronic certificate generation and verification and key control method, device, system and medium
CN108985760B (en) * 2018-06-15 2021-07-06 杭州复杂美科技有限公司 Payment method and system, device and storage medium
CN111833057B (en) * 2018-09-30 2024-10-29 蚂蚁链技术有限公司 Transaction method, device and node equipment based on blockchain
US11151558B2 (en) * 2018-12-12 2021-10-19 American Express Travel Related Services Company, Inc Zero-knowledge proof payments using blockchain
US10535062B1 (en) * 2019-03-20 2020-01-14 Capital One Services, Llc Using a contactless card to securely share personal data stored in a blockchain
CN110363512B (en) * 2019-07-12 2022-12-20 上海唯链信息科技有限公司 Processing, creating and getting method and device for block chain red packet, medium and computer program
CN110827006A (en) * 2019-11-06 2020-02-21 杭州复杂美科技有限公司 Code scanning red packet generating method, equipment and storage medium
CN111159694A (en) * 2019-12-17 2020-05-15 上海七印信息科技有限公司 Private use authorization method of block chain digital assets based on zero knowledge proof

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109727009A (en) * 2019-01-28 2019-05-07 杭州复杂美科技有限公司 Red envelope processing method, equipment and storage medium

Also Published As

Publication number Publication date
CN113592469A (en) 2021-11-02

Similar Documents

Publication Publication Date Title
CN110992027B (en) Efficient transaction method and device for realizing privacy protection in block chain
US8842833B2 (en) System and method for secure transaction of data between wireless communication device and server
US20200259650A1 (en) Secure communication with an authentication process
CN101447867B (en) Method for managing digital certificate and system
CN102239714B (en) The safety communicating method of mobile financial business and device thereof based on application layer
CN114358782A (en) Block chain transaction auditing method, device, equipment and storage medium
CN102970676B (en) A kind of method handled initial data, Internet of things system and terminal
CN110933671B (en) Data transmission method and system
CN112216038A (en) Smart cabinet opening method, data processing method and device, and smart cabinet application system
CN113592476A (en) Cross-chain asset transfer method, computer device, and storage medium
CN113592477B (en) Cross-chain asset transfer method, computer device, and storage medium
CN113098935B (en) Session keeping method, device and storage medium
CN113592469B (en) Red packet processing method based on zero knowledge proof, computer equipment and storage medium
CN111400756A (en) Private data uplink method, device and storage medium
CN114598531B (en) Identity authentication method and equipment
CN115883078A (en) File encryption method, file decryption method, file encryption device, file decryption equipment and storage medium
CN115409511A (en) Personal information protection system based on block chain
CN107248910A (en) Method for security protection and equipment
CN110266478B (en) Information processing method and electronic equipment
EP3776318B1 (en) Tamper-resistant data encoding for mobile devices
CN117370463A (en) Block chain-based data storage method, device and storage medium
CN111524010B (en) Parallel chain consensus method, apparatus and storage medium
CN116094698A (en) A quantum security identity authentication device, method, equipment and storage medium
CN111524011B (en) Parallel link consensus validation method, apparatus, and storage medium
CN115567297A (en) Cross-site request data processing method and device

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
TA01 Transfer of patent application right

Effective date of registration: 20240826

Address after: 210000 Building 1, Juhui garden, 108 Xuanwu Avenue, Xuanwu District, Nanjing, Jiangsu Province

Applicant after: Nanjing Beiyinte Internet Technology Co.,Ltd.

Country or region after: China

Address before: 310000 Room 702, 7th Floor, Building 6, East Software Park, No. 90 Wensan Road, Xihu District, Hangzhou City, Zhejiang Province

Applicant before: HANGZHOU FUZAMEI TECHNOLOGY Co.,Ltd.

Country or region before: China

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant