A session key negotiation method, data evidence storage method and device

Abstract

The present invention provides a session key negotiation method, a data evidence storage method and a device. The present invention designs a complete evidence storage process, from identity authentication, establishment of session keys, to data upload, organization verification, and finally storing the proof on the blockchain. In addition, this solution supports multiple witnesses, and can verify data with multiple witnesses and upload the proof data to the blockchain.

Description

Technical Field

[0001] The present application relates to the field of blockchain technology, and in particular to a method for negotiating a session key for multi-witness verification, a method for storing data, and a device. Background Art

[0002] In today's digital age, data is particularly important in any work, and the credibility of the data source needs to be guaranteed at any stage. The importance of evidence storage is becoming increasingly higher. The actual evidence storage process is that the user brings the materials required for evidence storage to the witness institution such as the court, police station, education bureau, etc. After the institution checks the materials and passes them, it will issue a certificate and upload it to the institution's system. With the development of the Internet, users can submit materials online and no longer need to bring the materials to the institution in person. Due to the traceability and unchangeable nature of blockchain, some people began to propose to save evidence on the blockchain and proposed a blockchain-based evidence storage solution.

[0003] However, due to the barriers between the various witnesses, the proof of one institution may not be applicable to other institutions. Therefore, the blockchain evidence storage solution for a single witness needs to be improved, which has become a technical problem that urgently needs to be solved. Summary of the invention

[0004] In order to solve the above technical problems, the present invention provides a session key negotiation method, evidence storage method and device for multi-witness verification, and designs a complete evidence storage process, from identity authentication, establishment of session keys, to data upload, organization verification, and finally storing the evidence on the blockchain. In addition, this solution supports the situation of multiple witnesses, and can verify data with multiple witnesses and upload the evidence data to the blockchain. The technical solution adopted by the present invention is as follows:

[0005] A method for negotiating a session key, the method being applied to a client A, a single witness W, and a blockchain server B, the method comprising the following steps:

[0006] Step 1: Client A and witness W negotiate to determine the session key Z AW ;

[0007] Step 2: Witness W and blockchain server B negotiate to determine session key Z WB ;

[0008] The client A and the witness W negotiate to determine the session key Z AW , on the client A side, includes the following sub-steps:

[0009] Step AW01: Use a random number generator to generate a random number from the positive integer space Z of order q. q Pick two random numbers r from A and kA , that is, satisfy r A ,k A ∈ R Z q ;

[0010] Step AW02: According to the random number r A To calculate the temporary public key

[0011] Step AW03: According to the random number r A and k A And the witness W's long-term public key y W To calculate

[0012] Step AW04: Use the normal channel to AW 、s AW Sent to the witness W;

[0013] Step AW05: Calculate session key

[0014] Among them, g is the generator of the cyclic subgroup of the finite field elliptic curve additive group;

[0015] The negotiation to determine the session key includes the following sub-steps on the witness W side:

[0016] Step WA01: Receive the t sent by client A from the common channel. AW 、s AW ;

[0017] Step WA02: According to the long-term private key x W To calculate the random number of client A

[0018] Step WA03: According to the calculated random number k A To calculate the session key

[0019] The negotiation determines the session key Z WB , on the witness W side, the following sub-steps are included:

[0020] Step WB01, from the positive integer space Z of order q q Pick two random numbers r from W and k W , that is, satisfy r W ,k W ∈ R Z q ;

[0021] Step WB02: According to the random number rW To calculate

[0022] Step WB03, Calculation

[0023] Step WB04: Use the normal channel to WB 、s WB Send to blockchain server B;

[0024] Step WB05: According to the random number k W and WB To calculate the session key

[0025] The witness W and the blockchain server B negotiate to determine the session key Z WB , on the blockchain server B side, the following sub-steps are included:

[0026] Step BW01: Receive t sent by witness W from the normal channel WB 、s WB ;

[0027] Step BW02: Based on the long-term private key x B To calculate random numbers

[0028] Step BW03: According to the random number k W Calculate the session key

[0029] A method for negotiating a session key, the method being applied to a client A and multiple witnesses W i , and a blockchain server B, wherein i is used to identify different witnesses, and the method comprises the following steps:

[0030] Step 1: Client A and Witness W i Negotiate and determine the session key

[0031] Step 2: Witness W i Negotiate with blockchain server B to determine the session key

[0032] Among them, the client A and the witness W i Negotiate and determine the session key The client A side includes the following sub-steps:

[0033] Step AW01: Use a random number generator to generate a random number from the positive integer space Z of order q. q Pick two random numbers r from A and k A , that is, satisfy rA ,k A ∈ R Z q ;

[0034] Step AW02: According to the random number r A To calculate the temporary public key

[0035] Step AW03: According to the random number r A and k A And the witness W i The long-term public key To calculate

[0036] Step AW04: Use the normal channel to Sent to the witness W i ;

[0037] Step AW05: Calculate session key

[0038] The negotiation determines the session key. i The side includes the following sub-steps:

[0039] Step WA01: Receive the data sent by client A from the common channel.

[0040] Step WA02: Based on the long-term private key To calculate the random number of client A

[0041] Step WA03: According to the calculated random number k A To calculate the session key

[0042] The negotiation determines the session key In the witness i The side includes the following sub-steps:

[0043] Step WB01, from the positive integer space Z of order q q Pick two random numbers from and Satisfaction

[0044] Step WB02: According to the random number To calculate

[0045] Step WB03, Calculation

[0046] Step WB04, use the normal channel Send to blockchain server B;

[0047] Step WB05: According to the random number and To calculate the session key

[0048] Among them, the witness W i Negotiate with blockchain server B to determine the session key The blockchain server B includes the following sub-steps:

[0049] Step BW01: Receive the data from the normal channel from the witness W i Sent

[0050] Step BW02: Based on the long-term private key x B To calculate random numbers

[0051] Step BW03: According to the random number Calculate the session key

[0052] A data storage method for single-witness single-phase evidence, the method comprising the following steps:

[0053] Step 0: The negotiation method used determines the session key Z AW , Z WB ;

[0054] Step 1: Client A uses session key Z AW Encrypt the evidence information that needs to be saved ED to generate Z AW (ED), and then perform hash function calculation on the evidence information ED to obtain H(ED), and convert Z AW (ED) and H(ED) are sent to the witness W;

[0055] Step 2: Witness W uses session key Z AW Decrypt Z AW (ED) to obtain evidence information ED, then calculate the hash function value of the evidence information ED, and compare the hash function value of the evidence information ED with the received H(ED). If the comparison result is different, then end; if the comparison result is the same, execute step 3;

[0056] Step 3: Witness W signs the evidence information ED to obtain the proof message ED1, and uses the hash function to generate H(ED1) and H(Z WB,H(ED),H(ED1)), then H(ED1) and H(Z WB ,H(ED),H(ED1)) is sent to blockchain server B;

[0057] Step 4: Blockchain server B sends H(ED1) and H(Z WB ,H(ED),H(ED1)) are stored on the blockchain.

[0058] A data storage method for multi-witness single-phase evidence, the method comprising the following steps:

[0059] Step 0: The negotiation method used to determine the session key

[0060] Step 1: Client A uses the session key Encrypt the evidence information that needs to be saved i generate Then the evidence information ED i Perform hash function calculation to obtain H(ED i ),Will and H(ED i ) is sent to the witness W i Among them, ED i For different witnesses i the evidence message generated;

[0061] Step 2: Witness W i Using Session Keys Decryption To obtain evidence information ED i , then calculate the evidence information ED i The hash function value of the evidence information ED i The hash function value of the received H(ED i ), if the comparison result is different, then end; if the comparison result is the same, then execute step 3;

[0062] Step 3: Witness W i Information on the evidence i Sign to obtain the proof message ED i 1. Use the hash function to generate H(ED i 1) and Then the data H(ED i 1) and Send to blockchain server B;

[0063] Step 4: Blockchain server B sends H(ED i ) as the respective indexes of the received data, and the data H(EDi 1) and Stored on the blockchain in association with the index.

[0064] A session key negotiation device, which is applied to a client A, a single witness W, and a blockchain server B, and includes a memory and a processor, wherein the memory stores one or more programs; when the one or more programs are executed by the processor, the processor implements the above method.

[0065] A session key negotiation device, the device is applied to a client A, multiple witnesses W i , and a blockchain server B, wherein i is used to identify different witnesses, the device includes a memory and a processor, the memory stores one or more programs; when the one or more programs are executed by the processor, the processor implements the above method.

[0066] A data storage device for single-witness single-phase evidence, the device comprising a memory and a processor, the memory storing one or more programs; when the one or more programs are executed by the processor, the processor implements the above method.

[0067] A data storage device for multi-witness single-phase evidence, the device comprising a memory and a processor, the memory storing one or more programs; when the one or more programs are executed by the processor, the processor implements the above method.

[0068] Through the embodiments of the present application, the following technical effects can be obtained: Compared with the existing blockchain evidence storage scheme, the present invention meets the situation where multiple witnesses are required to witness, and provides a complete scheme starting from the authentication stage, from session key establishment to evidence data upload, which ensures the security of the data transmission process. The scheme pre-shares the Diffie-Hellman value as a shared secret, only supports one-way authentication, uses the discrete logarithm problem, multiplication and division, and hash algorithm, and the client and blockchain server only need to perform 4 steps to achieve it. BRIEF DESCRIPTION OF THE DRAWINGS

[0069] In order to more clearly illustrate the technical solutions in the embodiments of the present application, a brief introduction will be given below to the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0070] Figure 1 This is a schematic diagram of the protocol flow for a single witness;

[0071] Figure 2 Schematic diagram of the protocol flow for multiple witnesses. DETAILED DESCRIPTION

[0072] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0073] The technical solution of the present invention is a multi-witness one-way evidence data storage protocol based on static Diffie-Hellman keys, including two stages: authentication key negotiation and evidence storage. The authentication key negotiation stage uses a shared long-term key as the trust basis, and a new temporary key is generated for each communication to generate the final session key to meet security requirements. The scheme only needs to perform 4 steps on the A side (client) and the B side (blockchain server), and supports one-way authentication by using the pre-shared Diffie-Hellman value as a shared secret, using the discrete logarithm problem, multiplication and division, and hash algorithm.

[0074] Before describing the technical solution of the present invention in detail, the terminology used in the present invention is first introduced as follows:

[0075] A stands for client

[0076] B represents the blockchain server

[0077] W stands for Witness

[0078] r A 、r W Represents a random number

[0079] k A , k W Represents the random number of client A and the random number of witness W respectively

[0080] t AW Represents the temporary public key between client A and witness W

[0081] t WB Represents the temporary public key between the witness W and the blockchain server B

[0082] x W Represents the long-term private key of the witness W

[0083] y W Represents the long-term public key of the witness W

[0084] x B Represents the long-term private key of blockchain server B

[0085] y B Represents the long-term public key of blockchain server B

[0086] s AW Indicated by y W 、r A , k A Calculated value

[0087] s WB Indicated by y B 、r W , k W Calculated value

[0088] ED stands for evidence data

[0089] W i represents the i-th witness

[0090] g represents the generator of the cyclic subgroup of the additive group of finite field elliptic curves

[0091] In the protocol scenario of the present invention, there are multiple witnesses W, each of which has relevant basic parameters, and the communication process from client A to each witness W and then to blockchain server B is similar. W 、r A , k A The calculated value S AW The static Diffie-Hellman value pre-shared by client A and witness W is y B 、r W , k W The calculated value S WB It is the static Diffie-Hellman value pre-shared by the witness W and the blockchain server B. The protocol flow of a single witness is as follows:

[0092] Figure 1 The following is a protocol flow diagram for a single witness. Before the evidence data storage begins, the data that the client A, witness W, and blockchain server B need to prepare are as follows:

[0093] Original data at client A: y W , S AW

[0094] Witness W’s original data: y W ,y B , S AW , S WB

[0095] Original data of blockchain server B: yB , S BW

[0096] The evidence storage process of the present invention includes two stages, the first stage is the authentication key negotiation stage, and the second stage is the evidence storage stage. The two stages will be introduced separately below.

[0097] 1. Authentication key negotiation phase:

[0098] First, client A negotiates the session key with witness W;

[0099] (1) Client A:

[0100] Step AW01: Client A uses a random number generator to generate a random number from a positive integer space Z of order q. q Pick two random numbers r from A and k A , that is, satisfy r A ,k A ∈ R Z q ;

[0101] Step AW02: Client A generates a random number r. A To calculate the temporary public key

[0102] Step AW03: Client A generates a random number r. A and k A And the witness W's long-term public key y W To calculate

[0103] Step AW04: Client A uses a common channel to AW 、s AW Sent to the witness W

[0104] Step AW05: Client A calculates the session key

[0105] (2) Witness W:

[0106] Step WA01: Witness W receives the t sent by client A through the common channel. AW 、s AW ;

[0107] Step WA02: Witness W uses the long-term private key x W To calculate the random number of client A

[0108] Step WA03: Witness W calculates the random number k A To calculate the session key

[0109] Then, the witness W negotiates the session key with the blockchain server B;

[0110] (1) Witness W:

[0111] Step WB01: Witness W from the positive integer space Z of order q q Pick two random numbers r from W and k W , that is, satisfy r W ,k W ∈ R Z q ;

[0112] Step WB02: Witness W uses the random number r W To calculate

[0113] Step WB03: Witness W calculates

[0114] Step WB04: Witness W uses a common channel to WB 、s WB Send to blockchain server B;

[0115] Step WB05: Witness W uses the random number k W and WB To calculate the session key

[0116] (2) Blockchain server B:

[0117] Step BW01: Blockchain server B receives t sent by witness W from the common channel. WB 、s WB ;

[0118] Step BW02, blockchain server B uses the long-term private key x B To calculate random numbers

[0119] Step BW03, blockchain server B calculates the random number k W Calculate the session key

[0120] 2. Evidence storage stage:

[0121] Step 1: Client A uses session key Z AW Encrypt the evidence information that needs to be saved ED to generate Z AW (ED), and then perform hash function calculation on the evidence information ED to obtain H(ED), and convert Z AW(ED) and H(ED) are sent to the witness W;

[0122] Step 2: Witness W uses session key Z AW Decrypt Z AW (ED) to obtain evidence information ED, then calculate the hash function value of the evidence information ED, and compare the hash function value of the evidence information ED with the received H(ED). If the comparison result is different, then end; if the comparison result is the same, execute step 3;

[0123] Step 3: Witness W signs the evidence information ED to obtain the proof message ED1, and uses the hash function to generate H(ED1) and H(Z WB ,H(ED),H(ED1)), then H(ED1) and H(Z WB ,H(ED),H(ED1)) is sent to blockchain server B;

[0124] Step 4: Blockchain server B sends H(ED1) and H(Z WB ,H(ED),H(ED1)) are stored on the blockchain.

[0125] Figure 2 The protocol flow diagram of multiple witnesses is shown in Figure 2. When communicating with multiple witnesses, client A communicates with different witnesses W. i Establishing a session key Multiple witnesses W i Then establish a session key with blockchain server B Among them ED i For different witnesses i The evidence message generated.

[0126] After the data of different witnesses arrive at the blockchain, they all have H(Z WB ,H(ED),H(ED1)), can form a reference to each other and use a unified ID as the index. Blockchain server B will H(ED i ) as the respective indexes of the received data, and the data H(ED i 1) and The hash function used in the above technical solution can be SHA-256 or SHA-512.

[0127] In some embodiments, part or all of the computer program may be loaded and / or installed on the device via the ROM.When the computer program is loaded and executed, one or more steps of the method described above may be performed.

[0128] The functions described above in the present application may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chip systems (SOCs), load programmable logic devices (CPLDs), and the like.

[0129] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0130] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0131] In addition, although each operation is described in a specific order, this should be understood as requiring such operation to be performed in the specific order shown or in a sequential order, or requiring that all illustrated operations should be performed to obtain desired results. Under certain circumstances, multitasking and parallel processing may be advantageous. Similarly, although some specific implementation details are included in the above discussion, these should not be interpreted as limiting the scope of the present disclosure. Some features described in the context of a separate embodiment can also be implemented in a single implementation in combination. On the contrary, the various features described in the context of a single implementation can also be implemented in multiple implementations individually or in any suitable sub-combination mode.

[0132] Although the subject matter has been described in language specific to structural features and / or methodological logical actions, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. On the contrary, the specific features and actions described above are merely example forms of implementing the claims.

Claims

1. A session key negotiation method, the method is applied to a client A, a single witness W, and a blockchain server B, characterized in that: The method comprises the following steps: Step 1: Client A and witness W negotiate to determine the session key Z AW ; Step 2: Witness W and blockchain server B negotiate to determine session key Z WB ; The client A and the witness W negotiate to determine the session key Z AW , on the client A side, includes the following sub-steps: Step AW01: Use a random number generator to generate a random number from the positive integer space Z of order q. q Pick two random numbers r from A and k A , that is, satisfy r A ,k A ∈ R Z q ; Step AW02: According to the random number A To calculate the temporary public key Step AW03: According to the random number r A and k A And the witness W's long-term public key y W To calculate Step AW04: Use the normal channel to AW 、s AW Sent to the witness W; Step AW05: Calculate session key Among them, g is the generator of the cyclic subgroup of the finite field elliptic curve additive group; The negotiation to determine the session key includes the following sub-steps on the witness W side: Step WA01: Receive the t sent by client A from the common channel. AW 、s AW ; Step WA02: Based on the long-term private key W To calculate the random number of client A Step WA03: According to the calculated random number k A To calculate the session key The negotiation determines the session key Z WB , on the witness W side, the following sub-steps are included: Step WB01, from the positive integer space Z of order q q Pick two random numbers r from W and k W , that is, satisfy r W ,k W ∈ R Z q ; Step WB02: According to the random number r W To calculate Step WB03, Calculation Step WB04: Use the normal channel to WB 、s WB Send to blockchain server B; Step WB05: According to the random number k W and WB To calculate the session key The witness W and the blockchain server B negotiate to determine the session key Z WB , on the blockchain server B side, the following sub-steps are included: Step BW01: Receive t sent by witness W from the normal channel WB 、s WB ; Step BW02: Based on the long-term private key B To calculate random numbers Step BW03: According to the random number k W Calculate the session key 2. A session key negotiation method, the method is applied to a client A, multiple witnesses W i , and a blockchain server B, wherein i is used to identify different witnesses, characterized in that, The method comprises the following steps: Step 1: Client A and Witness W i Negotiate and determine the session key Step 2: Witness W i Negotiate with blockchain server B to determine the session key Among them, the client A and the witness W i Negotiate and determine the session key The client A side includes the following sub-steps: Step AW01: Use a random number generator to generate a random number from the positive integer space Z of order q. q Pick two random numbers r from A and k A , that is, satisfy r A ,k A ∈ R Z q ; Step AW02: According to the random number r A To calculate the temporary public key Step AW03: According to the random number r A and k A And the witness W i The long-term public key To calculate Step AW04: Use the normal channel to Sent to the witness W i ; Step AW05: Calculate session key The negotiation determines the session key. i The side includes the following sub-steps: Step WA01: Receive the data sent by client A from the common channel. Step WA02: Based on the long-term private key To calculate the random number of client A Step WA03: According to the calculated random number k A To calculate the session key The negotiation determines the session key In the witness i The side includes the following sub-steps: Step WB01, from the positive integer space Z of order q q Pick two random numbers from and Satisfaction Step WB02: According to the random number To calculate Step WB03, Calculation Step WB04, use the normal channel Send to blockchain server B; Step WB05: According to the random number and To calculate the session key Among them, the witness W i Negotiate with blockchain server B to determine the session key The blockchain server B includes the following sub-steps: Step BW01: Receive the data from the normal channel from the witness W i Sent Step BW02: Based on the long-term private key B To calculate random numbers Step BW03: According to the random number Calculate the session key 3. A data storage method for single-witness single-phase evidence, characterized in that: The method comprises the following steps: Step 0: Determine the session key Z using the negotiation method as described in claim 1 AW , Z WB ; Step 1: Client A uses session key Z AW Encrypt the evidence information that needs to be saved ED to generate Z AW (ED), and then perform hash function calculation on the evidence information ED to obtain H(ED), and convert Z AW (ED) and H(ED) are sent to the witness W; Step 2: Witness W uses session key Z AW Decrypt Z AW (ED) to obtain evidence information ED, then calculate the hash function value of the evidence information ED, and compare the hash function value of the evidence information ED with the received H(ED). If the comparison result is different, then end; if the comparison result is the same, execute step 3; Step 3: Witness W signs the evidence information ED to obtain the proof message ED1, and uses the hash function to generate H(ED1) and H(Z B ,H(ED),H(ED1)), then H(ED1) and H(Z B ,H(ED),H(ED1)) is sent to blockchain server B; Step 4: Blockchain server B sends H(ED1) and H(Z WB ,H(ED),H(ED1)) are stored on the blockchain.

