CN110278266B - Resource processing method and device based on block chain - Google Patents
Resource processing method and device based on block chain Download PDFInfo
- Publication number
- CN110278266B CN110278266B CN201910539315.6A CN201910539315A CN110278266B CN 110278266 B CN110278266 B CN 110278266B CN 201910539315 A CN201910539315 A CN 201910539315A CN 110278266 B CN110278266 B CN 110278266B
- Authority
- CN
- China
- Prior art keywords
- resource
- transfer
- node
- resources
- distributed
- 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
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
Abstract
The invention relates to the field of financial science and technology, and discloses a resource processing method and a device based on a block chain, wherein the method comprises the following steps: receiving the number of distributed resources sent by other N-1 resource transfer-out nodes aiming at each resource transfer-out node with an anonymous account; each resource transfer-out node determines the distributed resource quantity part sum of each resource transfer-out node according to the received distributed resource quantity and the undistributed resource quantity determined by each resource transfer-out node; and if the verification of the resource processing request sent by the third-party node is passed, the resource transfer-out nodes determine the quantity of the transfer resources according to the quantity of the processable resources of the resource transfer-out nodes, the distribution resource quantity part of the resource transfer-out nodes and the quantity of the resources requested by the resource request node, and transfer the quantity of the transfer resources to the third-party node. Each resource transfer-out node and the third-party node do not know the resource transfer-out quantity planned to be transferred out by other resource transfer-out nodes, and the safety is improved.
Description
Technical Field
The invention relates to the technical field of financial technology (Fintech), in particular to a resource processing method and device based on a block chain.
Background
With the development of computer technology, more and more technologies are applied in the financial field, the traditional financial industry is gradually changing to financial technology (Finteh), and a Block chain (Block chain) technology is not an exception, but higher requirements are also put forward on the technologies due to the requirements of the financial industry on safety and real-time performance.
In the existing society, resource processing is often required, that is, one party needs to request resource transfer, and the other party transfers the resource according to the request. When resource transfer is carried out, the number of resource transfer is generally protected in an encryption mode through a traditional encryption technology or by introducing a trusted third party, and the third party has a secret key and can unlock ciphertext data of the number of resource transfer.
However, in the prior art, a trusted third party is a very strong security assumption, so that in the prior art, the resource transfer party and the number of resource transfer parties cannot be completely hidden, and a large risk of disclosure is brought in the resource transfer process.
Disclosure of Invention
In view of this, embodiments of the present invention provide a resource processing method and apparatus based on a block chain, which at least solve the problems in the prior art.
In one aspect, an embodiment of the present invention provides a resource processing method based on a block chain, where the method is applied to a resource processing system including at least N resource roll-out nodes, a resource request node, and a third-party node, where N is greater than or equal to 2, and the method includes:
for each resource transfer-out node with an anonymous account, receiving the distribution resource quantity sent by each of the other N-1 resource transfer-out nodes, wherein the distribution resource quantity is determined by each resource transfer-out node according to the respectively determined processable resource quantity and the total quantity N of the resource transfer-out nodes after the resource transfer-out node obtains a resource processing request of a resource request node, the resource processing request comprises the resource quantity requested by the resource request node, and the distribution resource quantity is a part of the processable resource quantity of each resource transfer-out node;
each resource roll-out node determines the distributed resource quantity part sum of each resource roll-out node according to the received distributed resource quantity and the undistributed resource quantity determined by each resource roll-out node, and publishes the distributed resource quantity part sum and the zero knowledge proof of the distributed resource quantity part sum in a public information list of the resource processing system, wherein the distributed resource quantity part sum is used for verifying whether to execute the resource processing request of the resource request node, and the zero knowledge proof of the distributed resource quantity part sum is used for determining that each resource roll-out node calculates the distributed resource quantity part sum;
and if the verification of the resource processing request aiming at the resource request node sent by the third-party node is passed, determining the quantity of the transfer resources according to the quantity of the processable resources of the resource transfer-out nodes, the distribution resource quantity part of the resource transfer-out nodes and the quantity of the resources requested by the resource request node, and transferring the quantity of the transfer resources to the third-party node.
In the embodiment of the invention, for each resource transfer-out node with an anonymous account in a block chain, the resource transfer-out nodes are anonymous in a system, and the resource transfer-out nodes determine distribution resources sent to other resource transfer-out nodes after acquiring resource processing requests of resource request nodes, determine the quantity sum of the distribution resources of the resource transfer-out nodes by receiving the quantity of each distribution resource sent by N-1 resource transfer-out nodes, prove the authenticity of the quantity sum of the distribution resources by zero knowledge proof, and respectively send the quantity sum of the distribution resources to a third-party node by each resource transfer-out node so as to enable the third-party node to determine whether to execute the resource processing requests of the resource request nodes according to the quantity sum of each distribution resource; and after determining the resource processing request of the executable resource request node, each resource roll-out node transfers the resource to the third-party node. In the embodiment of the invention, each resource transfer-out node does not know the resource transfer-out quantity planned to be transferred out by other resource transfer-out nodes, and the third-party node does not know the resource transfer-out quantity planned to be transferred out by each resource transfer-out node, so that the resource transfer-out can be carried out without depending on other intermediate mechanisms, and the safety of the resource processing process is improved.
Optionally, the distributing resource quantity is determined by each resource roll-out node according to the respectively determined processable resource quantity and the total quantity N of the resource roll-out nodes after acquiring the resource processing request of the resource request node, and includes:
after each resource roll-out node acquires a resource processing request of a second node, determining the quantity of transferred resources and determining the quantity of processable resources according to the quantity of resources requested by the resource request node;
each resource roll-out node divides the processable resource quantity into N parts, wherein N-1 parts are used as distributed resource quantity, and the other part is used as undistributed resource quantity.
In the embodiment of the invention, in order to prevent other resource transfer-out nodes from knowing the amount of the transferred-out resource, the amount of the resource which can be transferred out is split by a safe multi-party calculation method, and part of the resource is transferred out, so that the safety and the concealment are improved.
Optionally, after each resource roll-out node determines the number of transferred resources and determines the number of processable resources, the method further includes:
each resource transfer-out node publishes commitments corresponding to the number of processable resources in a public information list of the resource processing system, wherein the commitments corresponding to the number of the processable resources are used for hiding the number of the processable resources from other N-1 resource transfer-out nodes;
after the resource roll-out nodes split the number of the processable resources into N parts, the method further includes:
each resource transfer-out node determines the commitment corresponding to each part for the N parts;
and each resource roll-out node sends the quantity of the distributed resources and the commitment corresponding to the quantity of the distributed resources to other N-1 nodes through a safety channel.
In the embodiment of the present invention, it is ensured that each resource transfer-out node indeed determines the number of processable resources by determining that the commitment can facilitate the verification later, and similarly, for facilitating the verification, after determining the number of distributed resources, the commitment corresponding to the number of distributed resources needs to be determined and sent to other resource transfer-out nodes through a secure channel.
Optionally, the determining, by the resource transfer-out node, the number of transferred resources according to the number of processable resources of each resource transfer-out node, the part of the number of distributed resources of each resource transfer-out node, and the number of resources requested by the resource request node, includes:
each resource transfer-out node determines the proportion of the quantity of the transferred resources according to the quantity of the processable resources of each resource transfer-out node and the quantity of the distributed resources of each resource transfer-out node;
and each resource roll-out node determines the quantity of the transfer resources according to the quantity proportion of the transfer resources and the quantity of the resources requested by the resource request node.
In the embodiment of the invention, after determining that the resource transfer is required, each resource transfer-out node determines the proportion of the quantity of the transfer resources according to the prior commitment, the distribution resource quantity part of each resource transfer-out node and the proportion of the quantity of the transfer resources, and performs actual resource output according to the proportion.
Optionally, the resource processing system further includes a miner node, and the transferring the resource amount from each resource transferring node to the third-party node includes:
each resource roll-out node acquires public key information of the third-party node;
each resource transfer-out node determines transfer resource information according to the transfer resource quantity and the public key information of the third-party node, and sends the transfer resource information to the third-party node; the transfer resource information at least comprises transfer resource encryption information generated based on public key information of the third-party node, transfer-in commitments corresponding to the transfer resource quantity and zero knowledge proofs corresponding to the transfer resource quantity, and the transfer-in commitments are used for representing that the third-party node can obtain the transfer resource quantity;
and if the resource transfer-out nodes determine that the third-party node combines the transferred resource information of all the resource transfer-out nodes and passes the verification of the miner node, determining that the transferred resource quantity is transferred to the third-party node.
In the embodiment of the invention, each resource transfer-out node carries out resource transfer to a third-party node anonymously, the third-party nodes combine the transferred resource information to obtain total transferred resource information, in the process, the third-party nodes can not obtain specific transferred resource quantity, only spacious workers can determine the quantity of committed transfer of each resource transfer-out node, and the third-party nodes can determine that the resource transfer of each resource transfer-out node is received through the committed transfer, thereby ensuring the concealment of the transferred-out resource of each resource transfer-out node and improving the safety of the whole resource processing process.
In one aspect, an embodiment of the present invention provides a resource processing apparatus based on a block chain, including:
a receiving unit, configured to receive the number of distributed resources sent by each of N-1 resource transfer-out nodes, where the number of distributed resources is determined by each resource transfer-out node according to a respective determined number of processable resources and a total number N of the resource transfer-out nodes after the resource transfer-out node obtains a resource processing request of a resource request node, the resource processing request includes the number of resources requested by the resource request node, and the number of distributed resources is a part of the number of processable resources of each resource transfer-out node;
a distributed resource quantity part and determination unit, configured to determine, according to the received distributed resource quantity and the number of undistributed resources determined by each resource roll-out node, a distributed resource quantity part and a zero knowledge certificate of the distributed resource quantity part and the zero knowledge certificate of the distributed resource quantity part are published in a common information list of the resource processing system, where the distributed resource quantity part and the zero knowledge certificate of the distributed resource quantity part are used to verify whether to execute the resource processing request of the resource request node, and the distributed resource quantity part and the zero knowledge certificate of the distributed resource quantity part are used to determine that each resource roll-out node performs calculation of the distributed resource quantity part and the zero knowledge certificate of the distributed resource quantity part;
and the resource transfer unit is used for determining the quantity of the transferred resources according to the quantity of the processable resources of each resource roll-out node, the distributed resource quantity part of each resource roll-out node and the quantity of the resources requested by the resource request node and transferring the quantity of the transferred resources to the third party node after receiving the verification passing message of the resource processing request aiming at the resource request node sent by the third party node.
Optionally, the apparatus further comprises:
the distributed resource determining unit is used for determining the quantity of transferred resources and determining the quantity of processable resources according to the quantity of resources requested by the resource request node after the resource processing request of the second node is obtained; and splitting the processable resource quantity into N parts, wherein N-1 parts serve as distributed resource quantity, and the other part serves as undistributed resource quantity.
Optionally, the distribution resource determining unit is further configured to:
publishing commitments corresponding to the number of the processable resources in a public information list of the resource processing system, wherein the commitments corresponding to the number of the processable resources are used for hiding the number of the processable resources from other N-1 resource transfer-out nodes;
splitting the number of the processable resources into N parts, and determining commitments corresponding to each part for the N parts;
and sending the distribution resource quantity and the commitment corresponding to the distribution resource quantity to other N-1 resource transfer-out nodes through a security channel.
Optionally, the resource transfer unit is specifically configured to:
determining the proportion of the quantity of the transferred resources according to the quantity of the processable resources of each resource transfer-out node and the quantity of the distributed resources of each resource transfer-out node;
and determining the quantity of the transfer resources according to the quantity proportion of the transfer resources and the quantity of the resources requested by the resource request node.
Optionally, the resource transfer unit is specifically configured to:
acquiring public key information of the third-party node;
determining transfer resource information according to the number of the transfer resources and the public key information of the third-party node, and sending the transfer resource information to the third-party node; the transfer resource information at least comprises transfer resource encryption information generated based on public key information of the third-party node, transfer-in commitments corresponding to the transfer resource quantity and zero knowledge proofs corresponding to the transfer resource quantity, and the transfer-in commitments are used for representing that the third-party node can obtain the transfer resource quantity;
and if the third-party node is determined to combine the transferred resource information of all the resource transfer-out nodes and pass the verification of the miner node, determining that the transferred resource quantity is transferred to the third-party node.
In one aspect, an embodiment of the present invention provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor executes the steps of the resource processing method based on the block chain implemented by the computer program.
In one aspect, an embodiment of the present invention provides a computer-readable storage medium storing a computer program executable by a computer device, where the program is executed by the computer device, and when the program is executed by the computer device, the computer device is caused to execute the steps of a resource processing method based on a block chain.
Drawings
Fig. 1 is a schematic structural diagram of a resource processing system based on a block chain according to an embodiment of the present invention;
fig. 2 is a schematic flowchart of a resource processing method based on a block chain according to an embodiment of the present invention;
fig. 3 is a schematic flowchart of a resource processing method based on a block chain according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a resource processing apparatus based on a block chain according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
In order to make the purpose, technical solution and beneficial effects of the present application more clear and more obvious, the present application is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
To facilitate understanding of the method and apparatus provided by the embodiments of the present invention, the noun explanation is first made herein for facilitating the subsequent understanding.
And the block chain is a chain consisting of a series of blocks, and each block can record the Hash value of the previous block besides the data of the current block, so that the chain is formed. The block chain has two core ideas, one is a cryptography technology, the other is a decentralization idea, and based on the two ideas, historical information on the block chain cannot be tampered. A block consists of a block header and a block, where the block header definition includes the block height h, and the block primarily stores transaction data.
Miners, nodes responsible for checking, executing and consensus accounting for transactions sent to the blockchain.
The safe multi-party calculation mainly aims at the problem of how to safely calculate an appointed function under the condition of no trusted third party, and is applicable to a distributed network, wherein a plurality of users respectively hold some data input; they wish to jointly complete the calculations on these data; meanwhile, each user is required to be incapable of knowing any input information of other users except the calculation result.
Zero Knowledge Proof (Zero-Knowledge Proof) was proposed by s.goldwasser, s.micali and c.rackoff in the beginning of the 80 th 20 th century. It means that the prover can convince the verifier that some assertion is correct without providing the verifier with any useful information. Zero knowledge proof is essentially an agreement involving two or more parties, i.e., a series of steps that are required by two or more parties to complete a task. The prover proves to the verifier and convinces him that he knows or owns a certain message, but the proving process cannot reveal any information about the proven message to the verifier.
The commitment protocol is a two-stage interaction protocol in which two parties participate. Firstly, in a commitment stage, a commitment person commits a character string v and sends the commitment person to a receiver, and the receiver is ensured not to obtain any information about v; subsequently, in the opening phase, the consistency with the commitment phase is proved. Two basic properties of the commitment protocol are referred to as concealment and binding, respectively. The concealment is that any malicious receiver cannot acquire the information of the commitment character string in the commitment stage; binding means that any malicious commitment cannot open the commitment to another value and is verified in the opening phase. In the design of cryptographic protocols, commitment protocols are often used as sub-protocols to construct more complex secure computing protocols whose main role is to fix the input of participants while ensuring their privacy. It is often used in conjunction with zero-knowledge proof systems to implement secure multi-party computing protocols that are resistant to malicious adversaries.
The safety channel, the communication transmission channel protected by encryption, for example, the communication channel adopting the SSL transmission protocol, all the transmitted data are encrypted, and a third party cannot decrypt the data on the channel.
Based on the problems in the prior art, an embodiment of the present invention provides a resource processing system based on a block chain, specifically as shown in fig. 1, including N resource roll-out nodes, a resource request node, and a third party node, in the resource processing system based on the block chain, a resource request node firstly initiates a resource processing request to each resource roll-out node through a third-party node, and after each resource roll-out node acquires the resource processing request, determining the quantity of resources that can be transferred by each resource transfer-out node, transferring the resources after determining that the resource processing request needs to be executed, in the embodiments of the present invention, a resource refers to a tangible resource or an intangible resource that can be transferred, for example, the resource may be an actual material resource, cement, goods, coal mine, or the like, or may be an intangible resource, such as electronic goods, electronic money, or the like.
In the embodiment of the present invention, the process of resource processing can be divided into two processes before resource transfer and in resource transfer.
In the pre-resource transfer stage, the resource requesting node first needs to initiate a resource processing request, where the resource processing request includes the number of resources requested by the resource requesting node, and V is used to replace the number of resources requested by the resource requesting node.
In a resource processing system, each resource is transferred out of a node Pi(i-1, 2,3, …, N) are registered anonymously, and after anonymous registration, the processable resource number X is determined based on the resource number V of the received requesti(i＝1,2,3，…,N)。
After determining the amount X of the processable resourceiThen, the number of distributed resources also needs to be determined, and optionally, in the embodiment of the present invention, according to the number X of processable resourcesiAnd the number N of each resource roll-out node determines the number X of distributed resourcesin. In the embodiment of the invention, each resource roll-out node converts XiThe resource distribution method comprises the steps of splitting the resource distribution system into N parts, wherein N-1 part is a distributed resource, the other part is an undistributed resource, and the number of the N-1 parts of the distributed resource can be the same or different.
Illustratively, a resource roll-out node is taken as an example, the number of processable resources determined by the resource roll-out node is 100, in the resource processing system, there are 5 resource roll-out nodes, the resource roll-out node divides the number of processable resources 100 into 5 equally, the number of resources in each share is 20, 4 of the available resources need to be distributed to other resource roll-out nodes, the 4 are distributed resources, and the number of distributed resources in each share is 20; the other is undistributed resources, and the number of undistributed resources is 20.
In the above embodiment, 100 is divided into 5 parts, optionally, in the embodiment of the present invention, 100 may also be divided into 5 parts at random, and 4 parts of the 5 parts are sent to other 4 resource transfer-out nodes as distribution resources.
The number X of the processable resources is determined at each resource roll-out nodeiAnd then, after determining the distribution resources, sending each distribution resource to other resource transfer-out nodes, optionally, in the embodiment of the present invention, in order to ensure transmission security, sending each distribution resource to other N-1 resource transfer-out nodes through a secure channel.
In the embodiment of the invention, the processable resource quantity X is determined at each resource roll-out nodeiThen, the amount X of the processable resource needs to be determinediPromise of (1) using H (x)i||ri) To represent a processable resource XiPromise of (a), riThe expression is a random number, H is a hash value, the number of processable resources can be hidden through commitment, the commitment is published in a public information list of a resource processing system, and a random number r is published in the verification processiThe method is convenient for miners to verify the commitment and ensures that the quantity of the processable resources determined by each resource transfer-out node is consistent with the commitment.
Optionally, in the embodiment of the present invention, in addition to sending the distribution resources to the other N-1 resource transfer-out nodes through the secure channel, the commitment corresponding to the number of the distribution resources needs to be sent to the other N-1 resource transfer-out nodes, so that the commitment is verified by miners.
That is, each resource is transferred out of the node PiDetermining the amount of processable resources XiAnd the number of processable resources XiCorresponding bearingNoH (x)i||ri) Is mixing XiSplitting the resource into N parts to obtain N-1 parts of distributed resources and one part of undistributed resources, wherein the number of the distributed resources is Xi1，Xi2，……，XiN-1For each quantity of distributed resources, X is determinedi1，Xi2，……，XiN-1Corresponding commitment H (x)ij||rij) Wherein j is 1,2,3, 4, … …, N-1; mixing Xi1And H (x)i1||ri1) Sent to P through secure channel1Resources are transferred out of the node, Xi2And H (x)i2||ri2) Sent to P through secure channel2And the resource transfer-out node and the like send the N-1 distributed resource quantities and the corresponding commitments to N-1 other resource transfer-out nodes.
Similarly, each resource roll-out node sends the distribution resource quantity to N-1 other resource roll-out nodes, receives the distribution resource quantity sent by the other N-1 other resource roll-out nodes, and determines the distribution resource quantity partial sum according to the N-1 distribution resource quantity and the self undistributed resource quantity, that is, the resource roll-out node determines the sum of only one part of all the distribution resource quantities, and each resource roll-out node does not know the processable resource quantity determined by the other resource roll-out nodes, so that the concealment and the safety of each resource roll-out node in the resource processing process are ensured.
In the embodiment of the invention, each resource roll-out node determines the distribution resource quantity partial sum according to the N-1 distribution resource quantities and the self undistributed resource quantity, namely, each resource roll-out node adds the N-1 distribution resource quantities and the self undistributed resource quantities to determine the distribution resource quantity partial sum of each resource roll-out node.
Illustratively, in the embodiment of the present invention, in the resource processing system, there are 3 resource roll-out nodes, each being P1、P2、P3For resource roll-out node P1The determined number of processable resources is 20; roll-out node P for resources2The determined number of processable resources is 60; roll-out node P for resources3The determined number of processable resources is 20, so that in practice, the total number of resources that can be processed by each resource transfer-out node is 20+60+20, which is 100; resource transfer-out node P1Dividing the resource quantity 20 into 3 shares, the resource quantity of each share is 5, 10 and 5 respectively, and sending the distributed resource quantity 5 to P2Sending the number of distributed resources 10 to P3(ii) a Resource transfer-out node P2Dividing the processable resource quantity 60 into 3 shares, the resource quantity of each share is respectively 15, 15 and 30, and sending the distributed resource quantity 15 to P1Sending the number of distributed resources 15 to P3(ii) a Resource transfer-out node P3Dividing the resource quantity 20 into 3 shares, each share of resource quantity is respectively 10, 4 and 6, and sending the distributed resource quantity 10 to P1Sending the number of distributed resources 4 to P2(ii) a For P1The partial sum of the calculated number of distributed resources is 5+15+ 10-30 for P2The calculated distribution resource quantity part sum is 30+5+ 4-39; for P3The calculated partial sum of the number of distributed resources is 6+10+ 15-31, and P can be certified1、P2、P3The sum of the calculated partial sums of the distributed resource amounts is 100.
In the embodiment of the invention, after the distribution resource quantity partial sum of each resource roll-out node is determined, zero knowledge proof of the distribution resource quantity partial sum is also required to be determined, and the zero knowledge proof is used for proving that the resource roll-out node is really the distribution resource quantity partial sum obtained by adding the distribution resource quantity sent by other N-1 other resource roll-out nodes and the non-distribution resource quantity per seiRepresenting resources transferring out of node PiPartial sum of the number of distributed resources, by π siProving zero knowledge representing the partial sum of the number of distributed resources, siAnd π siPublished in a public information list.
The miners verify each commitment and zero knowledge certificate in the public information list, and after the verification is passed, each s is verifiediSumming to obtain X, if X is determined to be larger than or equal to the requested resource quantity V, determining that the verification of the resource processing request is passed, and determining that the third-party node is in the process of determining the mineAnd after the work verification is passed, sending verification passing information aiming at the resource processing request of the resource request node to each resource roll-out node, and then transferring the resource quantity to a third-party node by each resource roll-out node.
The above process is a process before resource transfer, and the following describes a process in resource transfer.
Each resource roll-out node determines the quantity of the transferred resources according to the quantity of the processable resources of each resource roll-out node, the distributed resource quantity part of each resource roll-out node and the quantity of the resources requested by the resource request node, and specifically, each resource roll-out node determines the quantity of the transferred resources according to the quantity of the processable resources of each resource roll-out node, the distributed resource quantity part of each resource roll-out node and the determined proportion of the quantity of the transferred resources, and according to the proportion of the quantity of the transferred resources and the quantity of the resources requested by the resource request node. Illustratively, the node P is rolled out for any one of the resourcesiFor example, PiHas a processable resource quantity of XiThe sum of the distributed resource quantity part of each resource transfer-out node and the determined processable resource quantity is X according to the
And determining the proportion of the quantity of the transfer resources, and then determining the quantity of the transfer resources according to the quantity V of the requested resources and the proportion of the quantity of the transfer resources.
In the resource transfer process, each resource transfer-out node acquires public key information of a third-party node, determines transfer resource information according to the number of transfer resources and the public key information of the third-party node, and sends the transfer resource information to the third-party node.
In the embodiment of the invention, the encryption information of the transfer resource is determined by the public key information of the third-party node and can be used
The method is used for transmitting the random number used when the third-party node constructs the new transfer resource serial number, that is, when the resource transfer-out node transfers resources, the third-party node does not know the specific resource quantity but only can determine the transfer resource serial number corresponding to the transfer resource quantity, and the serial number can uniquely represent the transfer resource quantity.
Specifically, in the embodiment of the present invention, the third party node determines that the resource transfer-out node actually transfers the resource according to the transfer-in commitment corresponding to the transfer resource amount; and the zero knowledge proof corresponding to the transferred resource quantity is used for proving that the resource quantity transferred by the resource transfer-out node is the determined transferred resource quantity.
In the embodiment of the invention, the resource is transferred out of the node PiTransferring the resources to a third-party node, wherein the quantity of the transferred resources is Xi. Resource transfer-out node PiDeducting X from self-anonymized accountiIndividual resource and publish
CMoldRoll-out of node P for resourcesiTransferring old currency commitments of resources, i.e. at resource transfer-out node PiResources, sn, that need to be transferred out of the amount of transferred resources in its own anonymous accountiTo correspond to a unique serial number, piiFor zero knowledge proof of this resource transfer, which is used to prove the accuracy of the transferred resource amount,
the cipher text encrypted by the public key of the third party node is used for transmitting the random number used when the third party node constructs a new currency serial number
The new currency serial number refers to a third-party platform receiving resource transfer-out node PiSendingThe number of the transfer resources is increased in the anonymous account of the user, and the real number of the transfer resources is hidden by a new currency serial number, H (x)i||ri) Roll-out of node P for resourcesiCommitments to transfer amounts of resources, CMnewA commitment to transfer resources made by the third party platform. Through this published action, the resource roll-out node P is completediAnd (4) for the destruction action of the self resource, the generated new resource commitment can be solved only by the third-party platform.
In the embodiment of the invention, after receiving the transfer resource information of each resource transfer-out node, the third-party platform utilizes each resource transfer-out node
And determining all new resource serial numbers, carrying out merging operation, and generating a resource with the resource quantity V and a corresponding commitment on the account of the resource.
In the embodiment of the invention, when a miner receives the merging request, verifies that all the resource roll-out nodes fulfill correct commitments, performs correct resource transfer operation, and simultaneously verifies that the identity of the third-party node is error-free, the commitments corresponding to the resources with the resource quantity of V sent by the third-party node are written into the system commitment pool, so that the resource transfer is completed.
Optionally, in the embodiment of the present invention, after the resource transfer is performed, the resource requesting node may further perform feedback to the resource transferring-out node, where the resource requesting node sends the feedback resource to a third-party node, and each resource transferring-out node obtains its respective feedback resource through the third-party node. Specifically, the third party node publishes the resource information V ', subtracts V ' from the account of the third party node, publishes the resource serial number corresponding to V ', and publishes the zero knowledge proof pi corresponding to VV’And the third party node is proved to subtract the correct amount. The third party node publishes the resource serial number SN corresponding to the feedback denomination V 'obtained from the resource request node by the third party node and the promise corresponding to V', and destroys the resource corresponding to the resource serial number SN on the account of the third party node.
Each resource transfer-out node generates a corresponding number of transferred resourcesFeedback of resource quantity
Commitment corresponding to feedback resource quantity and zero knowledge proof pi corresponding to feedback resource quantitybThe miners verify the above operation and write all the new money commitments into the commitment list.
And after the resource transfer is completed, each resource transfer-out node logs out the respective established anonymous account.
For better explaining the embodiment of the present application, a resource processing method based on a block chain provided in the embodiment of the present application is described below with reference to a specific implementation scenario, where in the method, a resource is a donation resource, a resource request node is a donation recipient, a resource transfer-out node is a donation recipient, and a third-party platform is a donation platform, which is specifically shown in fig. 2:
step S201, the donated person sends a donation request with the amount of V;
step S202, after each donator receives the donation request, an anonymous account P is created;
step S203, each donor evaluates and gives the donation amount;
step S204, each donator determines the sum of the donation amount through safe multiparty summation calculation;
step S205, the donation platform evaluates whether the sum of the donation amount is greater than or equal to V, if so, step S206 is executed, otherwise, step S207 is executed;
step S206, the donation platform determines that the donation can be executed, and step S208 is executed;
step S207, quitting the donation process;
step S208, determining the contribution proportion of each donor;
step S209, each donator contributes money according to the self contribution proportion;
step S210, the donation platform merges all donations;
step S211, the miners verify the donation process and record the donation process in a block chain;
step S212, the donated person feeds back the gift to the donation platform;
step S213, the donation platform publishes and publicizes the feedback amount;
in step S214, each donor receives the feedback amount of the respective donation proportion, and step S207 is executed.
The above process is explained by taking resources as donation resources as an example, in the embodiment of the present invention, the meaning of the resources may be further extended, the resources may be further defined as loan resources, that is, a borrower loans through a loan platform, the borrower is a resource request node in the embodiment of the present invention, the loan platform is a third party node in the embodiment of the present invention, N resource transfer-out nodes are each institution that can provide a loan, and the feedback resources are interest that the borrower can pay to the loan institution, and similarly, the process of lending to one borrower and obtaining the interest by a plurality of loan institutions may be realized by the method in the embodiment of the present invention.
Based on the same technical concept, an embodiment of the present application provides a resource processing method based on a block chain, where the method is applied to a resource processing system including at least N resource roll-out nodes, resource request nodes, and a third-party node, as shown in fig. 3, and includes:
step S301, for each resource transfer-out node with an anonymous account, receiving the number of distributed resources sent by each of N-1 resource transfer-out nodes, where the number of distributed resources is determined by each resource transfer-out node according to the number of processable resources determined by each resource transfer-out node after acquiring a resource processing request of a resource request node and the total number N of the resource transfer-out nodes, the resource processing request includes the number of resources requested by the resource request node, and the number of distributed resources is a part of the number of processable resources of each resource transfer-out node;
step S302, each resource roll-out node determines the distribution resource quantity part sum of each resource roll-out node according to the received distribution resource quantity and the undistributed resource quantity determined by each resource roll-out node, and publishes the distribution resource quantity part sum and the zero knowledge proof of the distribution resource quantity part sum in a public information list of the resource processing system, wherein the distribution resource quantity part sum is used for verifying whether to execute the resource processing request of the resource request node, and the zero knowledge proof of the distribution resource quantity part sum is used for determining that each resource roll-out node calculates the distribution resource quantity part sum;
step S303, after each resource roll-out node receives the verification passing message for the resource processing request of the resource request node sent by the third party node, determine the number of transfer resources according to the number of processable resources of each resource roll-out node, the number of distributed resources of each resource roll-out node, and the number of resources requested by the resource request node, and roll out the number of transfer resources to the third party node.
Optionally, the distributing resource quantity is determined by each resource roll-out node according to the respectively determined processable resource quantity and the total quantity N of the resource roll-out nodes after acquiring the resource processing request of the resource request node, and includes:
after each resource roll-out node acquires a resource processing request of a second node, determining the quantity of transferred resources and determining the quantity of processable resources according to the quantity of resources requested by the resource request node;
each resource roll-out node divides the processable resource quantity into N parts, wherein N-1 parts are used as distributed resource quantity, and the other part is used as undistributed resource quantity.
Optionally, after each resource roll-out node determines the number of transferred resources and determines the number of processable resources, the method further includes:
each resource transfer-out node publishes commitments corresponding to the number of processable resources in a public information list of the resource processing system, wherein the commitments corresponding to the number of the processable resources are used for hiding the number of the processable resources from other N-1 resource transfer-out nodes;
after the resource roll-out nodes split the number of the processable resources into N parts, the method further includes:
each resource transfer-out node determines the commitment corresponding to each part for the N parts;
and each resource transfer-out node sends the quantity of the distributed resources and the commitment corresponding to the quantity of the distributed resources to other N-1 resource transfer-out nodes through a safety channel.
Optionally, the determining, by the resource transfer-out node, the number of transferred resources according to the number of processable resources of each resource transfer-out node, the part of the number of distributed resources of each resource transfer-out node, and the number of resources requested by the resource request node, includes:
each resource transfer-out node determines the proportion of the quantity of the transferred resources according to the quantity of the processable resources of each resource transfer-out node and the quantity of the distributed resources of each resource transfer-out node;
and each resource roll-out node determines the quantity of the transfer resources according to the quantity proportion of the transfer resources and the quantity of the resources requested by the resource request node.
Optionally, the resource processing system further includes a miner node, and the transferring the resource amount from each resource transferring node to the third-party node includes:
each resource roll-out node acquires public key information of the third-party node;
each resource transfer-out node determines transfer resource information according to the transfer resource quantity and the public key information of the third-party node, and sends the transfer resource information to the third-party node; the transfer resource information at least comprises transfer resource encryption information generated based on public key information of the third-party node, transfer-in commitments corresponding to the transfer resource quantity and zero knowledge proofs corresponding to the transfer resource quantity, and the transfer-in commitments are used for representing that the third-party node can obtain the transfer resource quantity;
and if the resource transfer-out nodes determine that the third-party node combines the transferred resource information of all the resource transfer-out nodes and passes the verification of the miner node, determining that the transferred resource quantity is transferred to the third-party node.
Based on the same technical concept, an embodiment of the present application further provides a resource processing apparatus based on a block chain, as shown in fig. 4, including:
a receiving unit 401, configured to receive the number of distributed resources sent by each of N-1 resource transfer-out nodes, where the number of distributed resources is determined according to the number of processable resources determined by each resource transfer-out node after obtaining a resource processing request of a resource request node and the total number N of the resource transfer-out nodes, where the resource processing request includes the number of resources requested by the resource request node, and the number of distributed resources is a part of the number of processable resources of each resource transfer-out node;
a distributed resource quantity part and determination unit 402, configured to determine, according to the received distributed resource quantity and the number of undistributed resources determined by each resource roll-out node, a distributed resource quantity part and a zero knowledge proof of the distributed resource quantity part and are published in a common information list of the resource processing system, where the distributed resource quantity part and the zero knowledge proof are used to verify whether to execute the resource processing request of the resource request node, and the distributed resource quantity part and the zero knowledge proof are used to determine that each resource roll-out node performs calculation of the distributed resource quantity part and;
a resource transferring unit 403, configured to determine, after receiving a verification passing message for the resource processing request of the resource requesting node sent by the third party node, a transfer resource quantity according to the processable resource quantity of each resource roll-out node, the distributed resource quantity part of each resource roll-out node, and the resource quantity requested by the resource requesting node, and transfer the transfer resource quantity to the third party node.
Optionally, the apparatus further comprises:
a distributed resource determining unit 404, configured to determine, after acquiring a resource processing request of a second node, a transfer resource quantity according to the resource quantity requested by the resource request node, and determine a processable resource quantity; and splitting the processable resource quantity into N parts, wherein N-1 parts serve as distributed resource quantity, and the other part serves as undistributed resource quantity.
Optionally, the distribution resource determining unit 404 is further configured to:
publishing commitments corresponding to the number of the processable resources in a public information list of the resource processing system, wherein the commitments corresponding to the number of the processable resources are used for hiding the number of the processable resources from other N-1 resource transfer-out nodes;
splitting the number of the processable resources into N parts, and determining commitments corresponding to each part for the N parts;
and sending the distribution resource quantity and the commitment corresponding to the distribution resource quantity to other N-1 resource transfer-out nodes through a security channel.
Optionally, the resource transfer unit 403 is specifically configured to:
determining the proportion of the quantity of the transferred resources according to the quantity of the processable resources of each resource transfer-out node and the quantity of the distributed resources of each resource transfer-out node;
and determining the quantity of the transfer resources according to the quantity proportion of the transfer resources and the quantity of the resources requested by the resource request node.
Optionally, the resource transfer unit 403 is specifically configured to:
acquiring public key information of the third-party node;
determining transfer resource information according to the number of the transfer resources and the public key information of the third-party node, and sending the transfer resource information to the third-party node; the transfer resource information at least comprises transfer resource encryption information generated based on public key information of the third-party node, transfer-in commitments corresponding to the transfer resource quantity and zero knowledge proofs corresponding to the transfer resource quantity, and the transfer-in commitments are used for representing that the third-party node can obtain the transfer resource quantity;
and if the third-party node is determined to combine the transferred resource information of all the resource transfer-out nodes and pass the verification of the miner node, determining that the transferred resource quantity is transferred to the third-party node.
Based on the same technical concept, the embodiment of the present application provides a computer device, as shown in fig. 5, including at least one processor 501 and a memory 502 connected to the at least one processor, where a specific connection medium between the processor 501 and the memory 502 is not limited in the embodiment of the present application, and the processor 501 and the memory 502 are connected through a bus in fig. 5 as an example. The bus may be divided into an address bus, a data bus, a control bus, etc.
In the embodiment of the present application, the memory 502 stores instructions executable by the at least one processor 501, and the at least one processor 501 may execute the steps included in the foregoing resource processing method based on a block chain by executing the instructions stored in the memory 502.
The processor 501 is a control center of the computer device, and may connect various parts of the terminal device by using various interfaces and lines, and obtain the client address by executing or executing the instructions stored in the memory 502 and calling the data stored in the memory 502. Optionally, the processor 501 may include one or more processing units, and the processor 501 may integrate an application processor and a modem processor, wherein the application processor mainly handles an operating system, a user interface, an application program, and the like, and the modem processor mainly handles wireless communication. It will be appreciated that the modem processor described above may not be integrated into the processor 501. In some embodiments, processor 501 and memory 502 may be implemented on the same chip, or in some embodiments, they may be implemented separately on separate chips.
The processor 501 may be a general-purpose processor, such as a Central Processing Unit (CPU), a digital signal processor, an Application Specific Integrated Circuit (ASIC), a field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof, and may implement or perform the methods, steps, and logic blocks disclosed in the embodiments of the present Application. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or may be implemented by a combination of hardware and software modules in a processor.
Based on the same technical concept, embodiments of the present application provide a computer-readable storage medium storing a computer program executable by a computer device, which when running on the computer device, causes the computer device to perform the steps of a block chain based resource processing method.
Those of ordinary skill in the art will understand that: all or part of the steps for implementing the method embodiments may be implemented by hardware related to program instructions, and the program may be stored in a computer readable storage medium, and when executed, the program performs the steps including the method embodiments; and the aforementioned storage medium includes: a mobile storage device, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
Alternatively, the integrated units described above in the present application may be stored in a computer-readable storage medium if they are implemented in the form of software functional modules and sold or used as independent products. Based on such understanding, the technical solutions of the embodiments of the present application may be essentially implemented or portions thereof contributing to the prior art may be embodied in the form of a software product stored in a storage medium, and including several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a removable storage device, a ROM, a RAM, a magnetic or optical disk, or various other media that can store program code.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (12)
1. A resource processing method based on a block chain is applied to a resource processing system at least comprising N resource roll-out nodes, a resource request node and a third-party node, wherein N is greater than or equal to 2, and the method comprises the following steps:
for each resource transfer-out node with an anonymous account, receiving the distribution resource quantity sent by each of the other N-1 resource transfer-out nodes, wherein the distribution resource quantity is determined by each resource transfer-out node according to the respectively determined processable resource quantity and the total quantity N of the resource transfer-out nodes after the resource transfer-out node obtains a resource processing request of a resource request node, the resource processing request comprises the resource quantity requested by the resource request node, and the distribution resource quantity is a part of the processable resource quantity of each resource transfer-out node;
each resource roll-out node determines the distributed resource quantity part sum of each resource roll-out node according to the received distributed resource quantity and the undistributed resource quantity determined by each resource roll-out node, and publishes the distributed resource quantity part sum and the zero knowledge proof of the distributed resource quantity part sum in a public information list of the resource processing system, wherein the distributed resource quantity part sum is used for verifying whether to execute the resource processing request of the resource request node, and the zero knowledge proof of the distributed resource quantity part sum is used for determining that each resource roll-out node calculates the distributed resource quantity part sum;
and if the verification of the resource processing request aiming at the resource request node sent by the third-party node is passed, determining the quantity of the transfer resources according to the quantity of the processable resources of the resource transfer-out nodes, the distribution resource quantity part of the resource transfer-out nodes and the quantity of the resources requested by the resource request node, and transferring the quantity of the transfer resources to the third-party node.
2. The method according to claim 1, wherein the distributing the resource amount is determined by each resource transfer-out node according to the respective determined processable resource amount and the total number N of the resource transfer-out nodes after acquiring the resource processing request of the resource requesting node, and includes:
after each resource roll-out node acquires a resource processing request of a second node, determining the quantity of transferred resources and determining the quantity of processable resources according to the quantity of resources requested by the resource request node;
each resource roll-out node divides the processable resource quantity into N parts, wherein N-1 parts are used as distributed resource quantity, and the other part is used as undistributed resource quantity.
3. The method of claim 2, wherein after each resource transfer-out node determines the number of transferred resources and determines the number of processable resources, the method further comprises:
each resource transfer-out node publishes commitments corresponding to the number of processable resources in a public information list of the resource processing system, wherein the commitments corresponding to the number of the processable resources are used for hiding the number of the processable resources from other N-1 resource transfer-out nodes;
after the resource roll-out nodes split the number of the processable resources into N parts, the method further includes:
each resource transfer-out node determines the commitment corresponding to each part for the N parts;
and each resource transfer-out node sends the quantity of the distributed resources and the commitment corresponding to the quantity of the distributed resources to other N-1 resource transfer-out nodes through a safety channel.
4. The method according to claim 1, wherein the determining, by each resource transfer-out node, the amount of resources to be transferred according to the amount of processable resources of each resource transfer-out node, the portion of the amount of resources to be distributed of each resource transfer-out node, and the amount of resources requested by the resource requesting node, comprises:
each resource transfer-out node determines the proportion of the quantity of the transferred resources according to the quantity of the processable resources of each resource transfer-out node and the quantity of the distributed resources of each resource transfer-out node;
and each resource roll-out node determines the quantity of the transfer resources according to the quantity proportion of the transfer resources and the quantity of the resources requested by the resource request node.
5. The method of claim 1, wherein the resource processing system further comprises a miner node, and wherein the transferring out of the transferred resource amount from each resource transfer-out node to the third party node comprises:
each resource roll-out node acquires public key information of the third-party node;
each resource transfer-out node determines transfer resource information according to the transfer resource quantity and the public key information of the third-party node, and sends the transfer resource information to the third-party node; the transfer resource information at least comprises transfer resource encryption information generated based on public key information of the third-party node, transfer-in commitments corresponding to the transfer resource quantity and zero knowledge proofs corresponding to the transfer resource quantity, and the transfer-in commitments are used for representing that the third-party node can obtain the transfer resource quantity;
and if the resource transfer-out nodes determine that the third-party node combines the transferred resource information of all the resource transfer-out nodes and passes the verification of the miner node, determining that the transferred resource quantity is transferred to the third-party node.
6. An apparatus for processing resources based on a block chain, the apparatus comprising:
a receiving unit, configured to receive the number of distributed resources sent by each of N-1 resource transfer-out nodes, where the number of distributed resources is determined by each resource transfer-out node according to a respective determined number of processable resources and a total number N of the resource transfer-out nodes after the resource transfer-out node obtains a resource processing request of a resource request node, the resource processing request includes the number of resources requested by the resource request node, and the number of distributed resources is a part of the number of processable resources of each resource transfer-out node;
a distributed resource quantity part and determination unit, configured to determine, according to the received distributed resource quantity and the number of undistributed resources determined by each resource roll-out node, a distributed resource quantity part and a zero knowledge certificate of the distributed resource quantity part and the zero knowledge certificate of the distributed resource quantity part are published in a common information list of the resource processing system, where the distributed resource quantity part and the zero knowledge certificate of the distributed resource quantity part are used to verify whether to execute the resource processing request of the resource request node, and the distributed resource quantity part and the zero knowledge certificate of the distributed resource quantity part are used to determine that each resource roll-out node performs calculation of the distributed resource quantity part and the zero knowledge certificate of the distributed resource quantity part;
and the resource transfer unit is used for determining the quantity of the transfer resources according to the quantity of the processable resources of each resource roll-out node, the distribution resource quantity part of each resource roll-out node and the quantity of the resources requested by the resource request node and transferring the quantity of the transfer resources to the third party node after receiving the verification passing message of the resource processing request aiming at the resource request node sent by the third party node.
7. The apparatus of claim 6, further comprising:
the distributed resource determining unit is used for determining the quantity of transferred resources and determining the quantity of processable resources according to the quantity of resources requested by the resource request node after the resource processing request of the second node is obtained; and splitting the processable resource quantity into N parts, wherein N-1 parts serve as distributed resource quantity, and the other part serves as undistributed resource quantity.
8. The apparatus of claim 7, wherein the distribution resource determining unit is further configured to:
publishing commitments corresponding to the number of the processable resources in a public information list of the resource processing system, wherein the commitments corresponding to the number of the processable resources are used for hiding the number of the processable resources from other N-1 resource transfer-out nodes;
splitting the number of the processable resources into N parts, and determining commitments corresponding to each part for the N parts;
and sending the distribution resource quantity and the commitment corresponding to the distribution resource quantity to other N-1 resource transfer-out nodes through a security channel.
9. The apparatus according to claim 6, wherein the resource transfer unit is specifically configured to:
determining the proportion of the quantity of the transferred resources according to the quantity of the processable resources of each resource transfer-out node and the quantity of the distributed resources of each resource transfer-out node;
and determining the quantity of the transfer resources according to the quantity proportion of the transfer resources and the quantity of the resources requested by the resource request node.
10. The apparatus according to claim 6, wherein the resource transfer unit is specifically configured to:
acquiring public key information of the third-party node;
determining transfer resource information according to the number of the transfer resources and the public key information of the third-party node, and sending the transfer resource information to the third-party node; the transfer resource information at least comprises transfer resource encryption information generated based on public key information of the third-party node, transfer-in commitments corresponding to the transfer resource quantity and zero knowledge proofs corresponding to the transfer resource quantity, and the transfer-in commitments are used for representing that the third-party node can obtain the transfer resource quantity;
and if the third-party node is determined to combine the transferred resource information of all the resource transfer-out nodes and pass the verification of the miner node, determining that the transferred resource quantity is transferred to the third-party node.
11. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method according to any of claims 1 to 5 are implemented when the computer program is executed by the processor.
12. A computer-readable storage medium, characterized in that it stores a computer program executable by a computer device, which program, when run on the computer device, causes the computer to carry out the method of any one of claims 1 to 5.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910539315.6A CN110278266B (en) | 2019-06-20 | 2019-06-20 | Resource processing method and device based on block chain |
| PCT/CN2020/093418 WO2020253504A1 (en) | 2019-06-20 | 2020-05-29 | Blockchain-based resource processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910539315.6A CN110278266B (en) | 2019-06-20 | 2019-06-20 | Resource processing method and device based on block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110278266A CN110278266A (en) | 2019-09-24 |
| CN110278266B true CN110278266B (en) | 2021-09-17 |
Family
ID=67961389
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910539315.6A Active CN110278266B (en) | 2019-06-20 | 2019-06-20 | Resource processing method and device based on block chain |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN110278266B (en) |
| WO (1) | WO2020253504A1 (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110278266B (en) * | 2019-06-20 | 2021-09-17 | 深圳前海微众银行股份有限公司 | Resource processing method and device based on block chain |
| CN113112252B (en) * | 2021-04-28 | 2023-03-10 | 深圳壹账通智能科技有限公司 | Resource transfer method and device based on block chain, electronic equipment and storage medium |
| CN113239374B (en) * | 2021-05-11 | 2024-02-02 | 中国联合网络通信集团有限公司 | Resource exchange method and node server |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108009441A (en) * | 2017-11-23 | 2018-05-08 | 阿里巴巴集团控股有限公司 | Resource transfers and the method and apparatus of fund transfer |
| CN108764874A (en) * | 2018-05-17 | 2018-11-06 | 深圳前海微众银行股份有限公司 | Anonymous refund method, system and storage medium based on block chain |
| CN109035029A (en) * | 2018-07-27 | 2018-12-18 | 阿里巴巴集团控股有限公司 | Based on the assets transfer method and device of block chain, electronic equipment |
| CN109102299A (en) * | 2018-08-01 | 2018-12-28 | 腾讯科技（深圳）有限公司 | Resource transfers data managing method, device and storage medium |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170330159A1 (en) * | 2016-05-13 | 2017-11-16 | Bank Of America Corporation | Resource allocation and transfer in a distributed network |
| US10643202B2 (en) * | 2017-07-25 | 2020-05-05 | Bank Of America Corporation | Real-time processing distributed ledger system |
| CN109545340A (en) * | 2018-10-27 | 2019-03-29 | 平安医疗健康管理股份有限公司 | A kind of medical resource management method, server and system |
| CN109903026A (en) * | 2018-12-14 | 2019-06-18 | 阿里巴巴集团控股有限公司 | Event-handling method and device, electronic equipment based on block chain |
| CN110278266B (en) * | 2019-06-20 | 2021-09-17 | 深圳前海微众银行股份有限公司 | Resource processing method and device based on block chain |
-
2019
- 2019-06-20 CN CN201910539315.6A patent/CN110278266B/en active Active
-
2020
- 2020-05-29 WO PCT/CN2020/093418 patent/WO2020253504A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108009441A (en) * | 2017-11-23 | 2018-05-08 | 阿里巴巴集团控股有限公司 | Resource transfers and the method and apparatus of fund transfer |
| CN108764874A (en) * | 2018-05-17 | 2018-11-06 | 深圳前海微众银行股份有限公司 | Anonymous refund method, system and storage medium based on block chain |
| CN109035029A (en) * | 2018-07-27 | 2018-12-18 | 阿里巴巴集团控股有限公司 | Based on the assets transfer method and device of block chain, electronic equipment |
| CN109102299A (en) * | 2018-08-01 | 2018-12-28 | 腾讯科技（深圳）有限公司 | Resource transfers data managing method, device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2020253504A1 (en) | 2020-12-24 |
| CN110278266A (en) | 2019-09-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11861606B2 (en) | Blockchain system for confidential and anonymous smart contracts | |
| US11341487B2 (en) | System and method for information protection | |
| EP3549303B1 (en) | System and method for information protection | |
| AU2018347195B2 (en) | System and method for information protection | |
| Lin et al. | A survey of blockchain security issues and challenges. | |
| AU2018347196B2 (en) | System and method for information protection | |
| AU2018347197B2 (en) | System and method for information protection | |
| CN108171511B (en) | Block chain system with privacy protection function | |
| US20200193432A1 (en) | Method and system for settling a blockchain transaction | |
| US20200127813A1 (en) | Method and system for creating a user identity | |
| EP3642773B1 (en) | System and method of multi-round token distribution using a blockchain network | |
| CN110278266B (en) | Resource processing method and device based on block chain | |
| CN113393225A (en) | Digital currency encryption payment method and system | |
| Suliyanti et al. | Evaluation of hash rate-based double-spending based on proof-of-work blockchain | |
| AU2019101598A4 (en) | System and method for information protection | |
| AU2019101590A4 (en) | System and method for information protection | |
| Aung et al. | Cryptographic and Consensus Techniques Supporting Privacy and Security Management of Cryptocurrency Transactions |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |