Intranet security block chain auditing method based on security multiple parties

Abstract

The invention discloses an intranet security block chain auditing method based on secure multiple parties, and the method comprises the following specific steps: 1, generating a secret key: enabling a participant to initialize and generate secret mark information, and generating a personal private key, a personal public key, a group public key and a group private key; 2, establishing a credible mechanism, and evaluating the mechanism through dynamic credibility; step 3, signature generation: the participant generates a signature of the message by using the personal private key and public key and the group public and private key; 4, signature verification: verifying the validity of the signature by using the group public key; 5, dynamically updating and regularly updating secret mark information and a private key of a participant to improve system security, and 6, block chain auditing: encrypting a trust evaluation matrix and storing the trust evaluation matrix in a block chain by an agent to facilitate subsequent auditing and verification, and performing encryption storage on the trust matrix by selecting a semi-trusted agent and performing decryption verification when needed, thereby improving system security. And the credibility of participants is ensured.

Description

Technical Field

[0001] The present invention relates to the field of network security technology, and in particular to an intranet security blockchain audit method based on secure multi-party security. Background Art

[0002] Secure Multi-party Computation (SMC) is a key area in cryptography, allowing multiple participants to complete computations together without disclosing personal information. Since its proposal, SMC has played an important role in privacy protection and data security. However, due to the diversity of participants, including honest, semi-honest, and malicious types, SMC faces trust and security challenges in practical applications. To address these challenges, researchers have proposed a variety of trust assessment and security protocols, such as trust-based virtual identity authentication, reputation mechanism, dynamic credibility assessment model, and automatic trust negotiation protocol. These research results enhance the security of SMC and provide new methods for trust establishment in distributed systems. In addition, dynamically updateable signature schemes and fair secret sharing schemes can improve the adaptability of the system and protect the secret information of participants. Nevertheless, SMC still has room for improvement in efficiency, scalability, and privacy protection. Summary of the invention

[0003] The purpose of the present invention is to provide an intranet security blockchain audit method based on secure multi-party, and the specific steps of the intranet security blockchain audit method based on secure multi-party are as follows:

[0004] Step 1: Generate keys. Participants generate personal private keys and public keys, as well as group public keys and group private keys by initializing and generating secret tag information. Initialization is first performed to define the participant set, threshold value, generator, and prime number and positive integer sequence that meet specific conditions. Then the necessary parameters are made public. Each participant randomly generates secret tag information and exchanges and broadcasts it based on it to verify the authenticity of the information. Participants use random numbers to generate identity tag information and verify the acceptability of the information through a series of calculations. After verification, each participant generates its own key pair based on the received secret tag and personal random number, and then calculates the group public key and group private key.

[0005] Step 2: Establish a trusted mechanism. Through the dynamic trusted evaluation mechanism, update the participants’ secret tag information and generate a trust vector with a timestamp to build a trust matrix.

[0006] The system establishes a dynamic trust evaluation mechanism, generates a trust vector with a timestamp by updating the secret tag information of the participants, and constructs a trust matrix. The trust evaluation function combines the evaluation results of direct trust and indirect trust, calculates the trust value of each participant, and generates and updates the trust vector and trust matrix in each cycle. Untrustworthy participants will be excluded to ensure the continuous credibility of all participants in the system.

[0007] Step 3: Signature generation: Participants use their personal private and public keys, as well as the group's public and private keys, to generate a signature for the message.

[0008] Step 4: Signature verification, using the group public key to verify the validity of the signature;

[0009] Step 5: Dynamic update, regularly update the participants' secret tag information and private keys to improve system security; the strategy of defending against mobile attacks by periodically and dynamically updating the participants' secret tag information and private keys not only effectively improves the security of the system, but also maintains the consistency of the system public key, ensures access to historical signature information, and allows participants to continue to generate valid signatures after each update cycle.

[0010] Step 6: Blockchain audit. The agent encrypts the trust assessment matrix and stores it in the blockchain for subsequent audit and verification. Participants select semi-trusted agents through bidding. The agent stores the encrypted trust measurement matrix on the blockchain. When an applicant needs to check, he applies to the agent and downloads the encrypted data from the blockchain. The agent provides the private key, and the applicant decrypts it to obtain the original trust matrix to verify the credibility of the participant.

[0011] Preferably, in step 1, a set of participants P participating in the signing process is determined during initialization. i , set a threshold value t, select a generator g on a finite field GF(p), and two large prime numbers p and q that satisfy a specific relationship, and define a set of positive integer sequences d i , the sequence is strictly monotonically increasing and together with q and d satisfies the Asmuth-Bloom scheme, calculate the value of D, which is d i The sum of , and all these parameters n, t, g, p, q, d and D are made public;

[0012] Participant P i Choose a random number a i , calculate and broadcast and g a , assuming ID i =μ i (modd i ), we can get The participant's identity verification information is (ID, μ i ), confirm the participant P according to the broadcast information j (j≠i) Whether to accept participant P i Information sent Finally, P i Receive the secret tokens from other participants to generate private keys, public keys, group public keys and group private keys.

[0013] Preferably, in step 2, a dynamic trust evaluation mechanism is established. The trust evaluation includes two aspects: direct trust and indirect trust. In the trust evaluation, the identity trustworthiness of the participants is evaluated according to the equation Make a judgment. If the equation holds, directly trust the value f D =1, otherwise f D = 0, in terms of indirect credibility, according to the equation Evaluate the credibility of the interactive information between participants. If the equation holds, the direct trust value is f D =1, otherwise f D =0,

[0014] In step 2, the trustworthy evaluation function is where f D and f I The value of is {0, 1}, The value of is {0, 0.5, 1}. This function combines the evaluation results of direct trust and indirect trust to calculate the overall trust value of each participant. i Generate the trust vector TV of the kth period according to the calculation results, the format is Then the trust vectors of all participants in the kth period are combined into the trust matrix Each row of the matrix is ​​a trust vector of a participant, which represents the evaluation result of the participant on all other participants. In the k+1th cycle, the participant updates the trust matrix A new trust vector is generated based on the latest evaluation results. Since the trust matrix is ​​constantly updated over time, the credibility evaluation can be ensured to be dynamic and real-time. Finally, untrusted participants are excluded. If a participant's trust value does not meet the standard, he or she cannot participate in signing or other key operations, ensuring that only trusted participants are included in the system.

[0015] Preferably, in step 6, each participant bids to obtain a standard data H = (h1, h2, ..., h n ), participant P i Agree on a universal set A = [1, N], and construct an N-dimensional vector B in the universal set A i =(b i1 , b i2, …, b ij ,…,bx N ), and assume Then participant P i Encrypt B with the system public key i Get B′ i , and send it to P i+1 , finally, each participant P i By formula Get the final bid ranking, and the highest bidder will be the agent;

[0016] In blockchain auditing, assuming P r As an agent, the first T k Credibility Assessment Matrix Encrypt with the system public key to get the ciphertext Then the ciphertext is processed using the hash method to obtain The hash value is then stored in the blockchain. If an applicant needs to check, the agent P r Initiate application, agent P r The group private key is sent to the applicant, who downloads the encrypted data of the corresponding period from the blockchain and decrypts it with the private key to obtain the original trusted matrix. to verify.

[0017] Compared with the prior art, the beneficial effects of the present invention are: ensuring the transparency and traceability of the signing process, the participants generate and verify the secret tag information to establish the identity authentication and trust mechanism, and then use this information to create the key and generate the signature. The validity of the signature is verified by the group public key, while the real-time update of the reputation value and the blockchain audit mechanism jointly improve the overall security. The security of the information is guaranteed by encryption and hash processing, and the encrypted storage of the trust matrix is ​​the responsibility of the semi-trusted agent, which is selected through a bidding mechanism to facilitate subsequent supervision and auditing. Not only is the credibility of the participants intuitively quantified, but also its authenticity and credibility are ensured, and the tamper-proof characteristics of the blockchain are utilized. The credibility of the participants is ensured by selecting a semi-trusted agent, encrypting and storing the trust matrix, and decrypting and verifying it when necessary. The invention utilizes the decentralized and tamper-proof characteristics of the blockchain to improve the security and transparency of the system, and is suitable for fields that require high credibility, such as finance, the Internet of Things, and supply chain management. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] Figure 1 It is a system model diagram for IoT data analysis;