4. A data storage method for multi-witness single-phase evidence, characterized in that: The method comprises the following steps: Step 0: Determine the session key using the negotiation method as described in claim 2 Step 1: Client A uses the session key Encrypt the evidence information that needs to be saved i generate Then the evidence information ED i Perform hash function calculation to obtain H(ED i ),Will and H(ED i ) is sent to the witness W i ; Among them, ED i For different witnesses i the evidence message generated; Step 2: Witness W i Using Session Keys Decryption To obtain evidence information ED i , then calculate the evidence information ED i The hash function value of the evidence information ED i The hash function value of the received H(ED i ), if the comparison result is different, then end; if the comparison result is the same, then execute step 3; Step 3: Witness W i Information on the evidence i Sign to obtain the proof message ED i 1. Use the hash function to generate H(ED i 1) and Then the data H(ED i 1) and Send to blockchain server B; Step 4: Blockchain server B sends H(ED i ) as the respective indexes of the received data, and the data H(ED i 1) and Stored on the blockchain in association with the index.

5. A session key negotiation device, the device is applied to a client A, a single witness W, and a blockchain server B, the device includes a memory and a processor, and is characterized in that: The memory stores one or more programs; when the one or more programs are executed by the processor, the processor implements the method as claimed in claim 1.

6. A session key negotiation device, the device is applied to a client A, multiple witnesses W i , and a blockchain server B, wherein i is used to identify different witnesses, the device includes a memory and a processor, and is characterized in that: The memory stores one or more programs; when the one or more programs are executed by the processor, the processor implements the method according to claim 2.

7. A data storage device for single-witness single-phase evidence, the device comprising a memory and a processor, characterized in that: The memory stores one or more programs; when the one or more programs are executed by the processor, the processor implements the method as claimed in claim 3.

8. A data storage device for multi-witness single-phase evidence, the device comprising a memory and a processor, characterized in that: The memory stores one or more programs; when the one or more programs are executed by the processor, the processor implements the method according to claim 4.

Images