A method and system for covert multi-party secure computation based on blockchain dynamic address
Patent Information
- Application Number
- CN202511608924.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-11-05
- Publication Date
- 2026-10-16
AI Technical Summary
[0006]本申请提供一种基于区块链动态地址的隐蔽多方安全计算方法和系统,用于解决传统隐蔽传输过程中信息易泄露、易被篡改的技术问题
(1)通过公有链实现隐蔽传输,具有匿名性和不可篡改性;
Smart Images

Figure CN122933041A_ABST
Abstract
Description
Technical Field
[0001] This application belongs to the field of blockchain technology, and in particular relates to a covert multi-party secure computation method and system based on blockchain dynamic addresses. Background Technology
[0002] Blockchain is a distributed database technology that stores data through a series of blocks arranged in chronological order. Each block contains a certain number of transaction records and is cryptographically linked to the previous block, forming a continuously extending chain. It features decentralization, immutability, security, and transparency.
[0003] Blockchain, as a distributed ledger technology, is widely used in data storage, sharing, and verification scenarios. However, in some applications, the transmitted data may contain sensitive information (such as personal privacy, trade secrets, or encryption keys). Transmitting it directly in plaintext could lead to data leakage or exploitation by malicious attackers. Therefore, to ensure data confidentiality and security, it is necessary to transmit data covertly to prevent unauthorized access and tampering.
[0004] Covert transmission is a technique that hides information within other non-confidential data, aiming to secretly transmit information without attracting the attention of third parties. This technique typically combines traditional encryption and steganography, ensuring that the information is not only encrypted during transmission but also its very existence is hidden. By embedding secret information into seemingly ordinary network data packets, the covert information is usually integrated with the carrier data. Traditional covert transmission techniques, which hide information through network protocols, may suffer from poor concealment, reliability, and anti-traceability.
[0005] Secure multi-party computation (SMPC) is a cryptographic protocol that allows multiple participants to collaboratively complete a computational task without revealing their individual private data. Its core objective is to achieve "usable but invisible" data, meaning that while ensuring data privacy, multiple data owners can jointly use their respective data to perform computations and obtain results, without each participant being able to access the original data of others. However, attackers can monitor the traffic of the computation participants to determine if a host is conducting a secure multi-party computation task, and then launch a DDoS attack to disrupt the process. Summary of the Invention
[0006] This application provides a covert multi-party secure computation method and system based on blockchain dynamic addresses to solve the technical problems of easy information leakage and tampering during traditional covert transmission.
[0007] Firstly, a covert multi-party secure computation method based on blockchain dynamic addresses is disclosed, the method comprising: Step S1: All participants negotiate and agree on a unified multi-party secure computation task, generate gate circuits corresponding to each participant, and determine the preprocessed data corresponding to each participant; Step S2: Among the participants, every two participants form a participation pair. Each participation pair pre-negotiates to generate a session key and a data interaction seed. The seed is used to generate the rule interaction address. Step S3: Each participant shall perform the following operations: Step S31: The participating party executes the corresponding multi-party secure computation task. During the execution process, it monitors in real time whether the multi-party secure computation task requires information exchange. When information exchange is required, the participating party, acting as the first participating party, determines several second participating parties with whom it will exchange information. Each second participating party forms an interaction pair. Within each interaction pair, a data calculation party is determined, and based on the calculated data, the information sender and receiver are identified. The information sender encrypts the calculated data, constructs a data interaction behavior corresponding to the ciphertext, generates hidden information based on the data interaction behavior, and uses a rule-based interaction address as both the receiver's address and the hidden information interaction address. The hidden information interaction address features are calculated. Rule-based interaction information is constructed based on the hidden information interaction address, and the hidden information interaction address features are embedded in the data interaction behavior. The information sender broadcasts the interaction information corresponding to the data interaction behavior with the embedded hidden information interaction address features to the blockchain network and updates the seed of the participating pair corresponding to the interaction pair. The information receiver obtains the rule-based interaction address, determines the hidden information interaction address features based on the rule-based interaction address, and determines the hidden information based on the hidden information interaction address features and the interaction information corresponding to the data interaction behavior with the embedded hidden information interaction address features. The receiver decrypts the data in the hidden information to obtain the data calculated by the information sender. When no information exchange is required, the participant performs online multi-party secure computation tasks locally; Step S32: Obtain the final calculation result of the multi-party secure computation task corresponding to the participating party; Step S4: Based on the final calculation results of each participant, obtain the multi-party secure calculation result.
[0008] Preferably, in step S1, all participants negotiate and unify a multi-party secure computation task, generate gate circuits corresponding to each participant, and determine the preprocessed data corresponding to each participant, including: Step S11: All participants pre-negotiate a unified multi-party secure computation task, which consists of addition and multiplication. Based on the multi-party secure computation task, gate circuits are generated, which consist of input gates, addition gates, multiplication gates, and output gates. Step S12: Based on the gate circuit topology corresponding to each participant, generate the wire additive secret sharing and multiplication triple additive secret sharing required for the gate circuit preprocessing stage for each participant, including: Step S121: For the input gates in the gate circuit, for the participants Each input wire x i Participants Generate random numbers and based on Determine the input wire x i Corresponding wire additive secret sharing Participants save Other participants received The corresponding wire additive secret sharing share, where i represents the participant number; Step S122: For the adder gate in the gate circuit, the participating parties... The input wire is x i and y i The output wire is z i Participants Calculate locally ;in, The conductors are y i z i The corresponding wires are shared additively; Step S123: Regarding the multiplication gate, the participating parties The input wire is x i and y i The output wire is z i Participants Generate additive secret sharing of multiplicative triples, denoted as ( ), and satisfy Participants Calculate locally and Participants Generate random numbers and based on Determine the output wire z i Corresponding wire additive secret sharing ; Participants based on and Sure and ,in, All are additive secrets shared within triples. , The secrets of the intermediate values are shared separately.
[0009] Preferably, in step S2: among the participating parties, every two participating parties form a participating pair, and each participating pair pre-negotiates to generate a session key and a data interaction seed. The seed is used to generate a rule interaction address, including: Step S21: Among the participants, every two participants form a participating pair, and the two participants in each participating pair... and participating parties Negotiate to generate symmetric session keys This key is used to encrypt and decrypt data stored in the blockchain. ;in, Define the data manipulation content for function call parameters. For user addresses, identify the source of the data. An incrementing counter; Step S22: The two participants in each participating pair and participating parties Seed generation through negotiation This seed is used to generate a data address, which is then used as the rule interaction address. Rule Interaction Address where hidden information is stored Hash value, hidden information The ciphertext corresponding to the data that the message sender wants to send is stored in the middle.
[0010] Preferably, in step S31, the information sender encrypts the calculated data, constructs a data interaction behavior corresponding to the ciphertext, generates covert information based on the data interaction behavior, uses the rule interaction address as the information receiver address and the covert information interaction address, and calculates the covert information interaction address features; constructs rule interaction information based on the covert information interaction address, embeds the covert information interaction address features into the data interaction behavior, broadcasts the interaction information corresponding to the data interaction behavior with the embedded covert information interaction address features to the blockchain network, and updates the seed of the participating pair corresponding to the interaction pair, including: Step S311: The message sender transmits the calculated data via the session key. Encryption generates ciphertext; Step S312: Use the rule interaction address as the information receiver address, and denote the information receiver address as... The recipient's address is also the address for the covert information exchange; construct data exchange behaviors corresponding to the ciphertext, and generate covert information based on these data exchange behaviors. And broadcast this hidden information to the blockchain network for calculation. ,in, This is an aggregate signature used to verify integrity and authenticity. As a participant signature, These are Lagrange basis functions used to recover the original values in secret sharing. A signature generated based on the address of the covert information exchange; Step S313: The message sender calculates the hash value of the hidden message exchange address. , hash value As a feature for covert information exchange addresses, and using session keys For hash value Encryption, generating the first ciphertext c1, where, ; Construct interactive data m based on the first ciphertext c1 tx The sender verifies the interactive data m tx The validity of the signature σ; Step S314: The message sender uses a pre-negotiated seed. Generate rule interaction address Based on rule-based interaction address Constructing rule interaction information The first ciphertext is embedded into the redundant fields of the record storing the data interaction action, and the record after embedding the first ciphertext is broadcast to the blockchain network as the interaction information corresponding to the data interaction action. Step S315: The message sender sets the current seed. Perform a hash calculation to obtain the updated seed. As the current seed .
[0011] Preferably, in step S31, the information receiver obtains the rule interaction address, determines the hidden information interaction address features based on the rule interaction address, determines the hidden information based on the hidden information interaction address features and the interaction information corresponding to the data interaction behavior embedded with the hidden information interaction address features, and decrypts the data in the hidden information to obtain the data calculated by the information sender, including: Step S321: The information recipient uses the seed Generate rule interaction address Filtering information, obtaining rules, and interacting with information. ; Step S322: The information receiver exchanges rule information. Use session key Decrypt and extract the hash value of the hidden information exchange address. ; Step S323: The information recipient uses the hash value. By filtering the interaction information corresponding to data interaction behaviors that embed hidden information interaction address features, the hidden information can be obtained. and using session keys Decrypting Hidden Information Obtain the data calculated by the information sender; Step S324: The message receiver selects the current seed. Perform a hash calculation to obtain the updated seed. As the current seed .
[0012] Secondly, a covert multi-party secure computation system based on blockchain dynamic addresses is disclosed, the system comprising: The system includes: Initialization module: Configured as a multi-party secure computation task negotiated and unified by all participants, generating gate circuits corresponding to each participant and determining the preprocessed data corresponding to each participant; The calculation module is configured such that every two participants form a participation pair, and each participation pair pre-negotiates to generate a session key and a data interaction seed. The seed is used to generate the rule interaction address. Execution module: Configured so that each participant performs the following operations: Interaction Determination Submodule: Configured for the participating party to execute the corresponding multi-party secure computation task, and during the execution process, monitor in real time whether the multi-party secure computation task requires information interaction; When information exchange is required, the participating party, acting as the first participating party, determines several second participating parties with whom it will exchange information. Each second participating party forms an interaction pair. Within each interaction pair, a data calculation party is determined, and based on the calculated data, the information sender and receiver are identified. The information sender encrypts the calculated data, constructs a data interaction behavior corresponding to the ciphertext, generates hidden information based on the data interaction behavior, and uses a rule-based interaction address as both the receiver's address and the hidden information interaction address. The hidden information interaction address features are calculated. Rule-based interaction information is constructed based on the hidden information interaction address, and the hidden information interaction address features are embedded in the data interaction behavior. The information sender broadcasts the interaction information corresponding to the data interaction behavior with the embedded hidden information interaction address features to the blockchain network and updates the seed of the participating pair corresponding to the interaction pair. The information receiver obtains the rule-based interaction address, determines the hidden information interaction address features based on the rule-based interaction address, and determines the hidden information based on the hidden information interaction address features and the interaction information corresponding to the data interaction behavior with the embedded hidden information interaction address features. The receiver decrypts the data in the hidden information to obtain the data calculated by the information sender. When no information exchange is required, the participant performs online multi-party secure computation tasks locally; The result calculation submodule is configured to obtain the final calculation result of the multi-party secure computation task corresponding to this participant. Multi-party computation module: Configured to obtain a secure multi-party computation result based on the final computation results of each participant.
[0013] Thirdly, an electronic device is disclosed, the electronic device comprising: At least one processor; and A memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor to enable the at least one processor to perform the method as described above.
[0014] Fourthly, a non-transitory computer-readable storage medium storing computer instructions for causing the computer to perform the method described above is disclosed.
[0015] This application proposes a covert multi-party secure computation method and system based on blockchain dynamic addresses. In the preprocessing stage, the participants in the multi-party secure computation pre-negotiate the computation task and generate preprocessing data. In the online stage, the participants use covert transmission methods to exchange information. The message sender and receiver exchange information through pre-negotiated session keys and data exchange seeds. The receiver can efficiently filter out covert transaction addresses and obtain the transmitted information, ultimately completing the multi-party secure computation task. Covert transmission is achieved through a public blockchain, and dynamic changes to transaction addresses are enabled by introducing seeds, enhancing security. The use of covert transmission methods in the online stage of the multi-party secure computation enables message passing, achieving the multi-party secure computation task and preventing attackers from launching DDoS attacks against the participants to disrupt the multi-party secure computation task.
[0016] This application has the following technical effects: (1) Covert transmission is achieved through public blockchain, which has anonymity and immutability; (2) By introducing seeds, the address can be dynamically changed, which prevents the risk of address leakage caused by using the same transaction address for a long time and enhances security; (3) In the online phase of multi-party secure computation, a covert transmission method is used to realize message transmission, so as to complete the multi-party secure computation task without the attacker's knowledge and prevent the attacker from launching a DDoS attack on the participants to disrupt the multi-party secure computation task. Attached Figure Description
[0017] Figure 1 This is a flowchart illustrating a covert multi-party secure computation method based on blockchain dynamic addresses. Figure 2 A flowchart illustrating the process of covertly transmitting messages to the sender; Figure 3 A flowchart illustrating the process of covertly transmitting messages to the recipient; Figure 4This is a schematic diagram of the structure of a covert multi-party secure computation system based on blockchain dynamic addresses. Detailed Implementation
[0018] The embodiments of this application will be described in detail below with reference to the accompanying drawings.
[0019] like Figure 1 As shown, this application provides a covert multi-party secure computation method based on blockchain dynamic addresses, the method including: Step S1: All participants negotiate and agree on a unified multi-party secure computation task, generate gate circuits corresponding to each participant, and determine the preprocessed data corresponding to each participant; Step S2: Among the participants, every two participants form a participation pair. Each participation pair pre-negotiates to generate a session key and a data interaction seed. The seed is used to generate the rule interaction address. Step S3: Each participant shall perform the following operations: Step S31: The participating party executes the corresponding multi-party secure computation task. During the execution process, it monitors in real time whether the multi-party secure computation task requires information exchange. When information exchange is required, the participating party, acting as the first participating party, determines several second participating parties with whom it will exchange information. Each second participating party forms an interaction pair. Within each interaction pair, a data calculation party is determined, and based on the calculated data, the information sender and receiver are identified. The information sender encrypts the calculated data, constructs a data interaction behavior corresponding to the ciphertext, generates hidden information based on the data interaction behavior, and uses a rule-based interaction address as both the receiver's address and the hidden information interaction address. The hidden information interaction address features are calculated. Rule-based interaction information is constructed based on the hidden information interaction address, and the hidden information interaction address features are embedded in the data interaction behavior. The information sender broadcasts the interaction information corresponding to the data interaction behavior with the embedded hidden information interaction address features to the blockchain network and updates the seed of the participating pair corresponding to the interaction pair. The information receiver obtains the rule-based interaction address, determines the hidden information interaction address features based on the rule-based interaction address, and determines the hidden information based on the hidden information interaction address features and the interaction information corresponding to the data interaction behavior with the embedded hidden information interaction address features. The receiver decrypts the data in the hidden information to obtain the data calculated by the information sender. When no information exchange is required, the participant performs online multi-party secure computation tasks locally; Step S32: Obtain the final calculation result of the multi-party secure computation task corresponding to the participating party; Step S4: Based on the final calculation results of each participant, obtain the multi-party secure calculation result.
[0020] In this application, the participant is the user.
[0021] In step S1, all participants negotiate and agree on a unified multi-party secure computation task, generating gate circuits corresponding to each participant and determining preprocessed data for each participant, including: Step S11: All participants pre-negotiate a unified multi-party secure computation task, which consists of addition and multiplication. Based on the multi-party secure computation task, gate circuits are generated, which consist of input gates, addition gates, multiplication gates, and output gates. Step S12: Based on the gate circuit topology corresponding to each participant, generate the wire additive secret sharing and multiplication triple additive secret sharing required for the gate circuit preprocessing stage for each participant, including: Step S121: For the input gates in the gate circuit, for the participants Each input wire x i Participants Generate random numbers and based on Determine the input wire x i Corresponding wire additive secret sharing Participants save Other participants received The corresponding wire additive secret sharing share, where i represents the participant number; Step S122: For the adder gate in the gate circuit, the participating parties... The input wire is x i and y i The output wire is z i Participants Calculate locally ;in, The conductors are y i z i The corresponding wires are shared additively; Step S123: Regarding the multiplication gate, the participating parties The input wire is x i and y i The output wire is z i Participants Generate additive secret sharing of multiplicative triples, denoted as ( ), and satisfy Participants Calculate locally and Participants Generate random numbers and based on Determine the output wire z i Corresponding wire additive secret sharing ; Participants based on and Sure and ,in, All are additive secrets shared within triples. , The secrets of the intermediate values are shared separately.
[0022] In this application, the generation of gate circuits consisting of input gates, addition gates, multiplication gates, and output gates uses conventional operations in the art, such as generation by prime numbers, groups, etc.
[0023] Step S2: Among the participating parties, every two participating parties form a participating pair. Each participating pair pre-negotiates and generates a session key and a data interaction seed. The seed is used to generate a rule interaction address, including: Step S21: Among the participants, every two participants form a participating pair, and the two participants in each participating pair... and participating parties Negotiate to generate symmetric session keys This key is used to encrypt and decrypt data stored in the blockchain. ;in, Define the data manipulation content for function call parameters. For user addresses, identify the source of the data. An incrementing counter; Step S22: The two participants in each participating pair and participating parties Seed generation through negotiation This seed is used to generate a data address, which is then used as the rule interaction address. Rule Interaction Address where hidden information is stored Hash value, hidden information The ciphertext corresponding to the data that the message sender wants to send is stored in the middle.
[0024] In step S3, when information exchange is required, the information sender needs to exchange the locally calculated data with the information receiver. The local calculation method of the information sender is as follows: Step S301: Calculation , For data that needs to be interacted with, The hash function value, If the number is a prime number, the sender of the information is denoted as the participant. ; Step S302: For the input gate, the participating parties The input value is x i ,but Local computing ,Will Broadcast to other participants via blockchain, and other participants store the data. , For x i Input values after masking; calculate participant signature ; Regarding the addition gate, the participating parties Local computing ; For y i The input value after the mask, For z i The input value after the mask, As a participant Private key fragmentation; Regarding the multiplication gate, the participating parties Local computation: The output of the multiplication gate, based on get ; Regarding the output gate, the participating parties Local computing ;in, This is the output of the output gate.
[0025] In step S31, the information sender encrypts the calculated data, constructs a data interaction behavior corresponding to the ciphertext, generates covert information based on the data interaction behavior, uses the rule interaction address as the information receiver address and the covert information interaction address, and calculates the covert information interaction address features; constructs rule interaction information based on the covert information interaction address, embeds the covert information interaction address features into the data interaction behavior, broadcasts the interaction information corresponding to the data interaction behavior with embedded covert information interaction address features to the blockchain network, and updates the seed of the participating pair corresponding to the interaction pair, including: Step S311: The message sender transmits the calculated data via the session key. Encryption generates ciphertext; Step S312: Use the rule interaction address as the information receiver address, and denote the information receiver address as... The recipient's address is also the address for the covert information exchange; construct data exchange behaviors corresponding to the ciphertext, and generate covert information based on these data exchange behaviors. And broadcast this hidden information to the blockchain network for calculation. ,in, This is an aggregate signature used to verify integrity and authenticity. As a participant signature, These are Lagrange basis functions used to recover the original values in secret sharing. A signature generated based on the address of the covert information exchange; Step S313: The message sender calculates the hash value of the hidden message exchange address. , hash value As a feature for covert information exchange addresses, and using session keys For hash value Encryption, generating the first ciphertext c1, where, ; Construct interactive data m based on the first ciphertext c1 tx The sender verifies the interactive data m tx The validity of the signature σ; Step S314: The message sender uses a pre-negotiated seed. Generate rule interaction address Based on rule-based interaction address Constructing rule interaction information The first ciphertext is embedded into the redundant fields of the record storing the data interaction action, and the record after embedding the first ciphertext is broadcast to the blockchain network as the interaction information corresponding to the data interaction action. Step S315: The message sender sets the current seed. Perform a hash calculation to obtain the updated seed. As the current seed .
[0026] In step S31, the information receiver obtains the rule interaction address, determines the hidden information interaction address features based on the rule interaction address, determines the hidden information based on the hidden information interaction address features and the interaction information corresponding to the data interaction behavior embedded with the hidden information interaction address features, and decrypts the data in the hidden information to obtain the data calculated by the information sender, including: Step S321: The information recipient uses the seed Generate rule interaction address Filtering information, obtaining rules, and interacting with information. ; Step S322: The information receiver exchanges rule information. Use session key Decrypt and extract the hash value of the hidden information exchange address. ; Step S323: The information recipient uses the hash value. By filtering the interaction information corresponding to data interaction behaviors that embed hidden information interaction address features, the hidden information can be obtained. and using session keys Decrypting Hidden Information Obtain the data calculated by the information sender; Step S324: The message receiver selects the current seed. Perform a hash calculation to obtain the updated seed. As the current seed .
[0027] In this application, the purpose of updating the seed is to prepare for the next information exchange.
[0028] like Figure 4 As shown, this application provides a covert multi-party secure computation system based on blockchain dynamic addresses, the system comprising: Initialization module: Configured as a multi-party secure computation task negotiated and unified by all participants, generating gate circuits corresponding to each participant and determining the preprocessed data corresponding to each participant; The calculation module is configured such that every two participants form a participation pair, and each participation pair pre-negotiates to generate a session key and a data interaction seed. The seed is used to generate the rule interaction address. Execution module: Configured so that each participant performs the following operations: Interaction Determination Submodule: Configured for the participating party to execute the corresponding multi-party secure computation task, and during the execution process, monitor in real time whether the multi-party secure computation task requires information interaction; When information exchange is required, the participating party, acting as the first participating party, determines several second participating parties with whom it will exchange information. Each second participating party forms an interaction pair. Within each interaction pair, a data calculation party is determined, and based on the calculated data, the information sender and receiver are identified. The information sender encrypts the calculated data, constructs a data interaction behavior corresponding to the ciphertext, generates hidden information based on the data interaction behavior, and uses a rule-based interaction address as both the receiver's address and the hidden information interaction address. The hidden information interaction address features are calculated. Rule-based interaction information is constructed based on the hidden information interaction address, and the hidden information interaction address features are embedded in the data interaction behavior. The information sender broadcasts the interaction information corresponding to the data interaction behavior with the embedded hidden information interaction address features to the blockchain network and updates the seed of the participating pair corresponding to the interaction pair. The information receiver obtains the rule-based interaction address, determines the hidden information interaction address features based on the rule-based interaction address, and determines the hidden information based on the hidden information interaction address features and the interaction information corresponding to the data interaction behavior with the embedded hidden information interaction address features. The receiver decrypts the data in the hidden information to obtain the data calculated by the information sender. When no information exchange is required, the participant performs online multi-party secure computation tasks locally; The result calculation submodule is configured to obtain the final calculation result of the multi-party secure computation task corresponding to this participant. Multi-party computation module: Configured to obtain a secure multi-party computation result based on the final computation results of each participant.
[0029] The above embodiments are only used to illustrate the technical solutions of this application, and are not intended to limit it. Although this application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some or all of the technical features therein, and such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of this application.
Claims
1. A covert multi-party secure computation method based on blockchain dynamic addresses, characterized in that, The methods include: Step S1: All participants negotiate and agree on a unified multi-party secure computation task, generate gate circuits corresponding to each participant, and determine the preprocessed data corresponding to each participant; Step S2: Among the participants, every two participants form a participation pair. Each participation pair pre-negotiates to generate a session key and a data interaction seed. The seed is used to generate the rule interaction address. Step S3: Each participant shall perform the following operations: Step S31: The participating party executes the corresponding multi-party secure computation task. During the execution process, it monitors in real time whether the multi-party secure computation task requires information exchange. When information exchange is required, the participating party, acting as the first participating party, determines several second participating parties with whom it will exchange information. Each second participating party forms an interaction pair. Within each interaction pair, a data calculation party is determined, and based on the calculated data, the information sender and receiver are identified. The information sender encrypts the calculated data, constructs a data interaction behavior corresponding to the ciphertext, generates hidden information based on the data interaction behavior, and uses a rule-based interaction address as both the receiver's address and the hidden information interaction address. The hidden information interaction address features are calculated. Rule-based interaction information is constructed based on the hidden information interaction address, and the hidden information interaction address features are embedded in the data interaction behavior. The information sender broadcasts the interaction information corresponding to the data interaction behavior with the embedded hidden information interaction address features to the blockchain network and updates the seed of the participating pair corresponding to the interaction pair. The information receiver obtains the rule-based interaction address, determines the hidden information interaction address features based on the rule-based interaction address, and determines the hidden information based on the hidden information interaction address features and the interaction information corresponding to the data interaction behavior with the embedded hidden information interaction address features. The receiver decrypts the data in the hidden information to obtain the data calculated by the information sender. When no information exchange is required, the participant performs online multi-party secure computation tasks locally; Step S32: Obtain the final calculation result of the multi-party secure computation task corresponding to the participating party; Step S4: Based on the final calculation results of each participant, obtain the multi-party secure calculation result.
2. The method as described in claim 1, characterized in that, In step S1, all participants negotiate and agree on a unified multi-party secure computation task, generating gate circuits corresponding to each participant and determining preprocessed data for each participant, including: Step S11: All participants pre-negotiate a unified multi-party secure computation task, which consists of addition and multiplication. Based on the multi-party secure computation task, gate circuits are generated, which consist of input gates, addition gates, multiplication gates, and output gates. Step S12: Based on the gate circuit topology corresponding to each participant, generate the wire additive secret sharing and multiplication triple additive secret sharing required for the gate circuit preprocessing stage for each participant, including: Step S121: For the input gates in the gate circuit, for the participants Each input wire x i Participants Generate random numbers and based on Determine the input wire x i Corresponding wire additive secret sharing Participants save Other participants received The corresponding wire additive secret sharing share, where i represents the participant number; Step S122: For the adder gate in the gate circuit, the participating parties... The input wire is x i and y i The output wire is z i Participants Calculate locally ;in, The conductors are y i z i The corresponding wires share additive secrets; Step S123: Regarding the multiplication gate, the participating parties The input wire is x i and y i The output wire is z i Participants Generate additive secret sharing of multiplicative triples, denoted as ( ), and satisfy Participants Calculate locally and Participants Generate random numbers and based on Determine the output wire z i Corresponding wire additive secret sharing ; Participants based on and Sure and ,in, All are additive secrets shared within triples. , The secrets of the intermediate values are shared separately.
3. The method as described in claim 1, characterized in that, Step S2: Among the participating parties, every two participating parties form a participating pair. Each participating pair pre-negotiates and generates a session key and a data interaction seed. The seed is used to generate a rule interaction address, including: Step S21: Among the participants, every two participants form a participating pair, and the two participants in each participating pair... and participating parties Negotiate to generate symmetric session keys This key is used to encrypt and decrypt data stored in the blockchain. ;in, Define the data manipulation content for function call parameters. For user addresses, identify the source of the data. An incrementing counter; Step S22: The two participants in each participating pair and participating parties Seed generation through negotiation This seed is used to generate a data address, which is then used as the rule interaction address. Rule Interaction Address where hidden information is stored Hash value, hidden information The ciphertext corresponding to the data that the message sender wants to send is stored in the middle.
4. The method as described in claim 3, characterized in that, In step S31, the information sender encrypts the calculated data, constructs a data interaction behavior corresponding to the ciphertext, generates hidden information based on the data interaction behavior, uses the rule interaction address as the information receiver address and the hidden information interaction address, and calculates the hidden information interaction address characteristics. Based on the concealed information interaction address, rule-based interaction information is constructed, and the characteristics of the concealed information interaction address are embedded in the data interaction behavior. The information sender broadcasts the interaction information corresponding to the data interaction behavior with the embedded concealed information interaction address characteristics to the blockchain network. The information sender updates the seed of the participating pair corresponding to the interaction pair, including: Step S311: The message sender transmits the calculated data via the session key. Encryption generates ciphertext; Step S312: Use the rule interaction address as the information receiver address, and denote the information receiver address as... The recipient's address is also the address for the covert information exchange; construct data exchange behaviors corresponding to the ciphertext, and generate covert information based on these data exchange behaviors. And broadcast this hidden information to the blockchain network for calculation. ,in, This is an aggregate signature used to verify integrity and authenticity. As a participant signature, These are Lagrange basis functions used to recover the original values in secret sharing. A signature generated based on the address of the covert information exchange; Step S313: The message sender calculates the hash value of the hidden message exchange address. , hash value As a feature for covert information exchange addresses, and using session keys For hash value Encryption, generating the first ciphertext c1, where, ; Construct interactive data m based on the first ciphertext c1 tx The sender verifies the interactive data m tx The validity of the signature σ; Step S314: The message sender uses a pre-negotiated seed. Generate rule interaction address Based on rule-based interaction address Constructing rule interaction information The first ciphertext is embedded into the redundant fields of the record storing the data interaction action, and the record after embedding the first ciphertext is broadcast to the blockchain network as the interaction information corresponding to the data interaction action. Step S315: The message sender sets the current seed. Perform a hash calculation to obtain the updated seed. As the current seed .
5. The method as described in claim 4, characterized in that, In step S31, the information receiver obtains the rule interaction address, determines the hidden information interaction address features based on the rule interaction address, determines the hidden information based on the hidden information interaction address features and the interaction information corresponding to the data interaction behavior embedded with the hidden information interaction address features, and decrypts the data in the hidden information to obtain the data calculated by the information sender, including: Step S321: The information recipient uses the seed Generate rule interaction address Filtering information, obtaining rules, and interacting with information. ; Step S322: The information receiver exchanges rule information. Use session key Decrypt and extract the hash value of the hidden information exchange address. ; Step S323: The information recipient uses the hash value. By filtering the interaction information corresponding to data interaction behaviors that embed hidden information interaction address features, the hidden information can be obtained. and using session keys Decrypting Hidden Information Obtain the data calculated by the information sender; Step S324: The message receiver selects the current seed. Perform a hash calculation to obtain the updated seed. As the current seed .
6. A covert multi-party secure computation system based on blockchain dynamic addresses, characterized in that, The system includes: Initialization module: Configured as a multi-party secure computation task negotiated and unified by all participants, generating gate circuits corresponding to each participant and determining the preprocessed data corresponding to each participant; The calculation module is configured such that every two participants form a participation pair, and each participation pair pre-negotiates to generate a session key and a data interaction seed. The seed is used to generate the rule interaction address. Execution module: Configured so that each participant performs the following operations: Interaction Determination Submodule: Configured for the participating party to execute the corresponding multi-party secure computation task, and during the execution process, monitor in real time whether the multi-party secure computation task requires information interaction; When information exchange is required, the participating party acts as the first participating party and determines several second participating parties with which it will exchange information. The first participating party and each second participating party form an interaction pair. In each interaction pair, a data calculation party is determined, and then the information sender and information receiver are determined based on the calculated data. The information sender encrypts the calculated data, constructs a data interaction behavior corresponding to the ciphertext, generates covert information based on the data interaction behavior, and uses the rule interaction address as the information receiver address and the covert information interaction address to calculate the covert information interaction address characteristics. Based on the hidden information interaction address, rule-based interaction information is constructed, and the hidden information interaction address features are embedded in the data interaction behavior. The information sender broadcasts the interaction information corresponding to the data interaction behavior with the embedded hidden information interaction address features to the blockchain network, and updates the seed of the participating pair corresponding to the interaction pair. The information receiver obtains the rule-based interaction address, determines the hidden information interaction address features based on the rule-based interaction address, determines the hidden information based on the hidden information interaction address features and the interaction information corresponding to the data interaction behavior with the embedded hidden information interaction address features, and decrypts the data in the hidden information to obtain the data calculated by the information sender. When no information exchange is required, the participant performs online multi-party secure computation tasks locally; The result calculation submodule is configured to obtain the final calculation result of the multi-party secure computation task corresponding to this participant. Multi-party computation module: Configured to obtain a secure multi-party computation result based on the final computation results of each participant.
7. An electronic device, characterized in that, The device includes: At least one processor; and A memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor to enable the at least one processor to perform the method as described in any one of claims 1-5.
8. A non-transitory computer-readable storage medium storing computer instructions, characterized in that, The computer instructions are used to cause the computer to perform the method as described in any one of claims 1-5.