[0019] Figure 2 It is a diagram of the process of establishing a trustworthy mechanism;

[0020] Figure 3 It is a blockchain audit flowchart. DETAILED DESCRIPTION

[0021] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with specific embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0022] Example 1

[0023] Reference Figure 1 , a method for auditing an intranet security blockchain based on secure multi-party, the specific steps of the method for auditing an intranet security blockchain based on secure multi-party are as follows:

[0024] Step 1: Generate keys. Participants generate personal private keys and public keys, as well as group public keys and group private keys by initializing and generating secret tag information. Initialization is first performed to define the participant set, threshold value, generator, and prime number and positive integer sequence that meet specific conditions. Then the necessary parameters are made public. Each participant randomly generates secret tag information and exchanges and broadcasts it based on it to verify the authenticity of the information. Participants use random numbers to generate identity tag information and verify the acceptability of the information through a series of calculations. After verification, each participant generates its own key pair based on the received secret tag and personal random number, and then calculates the group public key and group private key.

[0025] During initialization, the set of participants P involved in the signing process is determined i , set a threshold value t, select a generator g on a finite field GF(p), and two large prime numbers p and q that satisfy a specific relationship, and define a set of positive integer sequences d i , the sequence is strictly monotonically increasing and together with q and d satisfies the Asmuth-Bloom scheme, calculate the value of D, which is d i The sum of , and all these parameters n, t, g, p, q, d and D are made public;

[0026] Participant P i Choose a random number a i , calculate and broadcast and g a , assuming ID i =μ i (modd i ), we can get The participant's identity verification information is (ID, μ i ), confirm the participant P according to the broadcast information j (j≠i) Whether to accept participant P i Information sent Finally, Pi Receive the secret tokens from other participants to generate private keys, public keys, group public keys and group private keys.

[0027] Step 2: Establish a trusted mechanism. Through the dynamic trusted evaluation mechanism, update the participants’ secret tag information and generate a trust vector with a timestamp to build a trust matrix.

[0028] The system establishes a dynamic trust evaluation mechanism, generates a trust vector with a timestamp by updating the secret tag information of the participants, and constructs a trust matrix. The trust evaluation function combines the evaluation results of direct trust and indirect trust, calculates the trust value of each participant, and generates and updates the trust vector and trust matrix in each cycle. Untrustworthy participants will be excluded to ensure the continuous credibility of all participants in the system.

[0029] Establish a dynamic trustworthy evaluation mechanism, the process is as follows Figure 2 As shown. Trust evaluation includes two aspects: direct trust and indirect trust. In trust evaluation, the identity trustworthiness of the participants is evaluated according to the equation Make a judgment. If the equation holds, directly trust the value f D =1, otherwise f D = 0, in terms of indirect credibility, according to the equation Evaluate the credibility of the interactive information between participants. If the equation holds, the direct trust value is f D =1, otherwise f D =0,

[0030] In step 2, the trustworthy evaluation function is The values ​​of fD and f are {0, 1}, The value of is {0, 0.5, 1}. This function combines the evaluation results of direct trust and indirect trust to calculate the overall trust value of each participant. i Generate the trust vector TV of the kth period according to the calculation results, the format is Then the trust vectors of all participants in the kth period are combined into the trust matrix Each row of the matrix is ​​a trust vector of a participant, which represents the evaluation result of the participant on all other participants. In the k+1th cycle, the participant updates the trust matrix A new trust vector is generated based on the latest evaluation results. Since the trust matrix is ​​constantly updated over time, the credibility evaluation can be ensured to be dynamic and real-time. Finally, untrusted participants are excluded. If a participant's trust value does not meet the standard, he or she cannot participate in signing or other key operations, ensuring that only trusted participants are included in the system.

