CN113055370B - Block chain random number consensus boost BCR method - Google Patents
Block chain random number consensus boost BCR method Download PDFInfo
- Publication number
- CN113055370B CN113055370B CN202110251551.5A CN202110251551A CN113055370B CN 113055370 B CN113055370 B CN 113055370B CN 202110251551 A CN202110251551 A CN 202110251551A CN 113055370 B CN113055370 B CN 113055370B
- Authority
- CN
- China
- Prior art keywords
- node
- random number
- nodes
- judgment
- time
- 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
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/12—Applying verification of the received information
-
- 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/12—Applying verification of the received information
- H04L63/123—Applying verification of the received information received data contents, e.g. message integrity
-
- 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/20—Network architectures or network communication protocols for network security for managing network security; network security policies in general
-
- 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/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- 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/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
-
- 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/55—Push-based network services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Abstract
The invention provides a block chain random number consensus election billing method, which comprises the following steps: all specific nodes in the alliance respectively generate random numbers x i The method comprises the steps of carrying out a first treatment on the surface of the Mutual synchronization of random numbers x between all specific nodes i The method comprises the steps of carrying out a first treatment on the surface of the Each specific node receives a random number x of more than half of the online nodes i Calculating a function f 1 Obtaining a reference value V; reference value V and random number x of the received node i By a function f 2 Calculating candidate billing function value J, taking f 2 (x i V) a holding random number x satisfying a predetermined characteristic i Node P of (2) i As a candidate billing; the candidate billable is verified by more than half of the nodes on line as conforming to the preset feature, and the candidate billable is determined to be a billable.
Description
Technical Field
The invention relates to a blockchain technology, in particular to a blockchain random number consensus and promotion method.
Background
Blockchain technology is a current hot technology that can be divided into three categories: public chains, alliance chains, and private chains. The public chain has no central server, nodes participating in the public chain can be freely accessed into the network according to the rule of the system, work is carried out among the nodes based on a consensus mechanism, and the bit coin belongs to a typical public chain. The alliance chain is composed of preset participated members, and the access and exit of the network of the nodes are carried out in the alliance. The private chain is generally built in a certain enterprise, the operation rules of the system are set according to the enterprise requirements, and the members entering the private chain are still controlled and formulated by the center.
Of the three blockchain types described above, only public chains truly solve the trust problem, and federation chains and private chains are based on certain trust mechanisms.
However, the performance is minimal among the three types of blockchains due to the substantial amount of effort required for "mining" in public chains. For example, the trust mechanism of the bitcoin-push accounter adopts a workload proof method (namely, adopts a mining mode), who finishes the calculation meeting certain conditions first, and who is the accounter.
The trust mechanism of the 'mining' pushing accounting person of the current bitcoin is the only meeting the random, public and consensus requirements. However, the bitcoin determination accounting person needs to perform a large amount of time-consuming calculation, which is an inefficient method for determining the accounting person and is not suitable for the requirements of the alliance chain. Whereas the current method of federation chain electing a biller is not random and thus has a centralized feature.
Disclosure of Invention
The invention aims to provide a random, notarized and consensus billing person determining method.
In order to solve the technical problems, the invention provides a blockchain random number consensus and promotion method, which comprises the following steps: all specific nodes in the alliance respectively generate random numbers x i The method comprises the steps of carrying out a first treatment on the surface of the Mutual synchronization of random numbers x between all specific nodes i The method comprises the steps of carrying out a first treatment on the surface of the Each specific node firstly passes through a preset function f 1 Obtaining reference value V of random numbers of u or more than u nodes, and then passing through preset function f 2 Obtaining a random number x i Value of the accounting function J between the value of the accounting function and the reference value V i Then determine J by calculation i Whether the preset characteristics are met or not to select the corresponding node P i As a candidate billing;
and synchronizing the candidate accounts and the node number value participating in the calculation of the reference value V among all the specific nodes, and finally, pushing out the accounts after other nodes check compliance.
As an improvement on the blockchain random number consensus boost method BCR of the present invention: the specific node is the time t generated by the random number i Among the N nodes in the federation, Z nodes are actually online.
As a further improvement to the blockchain random number consensus boost method BCR of the present invention: the preset features are that the function values J of the billing agents are ordered in a certain number sequence, and a certain number value arranged from front to back or from back to front is selected on the number sequence as a judgment condition meeting the preset features.
As a further improvement to the blockchain random number consensus boost method BCR of the present invention: mutually each otherSynchronizing the random numbers: the data blocks are pushed to each other among all the specific nodes; the data block M includes, but is not limited to, a node identification P i Random number x i And a random number x i Time t of generation i And node P i Public key signature D [ P ] i 、x i 、t i ]。
As a further improvement to the blockchain random number consensus boost method BCR of the present invention: obtaining a random number reference value: firstly, each specific node respectively verifies whether the data block is compliant; if not, repeating the step of generating random numbers by the specific nodes respectively; if the nodes are in compliance, each specific node calculates t respectively k To t k+1 Reference value V of all the compliance random numbers x generated in time.
The verification step comprises the following steps: random number judgment: random number x i Whether or not to accord with x i B is less than or equal to 2 w W is an appropriate integer; and (3) time judgment: time t i Whether or not at t k To t k+1 Within the time frame of (2), said t k For the start time of a certain push, t k+1 The starting time for the next push; and (3) judging the node identification: whether node identification P is included in Z nodes i Corresponding node P i The method comprises the steps of carrying out a first treatment on the surface of the If the random number judgment, the time judgment and the node identification judgment are all in compliance, judging that the data block is in compliance; if any one of the random number judgment, the time judgment and the node identification judgment is not compliant, the data block is judged to be not compliant.
The calculation method of the reference value V comprises the following steps: mod B; said->Respectively corresponding nodes->A random number generated; said f 1 A function for calculating random numbers; the node number value is Z; candidate billable function value J i Is calculated by the following steps: j (J) i ＝f 2 (x i V), said f 2 For random number x of any pair i The function calculated by the reference value V is larger than or equal to 0 and smaller than B, namely 0 is smaller than or equal to J i ＜B。
As a further improvement to the blockchain random number consensus boost method BCR of the present invention: candidate billboards nodes are found through calculation, and data blocks M containing the confirmed nodes are synchronized to other nodes.
The candidate node P' is determined by the following minimum (or maximum etc.) seeking calculation:
(1)
(2)
node e, which calculates candidate node P ', issues a candidate node P' data block:
e is the number of the transmitting node, t e For the data block transmission time D [ V, P', e, t e ]Is a signature value.
As a further improvement to the blockchain random number consensus boost method BCR of the present invention: the federation node checks the compliance of the candidate node P' data block M and eventually confirms the biller node.
The node pair M e Compliance checking of (c):
node e of non-candidate P v Received data block M e For M e Performing verification, i.e. verification M e V, P', e, t e 、D[V、P’、e、t e ]。
If the random number judgment, the time judgment, the node identification judgment are all compliant and the signature verification judgment are correct, judging that the data block is correct;
if any one of the random number judgment, the time judgment, the node identification judgment and the signature verification judgment is not compliant, the data block is judged to be incorrect.
If it is determined to be correct, the data M is issued v ＝(V、P’、e、t e 、e v 、t v 、D[V、P’、e、t e 、e v 、t v ])。
The terminal acknowledges the biller node:
if among N nodes, a certain node e c Receiving and confirming that more than u nodes are received, and issuing a correct checking result M comprising the same node P v The accounting node P' is active and becomes the official accounting node P. e, e c Node issues data block M containing P node C ＝(V、P、e、t e 、e c 、t c 、D[V、P、e、t e 、e c 、t c ])。
Other nodes receive M C After that, first determine data V, P, e, t e 、e c 、t c Whether or not it is compliant, whether or not it is not compliant, e.g. compliant, and D [ V, P, e, t ] e 、e c 、t c ]If the signature verification is correct, then confirm M C Effectively, the basic validation P is the accounting node, and the node stops computing V and J. If there are a plurality of M C At t c The earliest P is the final confirmation accounting node, and the promotion is completed.
The basic principle of the invention is that each member of the alliance (node server or terminal of each member of the alliance, also called node) randomly generates a random number, each member calculates a reference value after receiving a certain amount (u or more) of random numbers of all other members, and the member of the random number which is closest to the reference value (can be the farthest, etc.), is the candidate accounting person which is randomly publically promoted. When this candidate is identified by other members (u or more) as the earliest candidate, the candidate is the final billing. The method has high efficiency, is random, fair and fair, is suitable for the role of the nodes of the alliance chain to push up the accounter, and has important significance for the decentralization of the alliance chain.
The invention has the main advantages that:
1. randomness: the entire calculation of the data generated in each node in this patent is random, so the biller is also randomly selected, which is virtually equivalent to the bitcoin-selected biller.
2. Fairness: the billboards are randomly selected, and the probability of each node being selected as the billboards is equal, so that fairness is reflected. If the biller is not chosen in a random manner, some traffic may be rejected by frequent billers or quickly reassembled and stolen.
3. Consensus: the algorithm is participated by all online nodes, all nodes calculate according to a unified specification (algorithm), and the accounting person is commonly promoted.
4. Safety: any node cheats, the randomness and fairness of the election are not affected, and the numbers and even most people cheat, so long as the random numbers are adopted by one node, the algorithm system can still make random and fair selection.
Drawings
The following describes the embodiments of the present invention in further detail with reference to the accompanying drawings.
Fig. 1 is a schematic flow chart of the present invention.
Detailed Description
Embodiment 1, fig. 1, presents a blockchain random number consensus election method BCR (a blockchainconsensus method by random number, or a blockchain choose method by randomnumber) that is suitable for the accountant election of a federated chain.
The method comprises the following specific steps:
step one, any node P in the alliance generates a random number x:
at the time delta of one push (delta= |t) k -t k+1 |，t k For the start time of a certain push, t k+1 Start time for next election), among the N nodes P in the federation, Z nodes P are actually online, and the Z nodes P generate corresponding random numbers x respectively;
that is, at time t i (time t i At t k To t k+1 Between) the actual online node is P 1 、P 2 、P 3 、…、P i 、…、P z The method comprises the steps of carrying out a first treatment on the surface of the Then, the corresponding generated random number is x 1 、x 2 、x 3 、…、x i 、…、x z The method comprises the steps of carrying out a first treatment on the surface of the Namely P i Hold x i 。
Step two, the node P pushes the data block to other nodes and receives the same kind of data block pushed by other nodes P:
in step one, all nodes P generating the random number x perform data block pushing with each other, such as node P i Push (broadcast) its data block to other Z-1 nodes P, and the other Z-1 nodes P push the same kind of data block back to the node P i In the meantime, i.e. at any node P i All data blocks of the Z nodes P are synchronized;
the above-described data block m= (P i 、x i 、t i 、D[P i 、x i 、t i ]) Including but not limited to node identification P i Random number x i And a random number x i Time t of generation i And their signature data D [ P ] i 、x i 、t i ]。
Step three, when one node receives compliance (P i 、x i 、t i 、D[P i 、x i 、t i ]) After the data, selecting candidate bookkeeping agents:
by compliance checking and signature verification of the relevant data, it is determined whether the received data is compliant, the process of verification being as follows:
and (3) random number verification: random number x i Whether or not to accord with x i B is less than or equal to B, and the optional value of B is 2 w W is an appropriate integer;
and (3) time verification: time t i Whether or not at t 1 To t 2 Is within a time range of (2);
and (3) verifying node identification: node P i Whether or not it is node P 1 、P 2 、P 3 、…、P i 、…、P z One of them;
D[P i 、x i 、t i ]whether or not it is P i 、x i 、t i Such signing and verification is usually performed with a strong enough public key cipher, such as SM3 (cryptographic hash algorithm) and SM2 (elliptic curve public key cipher algorithm);
once the node, random number, time verification and signature verification meet the rules, confirming that the verification is passed; once any of the node, random number, time verification, and signature verification are non-conforming to the rules described above, the verification fails. Continuing to receive and verify until the compliance data of the u nodes are received;
after passing the verification, first for the time t i (time t i At t k To t k+1 Between) the generated u random numbers x are calculated to obtain a reference value by the following formula:
the saidRespectively corresponding nodes-> A random number generated; said f 1 Is a function of calculating a random number;
second, according to a preset function f 2 Obtaining the association value of the random number x and the reference value V, and obtaining f 2 (x i V) a holding random number x satisfying a predetermined characteristic i Node P of (2) i As candidate billing P':
the P' node is determined by the following seek minimum (or maximum, etc.) calculation:
(1) namely:
(2)
wherein f 2 For random number x of any pair i The function calculated by the reference value V is larger than or equal to 0 and smaller than B, namely 0 is smaller than or equal to J i ＜B。
Step four, publishing the candidate node P' data block and verifying by other nodes: when one node e obtains a candidate node P 'through receiving and calculating, data information M for calculating P' is issued to other nodes e And verified by the other nodes,
e is the sending node codeNumber t e For the data block transmission time D [ V, P', e, t e ]Is a signature value;
other nodes receive M e After that, verification is performed.
Step five, finally determining the billing person and issuing, wherein other nodes stop obtaining calculation of the billing node:
when among the N nodes, node e c Receiving and validating data of more than u nodes, and each of the u nodes issues a verification correct result M containing a node P v The accounting node P' becomes the official accounting node P, e c Node issues data block M containing P node C ＝(V、P、e、t e 、e c 、t c 、D[V、P、e、t e 、e c 、t c ])；
A node receives M C After that, first determine data V, P, e, t e 、e c 、t c Whether or not it is compliant, whether or not it is not compliant, e.g. compliant, and D [ V, P, e, t ] e 、e c 、t c ]If the signature verification is correct, then confirm M C Effectively, acknowledge P is an accounting node that stops computing V and J computations.
Finally, it should also be noted that the above description illustrates only one embodiment of the present invention. Obviously, the invention is not limited to the above embodiments, but many variations are possible. All modifications directly derived or suggested to one skilled in the art from the present disclosure should be considered as being within the scope of the present invention.
Claims (6)
1. A BCR method is characterized in that: comprising the following steps:
specific N nodes in the alliance respectively generate random numbers x i ；
Mutual synchronization of data blocks M, m= (P) between all specific N nodes i 、x i 、t i 、D[P i 、x i 、t i ]),D[P i 、x i 、t i ]For node P i Is a public key signature of (a);
each specific node firstly passes through a preset function f 1 Obtaining a reference value V of random numbers of u nodes, and then passing through a preset function f 2 Obtaining a random number x i Value of the accounting function J between the value of the accounting function and the reference value V i Selecting a value J of a function of a billing agent meeting a preset characteristic requirement i Random number x i Corresponding node P i As a candidate billing;
the candidate accounts and the node number value participating in the reference value calculation are mutually synchronized among all the specific nodes, and after other nodes check compliance, the accounts are finally promoted; wherein, the liquid crystal display device comprises a liquid crystal display device,
pushing or broadcasting data blocks among all specific nodes; the data block includes a node identification P i Random number x i Random number x i Time t of generation i P i 、x i 、t i Signature data D [ P ] of (a) i 、x i 、t i ]；
Each specific node respectively verifies whether the data block is compliant; if the random number is not compliant or correct, repeating the step of respectively generating the random number by the specific node; if the nodes are in compliance, each specific node calculates t respectively k To t k+1 The reference value V of the first u compliance random numbers x generated in time;
the calculation method of the reference value V comprises the following steps:
the saidRespectively corresponding nodes-> A random number generated; said f 1 To a random numberA function of row calculation;
the node number value is u;
accounting function value J i Is calculated by the following steps:
J i ＝f 2 (x i ，V)；
said f 2 Is a pair of random numbers x i The function calculated by the reference value V is larger than or equal to 0 and smaller than B, namely 0 is smaller than or equal to J i ＜B；
The candidate node P' is determined by the following minimum or maximum seeking calculation:
(1)
(2)
node e, which calculates candidate node P ', issues a candidate node P' data block:
e is the number of the transmitting node, t e For the data block transmission time D [ V, P', e, t e ]Is a signature value;
verification of P' data block:
node e of non-candidate P v Received data block M e For M e Performing verification, i.e. verification M e Is a data item of each of the data itemsV, P', e, t e 、D[V、P’、e、t e ]；
If the random number judgment, the time judgment, the node identification judgment are all compliant and the signature verification judgment are correct, judging that the data block is correct;
if any one of the random number judgment, the time judgment, the node identification judgment and the signature verification judgment is not compliant, judging that the data block is incorrect;
if it is determined to be correct, the data M is issued v ＝(V、P’、e、t e 、e v 、t v 、D[V、P’、e、t e 、e v 、t v ])。
2. The blockchain random number consensus boost BCR method of claim 1, wherein: the specific node is the time t generated by the random number i Among N nodes in the alliance, Z nodes which are actually online (data blocks of u nodes which pass signature verification are received, u>(1/2)N)。
3. The blockchain random number consensus boost BCR method of claim 1, wherein: the preset features are that the function values J of the billing agents are ordered in a certain number sequence, and a certain number value arranged from front to back or from back to front is selected on the number sequence as a judgment condition meeting the preset features.
4. The blockchain random number consensus boost method of claim 1, wherein: the verification step comprises the following steps:
random number judgment: random number x i Whether or not to accord with x i < B, wherein B has a value of 2 w W is an appropriate integer;
and (3) time judgment: time t i Whether or not at t k To t k+1 Within the time frame of (2), said t k For the start time of a certain push, t k+1 The starting time for the next push;
and (3) judging the node identification: whether the node identification P is included in the u nodes i Corresponding node P i ；
D[P i 、x i 、t i ]Whether or not it is node P i P of (2) i 、x i 、t i Is a signature data of (a);
if the random number judgment, the time judgment, the node identification judgment and the signature verification judgment are correct, judging that the data block is compliant;
if any one of the random number judgment, the time judgment, the node identification judgment and the signature verification judgment is not compliant, the data block is judged to be not compliant.
5. The blockchain random number consensus election BCR method of claim 1, wherein node e, when among the N nodes c Receiving and validating data of more than u nodes, and each of the u nodes issues a verification correct result M containing a node P v The accounting node P' becomes the official accounting node P; e, e c Node issues data block M containing P node C ＝(V、P、e、t e 、e c 、t c 、D[V、P、e、t e 、e c 、t c ])。
6. The blockchain random number consensus election BCR method of claim 5, wherein a node receives M C After that, first determine data V, P, e, t e 、e c 、t c Whether or not it is compliant, whether or not it is not compliant, e.g. compliant, and D [ V, P, e, t ] e 、e c 、t c ]If the signature verification is correct, then confirm M C Effectively, acknowledge P is an accounting node that stops computing V and J computations.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110251551.5A CN113055370B (en) | 2021-03-08 | 2021-03-08 | Block chain random number consensus boost BCR method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110251551.5A CN113055370B (en) | 2021-03-08 | 2021-03-08 | Block chain random number consensus boost BCR method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113055370A CN113055370A (en) | 2021-06-29 |
| CN113055370B true CN113055370B (en) | 2023-10-10 |
Family
ID=76510298
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110251551.5A Active CN113055370B (en) | 2021-03-08 | 2021-03-08 | Block chain random number consensus boost BCR method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113055370B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107347009A (en) * | 2017-08-30 | 2017-11-14 | 北京知金链网络技术有限公司 | Block chain one-dimensional random number common recognition election method |
| CN107481145A (en) * | 2017-08-30 | 2017-12-15 | 北京知金链网络技术有限公司 | Block chain multidimensional random number common recognition election method |
| CN107493173A (en) * | 2017-08-30 | 2017-12-19 | 北京知金链网络技术有限公司 | Block chain random number common recognition election method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200059369A1 (en) * | 2017-05-16 | 2020-02-20 | Peking University Shenzhen Graduate School | Determining consensus by parallel proof of voting in consortium blockchain |
-
2021
- 2021-03-08 CN CN202110251551.5A patent/CN113055370B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107347009A (en) * | 2017-08-30 | 2017-11-14 | 北京知金链网络技术有限公司 | Block chain one-dimensional random number common recognition election method |
| CN107481145A (en) * | 2017-08-30 | 2017-12-15 | 北京知金链网络技术有限公司 | Block chain multidimensional random number common recognition election method |
| CN107493173A (en) * | 2017-08-30 | 2017-12-19 | 北京知金链网络技术有限公司 | Block chain random number common recognition election method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113055370A (en) | 2021-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7320493B2 (en) | Execution of smart contracts with distributed cooperation | |
| CN110473105B (en) | Block chain transaction settlement method, system and related equipment | |
| CN108924092B (en) | Public arbitration distributed cloud storage method and system based on block chain | |
| KR101837169B1 (en) | Method for providing secret electronic voting service on the basis of blockchain with merkle tree structure by using zero knowledge proof algorithm, and voting coin minter server, voting token distributor server and voting supporting server using the same | |
| CN107580022B (en) | Data sharing system and method | |
| CN109104413B (en) | Method for solving intersection of private data for secure multi-party computation and verification method | |
| KR101837170B1 (en) | Method for providing secret electronic voting service on the basis of blockchain by using zero knowledge proof algorithm, and voting coin minter server, voting token distributor server and voting supporting server using the same | |
| CN106878000A (en) | A kind of alliance's chain common recognition method and system | |
| CN110855432B (en) | Asynchronous BFT & DPOS consensus mechanism for assigning verifier rewards based on verifiable random functions | |
| Nakanishi et al. | Unlinkable divisible electronic cash | |
| Zhu et al. | Interactive incontestable signature for transactions confirmation in bitcoin blockchain | |
| CN111817855B (en) | Electronic voting method and system based on Ether house block chain | |
| CN110223067B (en) | Under-chain one-to-many payment method and system with decentralized characteristic | |
| CN111582843A (en) | Block chain privacy transaction method based on aggregated signature | |
| CN111163109A (en) | Block chain center-removing type node anti-counterfeiting method | |
| CN111787034B (en) | Block generation method, synchronization method, device, blockchain system and storage medium | |
| CN111091380B (en) | Block chain asset management method based on friend hidden verification | |
| CN111865595B (en) | Block chain consensus method and device | |
| CN110503429B (en) | Decentralized content interaction method and system | |
| US20220278854A1 (en) | Unity Protocol Consensus | |
| WO2020082414A1 (en) | Voucher issuing method and apparatus, computer device, and storage medium | |
| CN113055370B (en) | Block chain random number consensus boost BCR method | |
| De Santis et al. | Communication efficient Zero-knowledge Proofs of knowledge: With applications to Electronic Cash | |
| CN114422146A (en) | Anonymous sorting method for block chain main nodes | |
| US20230162176A1 (en) | Method for implementing a digital coin system using a blockchain |
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 |