CN110336673A - A kind of block chain design method based on secret protection - Google Patents
A kind of block chain design method based on secret protection Download PDFInfo
- Publication number
- CN110336673A CN110336673A CN201910475375.6A CN201910475375A CN110336673A CN 110336673 A CN110336673 A CN 110336673A CN 201910475375 A CN201910475375 A CN 201910475375A CN 110336673 A CN110336673 A CN 110336673A
- Authority
- CN
- China
- Prior art keywords
- node
- signature
- catenary system
- elliptic curve
- public key
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- 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/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
-
- 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/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
-
- 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
- H04L9/3252—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 using DSA or related signature schemes, e.g. elliptic based signatures, ElGamal or Schnorr schemes
Abstract
The block chain design method based on secret protection that the invention discloses a kind of.It comprises the concrete steps that: the node R in block catenary systemiUtilize the private key k of oneselfiTo information miHash functional value signature, while by information miIt is divided into l parts, is encrypted respectively with the public key of l different nodes, and l ciphertext is sent respectively to l node;Other nodes in system utilize node RiPublic key KiTo RiIdentity and miHash value verified;When arbitration organ needs to miWhen being verified, the ciphertext respectively received is decrypted respectively using respective private key by the l node chosen, and obtained plaintext is issued into arbitration organ, arbitration organ utilizes Hash function verifying signing messages m after summarizingi.Compared with prior art; in the present invention while guaranteeing that node can not be forged, non-repudiation is traded using ellipse curve signature algorithm; guarantee that the Transaction Information of node is not obtained by other nodes using ellipse curve encryption and decryption algorithm and Hash function, to protect its privacy.
Description
Technical field
The invention belongs to field of information security technology, are related to cryptography and block chain interleaving techniques, specifically relate to one
Kind is for the nodal information method for secret protection in block catenary system.
Background technique
Block chain is the novel of the computer technologies such as Distributed Storage, point-to-point transmission, common recognition mechanism, Encryption Algorithm
Application model, it is substantially the database of a decentralization.As the Floor layer Technology of bit coin, block chain is a string of uses
Cryptography method is associated the data block generated, contains the information of a batch bit coin network trading in each data block,
For verifying the validity (anti-fake) of its information and generating next block.Transaction record is by being distributed in difference in block catenary system
Multiple nodes in place are completed jointly, and what each node recorded is complete account, therefore they can be participated in
Supervision transaction legitimacy, while can also testify jointly for it.Can be controlled in this way to avoid single node or by bribery and
A possibility that remembering false account.Also due to accounting nodes are enough, theoretically except not all node is destroyed, otherwise account is not just
It can lose, to ensure that the safety of account data.
The secret protection to node Transaction Information is difficult to realize in common block catenary system, because All Activity needs
All nodes are disclosed, to avoid note false account the case where.For this problem, the present invention designs a kind of area based on secret protection
Block chain design method, while guaranteeing that node can not be forged, non-repudiation is traded using ellipse curve signature algorithm, utilization is ellipse
Circular curve enciphering and deciphering algorithm and Hash function guarantee that the Transaction Information of node is not obtained by other nodes, so that its privacy be protected to believe
Breath.
Summary of the invention
The purpose of the present invention is in view of the defects existing in the prior art, propose a kind of block chain with privacy protection function
Design method.
In order to achieve the above objectives, the present invention is realised by adopting the following technical scheme.
A kind of block chain design method based on secret protection, includes the following steps:
1, determine that the equation of elliptic curve E is y by block catenary system first2=x3+ ax+b, elliptic curve basic point G, it is oval
Curve order is n, and these parameters is informed each node in block catenary system;
2, each node in block catenary system determines the private key k of oneselfi, calculate public key Ki=kiG, and by public key KiIt accuses
Know other nodes in block catenary system;
3, node RiUtilize private key kiTo information miHash functional value eiIt signs, wherein ei=h (mi), h () is Hash letter
Number operation;
4、RiBy miL parts are randomly divided into, m is obtainedi1,mi2,……,mil, mi1+mi2+……+mil=mi, RiFrom block linkwork
L node R is randomly selected in system1,R2,……,Rl, respectively with the public key K of each node1,K2,……,KlTo mi1,
mi2,……,milEncryption, obtains ciphertext (C11,C21),(C12,C22),……,(C1l,C2l);RiSignature is sent to block linkwork
Each node in system, by ciphertext (C11,C21),(C12,C22),……,(C1l,C2l) it is sent respectively to node R1,R2,……,Rl;
5, other nodes in block catenary system utilize RiPublic key KiWith signature (t, si, ei) verifying node RiIdentity and
The Hash functional value e of signing messagesi, it is proved to be successful then each nodes records corresponding information, verifying is unsuccessful, does not record corresponding letter
Breath;
6, in the case where being proved to be successful, when arbitration organ A needs to verify signing messages miWhen, then by node R1,
R2,……,RlFirst respectively with the private key k of oneself1,k2,……,klTo ciphertext (C11,C21),(C12,C22),……,(C1l,C2l)
Decryption, then the plaintext m that will be obtained respectivelyi1,mi2,……,milIt is sent to A, A verifies h (mi1+mi2+……+mil)=eiWhether at
It is vertical, set up then miIt is proved to be successful.
It is further preferred that the particular content and method of signature described in step 3 are as follows:
RiChoose a random numberCalculate riG=(xi, yi), t=xiModn is selected again if t=0
Take ri, calculate ri -1Modn, si=ri -1[h(ei)+kiT] modn, obtain (t, si, ei) it is RiSignature.
It is further preferred that the particular content and method of encryption described in step 4 are as follows:
RiIt will be to sending point RjPlaintext mijWhen,A random number is chosen first
And by plaintext m to be transmittedijIt is encoded to the upper point M of elliptic curve Eij, carried out according still further to following formula using elliptic curve
Computations:
C1j=qjG
C2j=qjKj+Mij
Obtain ciphertext (C1j,C2j), wherein KjFor node RjPublic key.
It is further preferred that the particular content and method of signature verification described in step 5 are as follows:
Calculate w=si -1Modn, u1=h (ei) wmodn, u2=twmodn, u1G+u2Ki=(x0,y0), v=x0Modn, such as
Fruit v=t then signs effectively, is proved to be successful, and otherwise signature is invalid, verifies unsuccessful.
It is further preferred that in the particular content and method of decryption described in step 6, node RjUtilize the private key k of oneselfj
Calculating is decrypted using elliptic curve according to following formula:
Cj=kjC1j=kj(qjG)=qjKj
C2j- Cj=qjKj+Mij- qiKj=Mij
Gray code obtains plaintext m againij。
Each node is verifying some node R in the present inventioniIdentity and when signing messages, be not directly to signing messages
miIt is verified, but verifies its Hash functional value ei, each node cannot obtain miValue.It meets in block catenary system in this way
Authentication and anti-fake demand, in turn ensure the privacy of node signing messages.By R in block catenary systemiThe l selected at random
A node can decrypt m respectivelyiPartial information, when there is arbitration organ to need to verify signing messages miWhen, the l node
The partial information respectively decrypted is sent to arbitration structure and summarizes verifying.In this way in protection RiSigning messages privacy it is same
When, further ensuring it can not forge and deny.
Detailed description of the invention
Fig. 1 is the block chain design method flow chart of the invention based on secret protection.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is described in further detail.It should be appreciated that specific embodiment described herein is used only for explaining the present invention,
It is not intended to limit the present invention.
As shown in Figure 1, being a kind of block chain design method based on secret protection of the invention, particular content and step are such as
Under:
(1) determine that the equation of elliptic curve E is y by block catenary system first2=x3+ ax+b, elliptic curve basic point G, it is oval
Curve order is n, and these parameters is informed each node in block catenary system;
(2) each node in block catenary system determines the private key k of oneselfi, calculate public key Ki=kiG, and by public key KiIt accuses
Know other nodes in block catenary system;
(3) work as node RiIt needs to information miWhen being signed, RiChoose a random numberCalculate riG=
(xi, yi), t=xiModn chooses r if t=0 againi, calculate ri -1Modn calculates si=ri -1[h(ei)+kiT] modn,
Wherein ei=h (mi), h () is Hash functional operation, (t, si, ei) it is RiSignature;
(4)RiBy miL parts are randomly divided into, m is obtainedi1,mi2,……,mil, mi1+mi2+……+mil=mi, RiFrom block chain
L node R is randomly selected in system1,R2,……,Rl, respectively with the public key K of each node1,K2,……,KlTo mi1,
mi2,……,milEncryption;
R when encryptioniA random number is chosen firstAnd by plaintext to be transmitted
mijIt is encoded to the upper point M of elliptic curve Eij, computations are carried out using elliptic curve according still further to following formula:
C1j=qjG
C2j=qjKj+Mij
Obtain ciphertext (C1j,C2j), wherein KjFor node RjPublic key, further obtain all ciphertext (C11,C21),
(C12,C22),……,(C1l,C2l);
(5)RiEach node that signature is sent in block catenary system, by ciphertext (C11,C21),(C12,C22),……,
(C1l,C2l) it is sent respectively to node R1,R2,……,Rl;
(6) other nodes in block catenary system utilize RiPublic key KiWith signature (t, si, ei) verifying node RiIdentity
With the Hash functional value e of signing messagesi, calculate w=si -1Modn, u1=h (ei) wmodn, u2=twmodn, u1G+u2Ki=(x0,
y0), v=x0Modn signs effectively if v=t, is proved to be successful, each nodes records corresponding information, and signature is then verified not in vain
Success, does not record corresponding information;
(7) in the case where being proved to be successful when arbitration organ A needs to verify signing messages miWhen, then by node R1,
R2,……,RlFirst respectively with the private key k of oneself1,k2,……,klTo ciphertext (C11,C21),(C12,C22),……,(C1l,C2l)
Decryption;
Node R when decryptionjUtilize the private key k of oneselfjCalculating is decrypted using elliptic curve according to following formula:
Cj=kjC1j=kj(qjG)=qjKj
C2j- Cj=qjKj+Mij- qiKj=Mij
Gray code obtains plaintext m againij;
Node R1,R2,……,RlThe plaintext m that will be obtained respectively againi1,mi2,……,milIt is sent to A;
(8) A verifies h (mi1+mi2+……+mil)=eiIt is whether true, set up then miIt is proved to be successful.
The foregoing is intended to be a preferred embodiment of the present invention.Certainly, the present invention can also have other a variety of implementations
Example, without deviating from the spirit and substance of the present invention, anyone skilled in the art, when can according to this
Various corresponding equivalent change and modification are made in invention, all should fall within the scope of protection of the appended claims of the present invention.
Claims (5)
1. a kind of block chain design method based on secret protection, for realizing Based on Elliptic Curve Cryptosystem and Hash letter is based on
Number, which is characterized in that comprise the steps of:
(1) determine that the equation of elliptic curve E is y by block catenary system2=x3+ ax+b, elliptic curve basic point G, elliptic curve order
For n, and these parameters are informed into each node in block catenary system;
(2) each node in block catenary system determines the private key k of oneselfi, calculate public key Ki=kiG, and by public key KiInform area
Other nodes in block catenary system;
(3) node RiUtilize private key kiTo information miHash functional value eiIt signs, wherein ei=h (mi), h () is Hash function
Operation;
(4)RiBy miL parts are randomly divided into, m is obtainedi1,mi2,……,mil, mi1+mi2+……+mil=mi, RiFrom block catenary system
Randomly select l node R1,R2,……,Rl, respectively with the public key K of each node1,K2,……,KlTo mi1,mi2,……,mil
Encryption, obtains ciphertext (C11,C21),(C12,C22),……,(C1l,C2l);RiEach section that signature is sent in block catenary system
Point, by ciphertext (C11,C21),(C12,C22),……,(C1l,C2l) it is sent respectively to node R1,R2,……,Rl;
(5) other nodes in block catenary system utilize RiPublic key KiWith signature (t, si, ei) verifying node RiIdentity and label
The Hash functional value e of name informationi, it is proved to be successful then each nodes records corresponding information, verifying is unsuccessful, does not record corresponding information;
(6) in the case where being proved to be successful, when arbitration organ A needs to verify signing messages miWhen, then by node R1,R2,……,Rl
First respectively with the private key k of oneself1,k2,……,klTo ciphertext (C11,C21),(C12,C22),……,(C1l,C2l) decryption, then divide
The plaintext m that will not obtaini1,mi2,……,milIt is sent to A, A verifies h (mi1+mi2+……+mil)=eiIt is whether true, it sets up then
miIt is proved to be successful.
2. a kind of block chain design method based on secret protection according to claim 1, which is characterized in that step (3)
Described in signature content and method it is as follows:
RiChoose a random numberCalculate riG=(xi, yi), t=xiModn works as t=0, then chooses r againi,
Calculate ri -1Modn, si=ri -1[h(ei)+kiT] modn, obtain (t, si, ei) it is RiSignature.
3. a kind of block chain design method based on secret protection according to claim 1, which is characterized in that step (4)
Described in encryption content and method it is as follows:
RiIt will be to sending point RjPlaintext mijWhen,First choose a random numberAnd it will be to
The plaintext m of transmissionijIt is encoded to the upper point M of elliptic curve Eij, encryption meter is carried out using elliptic curve according still further to following formula
It calculates:
C1j=qjG
C2j=qjKj+Mij
Obtain ciphertext (C1j,C2j), wherein KjFor node RjPublic key.
4. a kind of block chain design method based on secret protection according to claim 1, it is characterised in that in step (5)
The content and method of the signature verification are as follows:
Calculate w=si -1Modn, u1=h (ei) wmodn, u2=twmodn, u1G+u2Ki=(x0,y0), v=x0Modn works as v=t
Then signature effectively, is proved to be successful, and otherwise signature is invalid, is verified unsuccessful.
5. a kind of block chain design method based on secret protection according to claim 1, it is characterised in that in step (6)
In the content and method of the decryption, node RjUtilize the private key k of oneselfjIt is carried out according to following formula using elliptic curve
Decryption calculates:
Cj=kjC1j=kj(qjG)=qjKj
C2j- Cj=qjKj+Mij- qiKj=Mij
Gray code obtains plaintext m againij。
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910475375.6A CN110336673B (en) | 2019-06-03 | 2019-06-03 | Block chain design method based on privacy protection |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910475375.6A CN110336673B (en) | 2019-06-03 | 2019-06-03 | Block chain design method based on privacy protection |
Publications (2)
Publication Number | Publication Date |
---|---|
CN110336673A true CN110336673A (en) | 2019-10-15 |
CN110336673B CN110336673B (en) | 2022-03-08 |
Family
ID=68140581
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910475375.6A Active CN110336673B (en) | 2019-06-03 | 2019-06-03 | Block chain design method based on privacy protection |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110336673B (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110535916A (en) * | 2019-08-09 | 2019-12-03 | 江苏科技大学 | A kind of supply guarantee management method based on block chain |
CN111080296A (en) * | 2019-12-05 | 2020-04-28 | 深圳前海微众银行股份有限公司 | Verification method and device based on block chain system |
CN111738726A (en) * | 2020-08-04 | 2020-10-02 | 卓尔智联(武汉)研究院有限公司 | Resource verification method and device based on block chain and computer equipment |
WO2022068362A1 (en) * | 2020-09-29 | 2022-04-07 | 深圳壹账通智能科技有限公司 | Block chain-based information processing method and apparatus, device, and medium |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6219423B1 (en) * | 1995-12-29 | 2001-04-17 | Intel Corporation | System and method for digitally signing a digital agreement between remotely located nodes |
CN107301521A (en) * | 2017-06-26 | 2017-10-27 | 深圳前海华深安信物联技术有限公司 | Strengthen the method for warehouse receipt transaction security in a kind of warehouse receipt system based on block chain |
CN109493053A (en) * | 2018-11-22 | 2019-03-19 | 质数链网科技成都有限公司 | A kind of anonymous deal method for alliance's block catenary system |
CN109587132A (en) * | 2018-11-29 | 2019-04-05 | 苏宁易购集团股份有限公司 | A kind of data transferring method and device based on alliance's chain |
CN110603783A (en) * | 2017-05-05 | 2019-12-20 | 区块链控股有限公司 | Secure dynamic threshold signature scheme using trusted hardware |
-
2019
- 2019-06-03 CN CN201910475375.6A patent/CN110336673B/en active Active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6219423B1 (en) * | 1995-12-29 | 2001-04-17 | Intel Corporation | System and method for digitally signing a digital agreement between remotely located nodes |
CN110603783A (en) * | 2017-05-05 | 2019-12-20 | 区块链控股有限公司 | Secure dynamic threshold signature scheme using trusted hardware |
CN107301521A (en) * | 2017-06-26 | 2017-10-27 | 深圳前海华深安信物联技术有限公司 | Strengthen the method for warehouse receipt transaction security in a kind of warehouse receipt system based on block chain |
CN109493053A (en) * | 2018-11-22 | 2019-03-19 | 质数链网科技成都有限公司 | A kind of anonymous deal method for alliance's block catenary system |
CN109587132A (en) * | 2018-11-29 | 2019-04-05 | 苏宁易购集团股份有限公司 | A kind of data transferring method and device based on alliance's chain |
Non-Patent Citations (1)
Title |
---|
QIAO KANG.ET: "Blockchain Privacy Protection Scheme Based on Aggregate Signature", 《 2019 IEEE 4TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND BIG DATA ANALYSIS (ICCCBDA)》 * |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110535916A (en) * | 2019-08-09 | 2019-12-03 | 江苏科技大学 | A kind of supply guarantee management method based on block chain |
CN110535916B (en) * | 2019-08-09 | 2022-04-15 | 江苏科技大学 | Supply guarantee management method based on block chain |
CN111080296A (en) * | 2019-12-05 | 2020-04-28 | 深圳前海微众银行股份有限公司 | Verification method and device based on block chain system |
CN111080296B (en) * | 2019-12-05 | 2023-12-01 | 深圳前海微众银行股份有限公司 | Verification method and device based on blockchain system |
CN111738726A (en) * | 2020-08-04 | 2020-10-02 | 卓尔智联(武汉)研究院有限公司 | Resource verification method and device based on block chain and computer equipment |
CN111738726B (en) * | 2020-08-04 | 2020-11-20 | 卓尔智联(武汉)研究院有限公司 | Resource verification method and device based on block chain and computer equipment |
WO2022068362A1 (en) * | 2020-09-29 | 2022-04-07 | 深圳壹账通智能科技有限公司 | Block chain-based information processing method and apparatus, device, and medium |
Also Published As
Publication number | Publication date |
---|---|
CN110336673B (en) | 2022-03-08 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
AU2004288540B2 (en) | Portable security transaction protocol | |
US8526606B2 (en) | On-demand secure key generation in a vehicle-to-vehicle communication network | |
CN108768652B (en) | Coalition block chain bottom layer encryption method capable of resisting quantum attack | |
CN110336673A (en) | A kind of block chain design method based on secret protection | |
CN110060403B (en) | One-person multi-ticket electronic voting method and system based on block chain | |
CN1922816B (en) | One way authentication | |
US9438589B2 (en) | Binding a digital file to a person's identity using biometrics | |
US20120294442A1 (en) | Joint encryption of data | |
CN109918888B (en) | Anti-quantum certificate issuing method and issuing system based on public key pool | |
CN110830244B (en) | Anti-quantum computing Internet of vehicles method and system based on identity secret sharing and alliance chain | |
CN111163109B (en) | Block chain center-removing type node anti-counterfeiting method | |
US11165592B2 (en) | Systems and methods for a butterfly key exchange program | |
CN110138548B (en) | Quantum communication service station key negotiation method and system based on asymmetric key pool pair and DH protocol | |
Shim | Reconstruction of a secure authentication scheme for vehicular ad hoc networks using a binary authentication tree | |
CN111539718A (en) | Block chain cross-chain identity authentication method based on side chain | |
CN109687977A (en) | Anti- quantum calculation digital signature method and anti-quantum calculation digital signature system based on multiple pool of keys | |
CN108712259A (en) | Identity-based acts on behalf of the efficient auditing method of cloud storage for uploading data | |
CN111339509A (en) | Block chain cross-chain identity authentication method based on side chain | |
CN112437108A (en) | Decentralized identity authentication device and method for privacy protection of Internet of vehicles | |
CN113393225A (en) | Digital currency encryption payment method and system | |
CA2819211A1 (en) | Data encryption | |
CN110098925B (en) | Quantum communication service station key negotiation method and system based on asymmetric key pool pair and random number | |
CN1697376A (en) | Method and system for authenticating or enciphering data by using IC card | |
CN109784920B (en) | Transaction information auditing method and device based on blockchain | |
CN102857487A (en) | Method and system for remote tender invitation |
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 |