[0031] Step 3: Signature generation: Participants use their personal private and public keys, as well as the group's public and private keys, to generate a signature for the message.

[0032] Step 4: Signature verification, using the group public key to verify the validity of the signature;

[0033] Step 5: Dynamic update, regularly update the participants' secret tag information and private keys to improve system security; the strategy of defending against mobile attacks by periodically and dynamically updating the participants' secret tag information and private keys not only effectively improves the security of the system, but also maintains the consistency of the system public key, ensures access to historical signature information, and allows participants to continue to generate valid signatures after each update cycle.

[0034] Step 6: Blockchain audit. The agent encrypts the trust evaluation matrix and stores it in the blockchain for subsequent audit and verification. Participants select semi-trusted agents through bidding. The agent stores the encrypted trust measurement matrix on the blockchain. When an applicant needs to check, he applies to the agent and downloads the encrypted data from the blockchain. The agent provides the private key, and the applicant decrypts it to obtain the original trust matrix to verify the credibility of the participant.

[0035] After executing step 6, the actual blockchain audit process is as follows Figure 3 As shown. Participants select semi-trusted agents through bidding, and the agents store the encrypted trust measurement matrix on the blockchain. When an applicant needs to check, he applies to the agent and downloads the encrypted data from the blockchain. The agent provides the private key, and the applicant decrypts it to obtain the original trust matrix to verify the trustworthiness of the participant;

[0036] Each participant bids and obtains a standard data H = (h1, h2, ..., h n ), participant P i Agree on a universal set A = [1, N], and construct an N-dimensional vector B in the universal set A i =(b i1 , b i2 , …, b ij , …, b iN ), and assume Then participant P i Encrypt B with the system public key i Get B′ i , and send it to P i+1 , finally, each participant P i By formula Get the final bid ranking, and the highest bidder will be the agent;

[0037] In blockchain auditing, assuming P r As an agent, the first T k Credibility Assessment Matrix Encrypt with the system public key to get the ciphertext Then the ciphertext is processed using the hash method to obtain The hash value is then stored in the blockchain. If an applicant needs to check, the agent P r Initiate application, agent P r The group private key is sent to the applicant, who downloads the encrypted data of the corresponding period from the blockchain and decrypts it with the private key to obtain the original trusted matrix. to verify.

[0038] The above description is only a preferred specific implementation manner of the present invention, but the protection scope of the present invention is not limited thereto. Any technician familiar with the technical field can make equivalent replacements or changes according to the technical scheme and inventive concept of the present invention within the technical scope disclosed by the present invention, which should be covered by the protection scope of the present invention.

Claims

1. A secure multi-party intranet security blockchain audit method, characterized by: The specific steps of the intranet security blockchain audit method based on secure multi-party are as follows: Step 1: Generate keys. Participants generate personal private keys and public keys, as well as group public keys and group private keys by initializing and generating secret tag information. Initialization is first performed to define the participant set, threshold value, generator, and prime number and positive integer sequence that meet specific conditions. Then the necessary parameters are made public. Each participant randomly generates secret tag information and exchanges and broadcasts it based on it to verify the authenticity of the information. Participants use random numbers to generate identity tag information and verify the acceptability of the information through a series of calculations. After verification, each participant generates its own key pair based on the received secret tag and personal random number, and then calculates the group public key and group private key. Step 2: Establish a trusted mechanism. Through the dynamic trusted evaluation mechanism, update the participants’ secret tag information and generate a trust vector with a timestamp to build a trust matrix. The system establishes a dynamic trust evaluation mechanism, generates a trust vector with a timestamp by updating the secret tag information of the participants, and constructs a trust matrix. The trust evaluation function combines the evaluation results of direct trust and indirect trust, calculates the trust value of each participant, and generates and updates the trust vector and trust matrix in each cycle. Untrustworthy participants will be excluded to ensure the continuous credibility of all participants in the system. Step 3: Signature generation: Participants use their personal private and public keys, as well as the group's public and private keys, to generate a signature for the message. Step 4: Signature verification, using the group public key to verify the validity of the signature; Step 5: Dynamic update, regularly update the participants' secret tag information and private keys to improve system security; the strategy of defending against mobile attacks by periodically and dynamically updating the participants' secret tag information and private keys not only effectively improves the security of the system, but also maintains the consistency of the system public key, ensures access to historical signature information, and allows participants to continue to generate valid signatures after each update cycle; Step 6: Blockchain audit. The agent encrypts the trust assessment matrix and stores it in the blockchain for subsequent audit and verification. Participants select semi-trusted agents through bidding. The agent stores the encrypted trust measurement matrix on the blockchain. When an applicant needs to check, he applies to the agent and downloads the encrypted data from the blockchain. The agent provides the private key, and the applicant decrypts it to obtain the original trust matrix to verify the credibility of the participant.

