CN110460615A - The construction method of alliance's chain based on discrete logarithm - Google Patents
The construction method of alliance's chain based on discrete logarithm Download PDFInfo
- Publication number
- CN110460615A CN110460615A CN201910777124.3A CN201910777124A CN110460615A CN 110460615 A CN110460615 A CN 110460615A CN 201910777124 A CN201910777124 A CN 201910777124A CN 110460615 A CN110460615 A CN 110460615A
- Authority
- CN
- China
- Prior art keywords
- block
- discrete logarithm
- alliance
- puzzle
- chain
- 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.)
- Granted
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/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1441—Countermeasures against malicious traffic
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Storage Device Security (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention relates to the construction methods of alliance's chain based on discrete logarithm, comprising: A. initializes trapdoor discrete logarithm group according to security parameter；B. open parameter sucking is generated in the original block of alliance's chain, then sends each federation node for trapdoor；C. each federation node is included verifying to the self information and discrete logarithm puzzle of block to each block of generation；D. each federation node carries out packing verifying to the Transaction Information generated in current network, and it is recorded in the block being verified through step C, then a discrete logarithm puzzle is generated, and it is solved using discrete logarithm puzzle of the trapdoor to a upper block, the result of solution is recorded in block, block is verified for other nodes.The present invention increases substantially the read-write efficiency of alliance's chain, while also effectively increasing alliance's chain safety and flexibility in operation.
Description
Technical field
It is especially the construction method of alliance's chain based on discrete logarithm the present invention relates to network safety filed.
Background technique
The concept of block chain is suggested in first official in 2008, it can be used to implement the public affairs under decentralization environment
Account book and not modifiable transaction record altogether.Block chain can substantially be divided into publicly-owned chain (Public Blockchain), privately owned chain
(Private Blockchain) and alliance's chain (Consortium Blockchain) three categories.
It is publicly-owned chain that wherein decentralization degree is highest.It is this using bit coin and ether mill as the publicly-owned block of representative
Chain is not controlled by the third-party institution, and all people can be read data record on chain, participate in business and compete new in the world
Book keeping operation power of block etc..Program developer haves no right to interfere user, and each participant's (i.e. node) freely can be added and exit network,
And relevant operation is carried out according to wish.
Privately owned block chain is then completely on the contrary, the write-in permission of the network is by some tissue or the control of mechanism full powers, data
Permission is read by organization prescribed or opening or there is a degree of access to be limited.It in simple terms, can be by it
The system for being interpreted as a weak center or multicenter.There is stringent limitation and few due to participating in node；With publicly-owned chain phase
, transactions velocity more relatively short than, time that privately owned chain is reached common understanding is faster, more efficient, cost is lower.It is but such
Block chain is used more suitable for particular organization inside, such as Linux foundation.
And alliance's chain is then block chain between publicly-owned chain and privately owned chain, it can be achieved that " part decentralization ".Chain
Upper each node usually has corresponding physical mechanism or tissue；Network and composition interests is added by authorization in participant
Related alliance, it is common to safeguard the operation of block chain.To some degree, alliance's chain also belongs to the scope of privately owned chain, only private
Having degree is different.It equally has the characteristics that cost is relatively low, efficiency is higher thus, suitable between different entities
The B2B transaction such as transaction, clearing.
Traditional block chain is imagined dependent on single safety, for example, hash function anti-collision and digital signature not
Forgeability etc., so, once hash function is broken (such as SHA-1) either such digital signature (or its dependence
Mathematical problem) it is broken (quantum computer), then block chain faces the danger being broken.
It, can be by introducing additional mathematical difficulties problem: discrete right in order to improve above problem bring security risk
Number problem, and the construction based on current block chain, to be improved to block chain.However, it is tired simply to introduce discrete logarithm
Difficult problem is easily reduced the calculating efficiency of whole system.If allow all nodes of whole network it is all fair participate in it is discrete right
Several calculating come up, this certainly will will cause the excessively huge (here since the discrete logarithm on high-order group solves of computing cost
For being difficult in calculating on current device).
Summary of the invention
The construction method of the present invention provides a kind of alliance's chain based on discrete logarithm, to improve the read-write effect of alliance's chain
Safety and flexibility in rate, and operation.
The present invention is based on the construction methods of alliance's chain of discrete logarithm, comprising:
A. initialize trapdoor discrete logarithm group: according to security parameter λ, generate parameter corresponding to discrete logarithm group (G, q,
G, Td), wherein G is the multiplicative group of q rank, and generating member is g, and Td is the trapdoor of discrete logarithm group；
B. initialize alliance's chain: generating the original block (Genesis Block) of alliance's chain, and will open parameter P=(G,
Q, g, H1) the write-in original block, wherein the first hash function H1Are as follows: H1: { 0,1 }*Then → G specifies a collection of alliance's section
Point, and each federation node is sent by the trapdoor Td；
C. the block verifying of alliance's chain based on discrete logarithm: each federation node wraps each block of generation
The verifying to the self information and discrete logarithm puzzle of block is included, the block by verifying is correct block；
D. the block of alliance's chain based on discrete logarithm records: each federation node is to the Transaction Information generated in current network
Packing verifying is carried out, and is recorded in the block being verified through step C, then generates a discrete logarithm puzzle, and make
It is solved with discrete logarithm puzzle of the trapdoor Td to a upper block, the result of solution is recorded in block, be used for other
Node verifies block.
The rapid solving to discrete logarithm is assisted by introducing trapdoor discrete logarithm group, and realizing block chain can
Flexibly converted between publicly-owned chain and alliance's chain.On trapdoor discrete logarithm group, any grasp has the people of the trapdoor of this group all
Discrete logarithm can be efficiently calculated, and for the people that other do not grasp trapdoor, discrete logarithm can not be calculated.It is logical
It crosses and gives all federation nodes (authorization node) to grasp discrete logarithm trapdoor, thus construct one based on discrete logarithm
Alliance's chain.Due to the presence of trapdoor, the computing cost of whole system will not be caused significantly to increase, in addition, due also to drawing
Additional difficult problem (discrete logarithm) is entered, other nodes for not grasping trapdoor can not calculate discrete logarithm, this is also therefore big
Amplitude improves the safety of alliance's chain.
Specifically, step A includes: the multiplicative group G for generating a q rank according to security parameter λ, the generation of the multiplicative group G
Member is g, and generates the trapdoor Td for calculating discrete logarithm, passes through gαThe solution α of discrete logarithm is calculated in=h, wherein h ∈ G,
For an element on multiplicative group G.
Specifically, discrete logarithm puzzle described in step C are as follows: in block chain in the block head of block be added one by
(αi-1, hi) composition discrete logarithm puzzle, wherein αi-1It is the discrete logarithm puzzle h for meeting a blocki-1Solution, makeI is the mark of current block, and i-1 is the mark of the previous block of current block, hiFor current block from
Dissipate logarithm puzzle, hiIt is according to the principle of Merkel's Hash tree, using each of current block i Transaction Information as one
A leaf node carries out Hash calculation two-by-two, finally obtains root node Ri, then by hi=H1(Ri) h that is calculated, and will obtaini
Discrete logarithm puzzle as block i+1.Wherein αi-1Value can be obtained by the correctness of trapdoor discrete logarithm, the process be easy
It derives.It also include that the pointer of a upper block, the cryptographic Hash of block, timestamp, random number and Merkel breathe out in block head
Coefficient root node etc..
Further, verifying described in step C includes: that federation node first verifies that the area Shang Yige that current block is included
The discrete logarithm puzzle h of blocki-1Solution αi-1Whether meetPass through verifying h againi=H1(Ri) whether sentence at Rob Roy
Disconnected current block puzzle hiWhether properly generate, if above-mentioned equation is set up, be verified, proparea is worked as in federation node confirmation
Block is correct block, otherwise authentication failed.
Specifically, step D includes: to be added one in the block head of block in block chain by step C by (αi-1, hi)
The discrete logarithm puzzle of composition calculates the discrete logarithm puzzle h of a upper block by trapdoor Tdi-1Solution αi-1, makeThen by the α of solutioni-1It is recorded in block.αi-1Value can be obtained by the correctness of trapdoor discrete logarithm, should
Process is easy to derive.
Beneficial effect the present invention is based on the construction method of alliance's chain of discrete logarithm includes:
(1) it realizes alliance's chain node and the efficient verification and confirmation of block is appointed due to the dyscalculia of discrete logarithm
What non-federation node effectively can not launch a offensive to block chain and (such as dig mine selfish-mining privately), and federation node
Block record and confirmation (can be derived by by the correctness of trapdoor discrete logarithm group) can efficiently be carried out.
(2) by introducing discrete logarithm puzzle, the safety of block chain is greatly improved, (such as due to conventional block chain
Bit coin network) the single anti-collision dependent on hash function and irreversible property, once hash function is broken (such as
SHA-1), block chain faces the danger being broken, when additional introducing discrete logarithm is as mathematical difficulties problem, to a certain extent
Eliminate the single security risk that block chain is faced.
(3) extendable discrete logarithm common recognition is realized, it is real by the way that a discrete logarithm puzzle additionally is added to block head
Having showed can be fast since the grasp of alliance's chain has discrete logarithm trapdoor to the security upgrade of alliance's chain from publicly-owned chain to block chain
Speed calculating and verify discrete logarithm；On the contrary, alliance's chain can be converted to publicly-owned chain if the trapdoor disclosed,
I.e. all nodes can fair and efficient confirmation block.It is achieved that a kind of simply and extendable based on discrete logarithm
Block chain common recognition.
Specific embodiment with reference to embodiments is described in further detail above content of the invention again.
But the range that this should not be interpreted as to the above-mentioned theme of the present invention is only limitted to example below.Think not departing from the above-mentioned technology of the present invention
In the case of thinking, the various replacements or change made according to ordinary skill knowledge and customary means should all be included in this hair
In bright range.
Detailed description of the invention
Fig. 1 is that the present invention is based on the flow charts of the construction method of alliance's chain of discrete logarithm.
Fig. 2 is the structural block diagram of alliance's chain of Fig. 1 building.
Specific embodiment
The present invention is based on the construction methods of alliance's chain of discrete logarithm as depicted in figs. 1 and 2, comprising:
A. it initializes trapdoor discrete logarithm group: according to security parameter λ, generating the multiplicative group G, the multiplicative group G of a q rank
Generation member be g, and generates the trapdoor Td for calculating discrete logarithm, parameter corresponding to formation discrete logarithm group (G, q, g,
Td).Pass through gαThe solution α of discrete logarithm is calculated in=h, wherein h ∈ G, is an element on multiplicative group G.
B. initialize alliance's chain: generating the original block (Genesis Block) of alliance's chain, and will open parameter P=(G,
Q, g, H1) the write-in original block, wherein the first hash function H1Are as follows: H1: { 0,1 }*Then → G specifies a collection of alliance's section
Point, and each federation node is sent by the trapdoor Td.
C. alliance's chain based on discrete logarithm block verifying: in block chain in the block head of block be added one by
(αi-1, hi) composition discrete logarithm puzzle, wherein αi-1It is the discrete logarithm puzzle h for meeting a blocki-1Solution, makeI is the mark of current block, and i-1 is the mark of the previous block of current block, hiFor current block from
Dissipate logarithm puzzle, hiIt is according to the principle of Merkel's Hash tree, using each of current block i Transaction Information as one
A leaf node carries out Hash calculation two-by-two, finally obtains root node Ri, then by hi=H1(ruleri) h that is calculated, and will obtaini
Discrete logarithm puzzle as block i+1.αi-1Value can be obtained by the correctness of trapdoor discrete logarithm, the process be easy derive.
It also include that the pointer of a upper block, the cryptographic Hash of block, timestamp, random number and Merkel breathe out coefficient root in block head
Node etc..
Then each federation node is included self information and discrete logarithm puzzle to block to each block of generation
Verifying: federation node first verifies that the discrete logarithm puzzle h for the upper block that current block is includedi-1Solution αi-1It is whether full
FootPass through verifying h againi=H1(Ri) whether at Rob Roy judge current block puzzle hiWhether properly generate, if
Above-mentioned equation is set up, then is verified, and federation node confirms that current block is correct block, otherwise authentication failed.Pass through
The block of verifying is correct block.
D. the block of alliance's chain based on discrete logarithm records: each federation node is to the Transaction Information generated in current network
Packing verifying is carried out, and is recorded in the block being verified through step C, the area of step C block in block chain is then passed through
One is added in build by (αi-1, hi) composition discrete logarithm puzzle, the discrete logarithm of a upper block is calculated by trapdoor Td
Puzzle hi-1Solution αi-1, makeThen by the α of solutioni-1Be recorded in block, for other nodes to block into
Row verifying.αi-1Value can be obtained by the correctness of trapdoor discrete logarithm, the process be easy derive.
The rapid solving to discrete logarithm is assisted by introducing trapdoor discrete logarithm group, and realizing block chain can
It is flexibly converted between publicly-owned chain and alliance's chain, it is thus achieved that a kind of simple and extendable block based on discrete logarithm
Chain common recognition.On trapdoor discrete logarithm group, any grasp has the people of the trapdoor of this group that can efficiently calculate discrete logarithm, and
For the people that other do not grasp trapdoor, discrete logarithm can not be calculated, alliance's chain is thus greatly improved
Safety.
Claims (5)
1. the construction method of alliance's chain based on discrete logarithm, feature include:
A. initialize trapdoor discrete logarithm group: according to security parameter λ, generate parameter corresponding to discrete logarithm group (G, q, g,
Td), wherein G is the multiplicative group of q rank, and generating member is g, and Td is the trapdoor of discrete logarithm group；
B. it initializes alliance's chain: generating the original block of alliance's chain, and will open parameter P=(G, q, g, H1) write-in it is described just
Beginning block, wherein the first hash function H1Are as follows: H1:{0,1}*→ G, then specifies a collection of federation node, and by the trapdoor Td
It is sent to each federation node；
C. the block verifying of alliance's chain based on discrete logarithm: each federation node carries out including pair to each block of generation
The verifying of the self information and discrete logarithm puzzle of block, the block by verifying are correct block；
D. the block of alliance's chain based on discrete logarithm records: each federation node carries out the Transaction Information generated in current network
It is packaged verifying, and is recorded in the block being verified through step C, then generates a discrete logarithm puzzle, and using sunken
Door Td solves the discrete logarithm puzzle of a upper block, and the result of solution is recorded in block, is used for other nodes
Block is verified.
2. the construction method of alliance's chain based on discrete logarithm as described in claim 1, it is characterized in that: step A includes: basis
Security parameter λ, the generation member for generating the multiplicative group G, the multiplicative group G of a q rank is g, and is generated for calculating discrete logarithm
Trapdoor Td, pass through gαThe solution α of discrete logarithm is calculated in=h, wherein h ∈ G, is an element on multiplicative group G.
3. the construction method of alliance's chain based on discrete logarithm as described in claim 1, it is characterized in that: described in step C from
Dissipate logarithm puzzle are as follows: be added one in the block head of block in block chain by (αi-1,hi) composition discrete logarithm puzzle,
Middle αi-1It is the discrete logarithm puzzle h for meeting a blocki-1Solution, makeI is the mark of current block, i-
1 is the mark of the previous block of current block, hiFor the discrete logarithm puzzle of current block, hiIt is according to Merkel's Hash tree
Principle carry out Hash calculation two-by-two, finally using each of current block i Transaction Information as a leaf node
Obtain root node Ri, then by hi=H1(Ri) h that is calculated, and will obtainiDiscrete logarithm puzzle as block i+1.
4. the construction method of alliance's chain based on discrete logarithm as claimed in claim 3, it is characterized in that: it is tested described in step C
Card includes: the discrete logarithm puzzle h for the upper block that federation node first verifies that current block is includedi-1Solution αi-1Whether
MeetPass through verifying h againi=H1(Ri) whether at Rob Roy judge current block puzzle hiWhether properly generate, such as
The above-mentioned equation of fruit is set up, then is verified, and federation node confirms that current block is correct block, otherwise authentication failed.
5. the construction method of alliance's chain based on discrete logarithm as claimed in claim 4, it is characterized in that: step D includes: to pass through
Step C is added one by (α in block chain in the block head of blocki-1,hi) composition discrete logarithm puzzle, pass through trapdoor Td
Calculate the discrete logarithm puzzle h an of blocki-1Solution αi-1, makeThen by the α of solutioni-1Area is recorded
In block.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910777124.3A CN110460615B (en) | 2019-08-22 | 2019-08-22 | Discrete logarithm-based alliance chain construction method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910777124.3A CN110460615B (en) | 2019-08-22 | 2019-08-22 | Discrete logarithm-based alliance chain construction method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110460615A true CN110460615A (en) | 2019-11-15 |
| CN110460615B CN110460615B (en) | 2020-09-04 |
Family
ID=68488513
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910777124.3A Active CN110460615B (en) | 2019-08-22 | 2019-08-22 | Discrete logarithm-based alliance chain construction method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110460615B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107612934A (en) * | 2017-10-24 | 2018-01-19 | 济南浪潮高新科技投资发展有限公司 | A kind of block chain mobile terminal computing system and method based on Secret splitting |
| US20180198626A1 (en) * | 2015-02-27 | 2018-07-12 | Guardtime Ip Holdings Limited | Blockchain-supported, fail-safe synchronization in a data authentication infrastructure |
| CN109951279A (en) * | 2019-03-15 | 2019-06-28 | 南京邮电大学 | A kind of anonymous data storage method based on block chain and edge device |
| CN110061850A (en) * | 2019-04-24 | 2019-07-26 | 电子科技大学 | The collision calculation method and editable block chain building method of chameleon hash function |
-
2019
- 2019-08-22 CN CN201910777124.3A patent/CN110460615B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180198626A1 (en) * | 2015-02-27 | 2018-07-12 | Guardtime Ip Holdings Limited | Blockchain-supported, fail-safe synchronization in a data authentication infrastructure |
| CN107612934A (en) * | 2017-10-24 | 2018-01-19 | 济南浪潮高新科技投资发展有限公司 | A kind of block chain mobile terminal computing system and method based on Secret splitting |
| CN109951279A (en) * | 2019-03-15 | 2019-06-28 | 南京邮电大学 | A kind of anonymous data storage method based on block chain and edge device |
| CN110061850A (en) * | 2019-04-24 | 2019-07-26 | 电子科技大学 | The collision calculation method and editable block chain building method of chameleon hash function |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110460615B (en) | 2020-09-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Narayanan et al. | Bitcoin and cryptocurrency technologies: a comprehensive introduction | |
| Young et al. | Malicious cryptography: Exposing cryptovirology | |
| CN110138561A (en) | Efficient cipher text retrieval method, the cloud computing service system automatically corrected based on CP-ABE | |
| CN104392534B (en) | Electronic voting method and device based on finger vein feature recognition | |
| CN109710691A (en) | A kind of mixing block chain model construction method based on deep learning | |
| CN107819571A (en) | The generation method and device of private key | |
| CN110557276A (en) | Block chain computer room management system based on Fabric architecture | |
| US11627125B1 (en) | Apparatus and methods for credentialing users across user devices | |
| Engelmann et al. | Zswap: zk-SNARK based non-interactive multi-asset swaps | |
| Eve | Password | |
| CN110460615A (en) | The construction method of alliance's chain based on discrete logarithm | |
| US11907874B2 (en) | Apparatus and method for generation an action validation protocol | |
| Priya et al. | Secure framework for cloud based E-Education using deep neural networks | |
| Zhu et al. | An efficient biometric authenticated protocol for arbitrary-domain-server with blockchain technology | |
| US11915327B2 (en) | Time-based leaderboard display on social media network | |
| CN109948372A (en) | A kind of cloud storage medium-long range data of Designated-Verifier hold verification method | |
| CN109672535A (en) | Alliance's chain signature generating method and device | |
| Fisch et al. | Towards robust and efficient continual language learning | |
| Dong et al. | Defending Against Malicious Behaviors in Federated Learning with Blockchain | |
| KR20190119911A (en) | Ticket Selling System Based on Blockchain | |
| CN107231369A (en) | A kind of efficient data processing method based on cloud computing | |
| David et al. | 21-bringing down the complexity: fast composable protocols for card games without secret state | |
| Bader et al. | Design of a 3D Virtual World to Implement a Logical Access Control Mechanism Based on Fingerprints | |
| CN112003692A (en) | Multi-user cloud data integrity protection method based on block chain | |
| Perez et al. | Suitability of iot to blockchain network based on consensus algorithm |
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 |