2. According to claim 1, a secure multi-party intranet security blockchain audit method is characterized in that: In step 1, the set of participants P involved in the signing process is determined in the initialization i , set a threshold value t, select a generator g on a finite field GF(p), and two large prime numbers p and q that satisfy a specific relationship, and define a set of positive integer sequences d i , the sequence is strictly monotonically increasing and together with q and d satisfies the Asmuth-Bloom scheme, calculate the value of D, which is d i The sum of , and all these parameters n, t, g, p, q, d and D are made public; Participant P i Choose a random number a i , calculate and broadcast and g a , assuming ID i =μ i (modd i ), we can get The participant's identity verification information is (ID, μ i ), confirm the participant P according to the broadcast information j (j≠i) Whether to accept participant P i Information sent Finally, P i Receive the secret tokens from other participants to generate private keys, public keys, group public keys and group private keys.

3. According to claim 1, a secure multi-party intranet security blockchain audit method is characterized in that: In step 2, a dynamic trust evaluation mechanism is established. The trust evaluation includes two aspects: direct trust and indirect trust. In the trust evaluation, the identity trustworthiness of the participants is evaluated according to the equation Make a judgment. If the equation holds, directly trust the value f D =1, otherwise f D = 0, in terms of indirect credibility, according to the equation Evaluate the credibility of the interactive information between participants. If the equation holds, the direct trust value is f D =1, otherwise f D =0; In step 2, the trustworthy evaluation function is where f D and f I The value of is {0,1}, The value of is {0, 0.5, 1}. This function combines the evaluation results of direct trust and indirect trust to calculate the overall trust value of each participant. i Generate the trust vector TV of the kth period according to the calculation results, the format is Then the trust vectors of all participants in the kth period are combined into the trust matrix Each row of the matrix is ​​a trust vector of a participant, which represents the evaluation result of the participant on all other participants. In the k+1th cycle, the participant updates the trust matrix A new trust vector is generated based on the latest evaluation results. Since the trust matrix is ​​continuously updated over time, the credibility assessment is ensured to be dynamic and real-time. Finally, untrusted participants are excluded. If the trust value of a participant does not meet the standard, he or she cannot participate in signing or other key operations, ensuring that only trusted participants are included in the system.

4. According to claim 1, a secure multi-party intranet security blockchain audit method is characterized in that: In step 6, each participant bids to obtain a standard data H = (h1, h2, ..., h n ), participant P i Agree on a universal set A = [1, N], and construct an N-dimensional vector B in the universal set A i =(b i1 , b i2 , …, b ij , …, b iN ), and assume Then participant P i Encrypt B with the system public key i Get B′ i , and send it to P i+1 , finally, each participant P i By formula Get the final bid ranking, and the highest bidder will be the agent; In blockchain auditing, assuming P r As an agent, the first k Credibility Assessment Matrix Encrypt with the system public key to get the ciphertext Then the ciphertext is processed using the hash method to obtain The hash value is then stored in the blockchain. When the applicant needs to check, he / she can ask the proxy P r Initiate application, agent P r The group private key is sent to the applicant, who downloads the encrypted data of the corresponding period from the blockchain and decrypts it with the private key to obtain the original trusted matrix. to verify.

Images