Edge network security computing method, system and device based on improved entangled polynomial coding

Abstract

The invention discloses an edge network security computing method, system and device based on improved entangled polynomial coding, and relates to the technical field of network information security. Comprising a secret sharing stage, a data calculation stage, an edge node communication stage and a secret reconstruction stage. In the four stages, private data of different devices are input, polynomial coding is carried out to obtain a secretly shared polynomial, and the terminal device generates an edge computing node through a public coin protocol; introducing a polynomial Fi, calculating each edge calculation node, and constructing a polynomial H (X); the edge node calculates a polynomial Gn (X) through the polynomial H (X) and the highest number of times, the edge node calculates Gn (alpha n ') through the Gn (X), and then a polynomial I (alpha n') is calculated through summation and sent to the cloud server; the cloud server obtains private data through an interpolation mode, privacy input protection of the terminal equipment is achieved, and a good secret recovery domain value can be achieved under the improved entangled polynomial coding technology.

Description

Technical Field

[0001] The present invention relates to the technical field of network information security, and particularly to an edge network security calculation method, system and device based on improved entangled polynomial coding. Background Art

[0002] In the edge computing paradigm, the background of the identity privacy protection problem presents multi-dimensional composite characteristics. From the perspective of technological evolution, the massive access and distributed architecture characteristics of Internet of Things (IoT) terminal devices lead to the dynamic distribution characteristics of user identity information; from the perspective of data flow, the multi-level caching mechanism in the cross-domain transmission process makes privacy data face the risk of multi-point exposure, and from the perspective of the regulatory system, there is still institutional lag in the definition of rights and responsibilities in the existing legal framework for dealing with new network topologies.

[0003] The integration and innovation of the blockchain-based decentralized identity management architecture and cryptography technologies such as zero-knowledge proof provide a systematic solution path for solving the privacy protection dilemma in this complex scenario. In essence, the traditional centralized identity authentication mechanism is difficult to adapt to the dynamic networking characteristics of edge nodes. Especially in the process of real-time interaction of user behavior data through adjacent computing nodes, the separated storage requirement of identity identifiers and behavior trajectories has become the key bottleneck restricting the improvement of privacy protection efficiency. Summary of the Invention

[0004] Aiming at the deficiencies of the existing technology, the purpose of the present invention is to provide an edge network security calculation method, system and device based on improved entangled polynomial coding, which has the advantages of realizing the privacy input protection of terminal devices and achieving a better secret recovery threshold under the improved entangled polynomial coding technology.

[0005] The above object of the present invention is achieved through the following technical solutions:

[0006] An edge network security calculation method based on improved entangled polynomial coding includes four stages: a secret sharing stage, a data calculation stage, an edge node communication stage, and a secret reconstruction stage in sequence;

[0007] The private data of different devices are input in the four stages, and through polynomial coding, a secret-sharing polynomial is obtained. The terminal device generates edge computing nodes through the public coin protocol;

[0008] Introduce polynomial F i , calculate for each edge computing node, and construct polynomial H(X);

[0009] The edge node calculates polynomial G through polynomial H(X) and the highest degree n(X), the edge node utilizes G n (X) to calculate G n (α n '), and then sums them up to calculate the polynomial I(α n '), and then sends it to the cloud server;

[0010] The cloud server obtains the private data through interpolation.

[0011] In a preferred example, the present invention can be further configured as: a system, including a secret sharing module, a data calculation module, an edge node communication module, and a secret reconstruction module, and the system implements an edge network security calculation method based on an improved entangled polynomial encoding;

[0012] The secret sharing module includes a data preprocessing unit, a polynomial generator, and a secret sharder;

[0013] The data calculation module includes a verification unit and an error detector;

[0014] The edge node communication module includes a message authentication unit and a bandwidth optimizer;

[0015] The secret reconstruction module includes a shared collection unit, an interpolation calculation unit, an error detection and correction unit, and a security verification unit;

[0016] The secret sharing module generates secret shares and distributes them to the edge nodes of the data calculation module through a secure channel;

[0017] The data calculation module generates a calculation result and a polynomial interactive oracle protocol commitment, and transfers them to other nodes or cloud verifiers through the edge node communication module.

[0018] In a preferred example, the present invention can be further configured as: the secret sharing module is used to perform a unique private input on each private data, and then encodes the private data through a polynomial to obtain the secret sharing polynomial F i , and then selects a number a in the domain through the public coin protocol n , and sends F i (a n ) to the a-th edge computing node;

[0019] The subscript n represents the n-th node of edge computing;

[0020] Data calculation module: When an edge computing node receives the shared information F(a n ) sent by i terminal devices, through at least two terminal devices, calculates the polynomial F i through the edge computing point, constructs the polynomial H(X), and then constructs G n (X);

[0021] Edge node communication module: The edge node uses G n (X) to calculate G n (α n '), where n'≠n, and calculates I(α n ) by summation and sends it to the cloud server;

[0022] Secret reconstruction module: The cloud server restores the private data by interpolation.

[0023] In a preferred example of the present invention, it can be further configured that in the data calculation module, each edge computing node calculates H(a n ) = F A (a n )F B (a n )… where the corresponding polynomial For the form of, the highest degree l can be obtained from the formula l = 2·(u + z), where u is the highest degree of multiplication from the coding term and z represents the highest degree of the random secret term; thus, H1, H3, H5, H7… are the coefficients to be obtained. Here, G n (X) is constructed, and each edge computing node only calculates The product of and H(α n ), that is:

[0024]

[0025] All edge computing nodes know the coefficients Here, A and B refer to different terminal devices, and the omitted part is other terminal devices.

[0026] A device configured with an edge network security computing system based on improved entangled polynomial coding.

[0027] In summary, the present invention includes at least one of the following beneficial technical effects:

[0028] 1. It can achieve a relatively small secret recovery threshold;

[0029] 2. It realizes the privacy protection of the private input of the terminal device;

[0030] 3. It extends the technology of polynomial coding for privacy protection to the application scenario in the edge network environment;

[0031] 4. Adopting the edge network architecture, compared with the previous cloud network architecture, it can achieve the characteristic of decentralization. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] Figure 1 It is a relationship diagram among the modules of this solution;

[0033] Figure 2 It is a secure computing architecture under the edge network;

[0034] Figure 3 Interaction diagram between the terminal device and the edge node;

[0035] Figure 4 Interaction diagram between the edge node and the cloud server. Specific implementation manner

[0036] The present invention will be further described in detail below with reference to the accompanying drawings.

[0037] As Figures 1-3 shown, a secure computing method for an edge network based on improved entangled polynomial coding disclosed in this technical solution includes four stages: sequentially a secret sharing stage, a data calculation stage, an edge node communication stage, and a secret reconstruction stage;

[0038] In the four stages, the private data of different devices is input, and through polynomial coding, a polynomial for secret sharing is obtained. The terminal device generates edge computing nodes through the public coin protocol;

[0039] Introduce polynomial F i , perform calculations on each edge computing node, and construct polynomial H(X);

[0040] The edge node calculates polynomial G n (X) through polynomial H(X) and the highest degree. The edge node uses G n (X) to calculate G n (α n '), and then sums to calculate polynomial I(α n '), and then sends it to the cloud server;

[0041] The cloud server obtains the private data through interpolation.

[0042] Furthermore, based on a method described in the above solution, this technical solution also provides a system, including a secret sharing module, a data calculation module, an edge node communication module, and a secret sharing module. The system implements the secure computing method for the edge network based on improved entangled polynomial coding in claim 1;

[0043] The secret sharing module includes a data preprocessing unit, a polynomial generator, and a secret sharder; Function: Split sensitive data into secret shares and distribute them to edge nodes to ensure privacy and fault tolerance.

[0044] Data preprocessing unit: Format the input data into a numerical form.

[0045] Polynomial Generator: Based on AGE-CMPC to generate entangled polynomials and construct secret shares.

[0046] Secret Sharder: Adopts Shamir secret sharing to generate n shares with threshold t.

[0047] Parameters: The polynomial order is t - 1, the number of shares n ≥ 3t + 1, and the hash function is SHA-256.

[0048] The data calculation module includes a verification unit and an error detector; main functions: perform distributed calculations, verify the correctness of results, and prevent malicious nodes from tampering.

[0049] Verification Unit: Implements the PIOP protocol and combines Fiat-Shamir transformation to generate non-interactive verification.

[0050] Error Detector: Detects abnormal calculations and prevents poisoning / collusion attacks.

[0051] Parameters: The number of verification points is 2 - 5, the AGE-CMPC gap parameter α = 0.5, and the task type supports linear / non-linear operations.

[0052] The edge node communication module includes a message authentication unit and a bandwidth optimizer; main functions: manage secure communication between nodes, and transmit secret shares and calculation results.

[0053] Message Authentication Unit: Verifies message integrity with HMAC-SHA256 and Schnorr signature authentication.

[0054] Bandwidth Optimizer: Gradient compression, multi-channel communication.

[0055] Secure Storage Unit: Stores keys with HSM / TEE, based on Shamir sharding.

[0056] Key Update Unit: Periodically refreshes keys and generates efficient XOR polynomials.

[0057] Parameters: The key length is 256 bits, the update period is 24 hours, and the storage requirement is 1 - 10 KB / node.

[0058] The secret reconstruction module includes a share collection unit, an interpolation calculation unit, an error detection and correction unit, and a security verification unit.

[0059] The secret sharing module generates secret shares and distributes them to the edge nodes of the data calculation module through a secure channel;

[0060] The data calculation module generates calculation results and PIOP commitments, and transmits them to other nodes or cloud verifiers through the edge node communication module.

[0061] Further, the secret sharing module is used to perform a unique private input on each private data, and then encode the private data through a polynomial to obtain the polynomial F of the secret sharing i , and then select a number a in the domain through the public coin protocol n , and send F i (a n ) to the a-th edge computing node;

[0062] Specifically: In this stage, each data source (terminal device) will have its own private input The first step is to encode these private data through a polynomial to obtain After that, in this process, the terminal device will randomly select a number α in the domain using the public coin protocol n (n subscript represents the n-th node of edge computing), and send F i (α n ) to the a-th edge computing node, and at this time the secret sharing stage ends.

[0063] n subscript represents the n-th node of edge computing;

[0064] Data calculation module: When an edge computing node receives the shared information F(a n ) sent by i terminal devices, through at least two terminal devices, calculate the polynomial F i Perform calculations through the edge computing point to construct the polynomial H(X), and then construct G n (X);

[0065] Specifically: When an edge computing node receives the shared information F(α n ) sent by i terminal devices, here take the shared information of two terminal devices A and B as an example: Each edge computing node will calculate H(α n ) = F A (α n )F B (α n ), where the corresponding polynomial H(X) = F A (X)F B (X) can be expressed as: The form of, for the highest degree l, it can be obtained by the formula l = 2·(u + z), where u is the highest degree of multiplication from the encoding term, and z represents the highest degree of the random secret term. Thus, H1, H3, H5, H7 are the coefficients to be obtained. Here, a new polynomial is constructed, and each edge computing node only calculates The product of and H(α n ), that is:

[0066] All edge computing nodes have known coefficients

[0067] Edge node communication module: The edge node uses G n (X) to calculate G n (α n '), where n'≠n, and calculates I(α n ) through summation and sends it to the cloud server;

[0068] Specifically, in this stage, the edge node uses the polynomial G n (x) it constructs to calculate G n (α n′ ), where n′≠n. Therefore, after sharing in this stage, each edge computing stage can calculate G n (α n′ ) corresponding to all random numbers. After that, sum to calculate Send this to the cloud server. Due to the secret terms added in G n (X), no data will be leaked in this stage.

[0069] Secret reconstruction module: The cloud server restores the private data through interpolation.

[0070] In this stage, each edge computing node will send its calculation result to the cloud server. For the cloud server to restore the secret information through interpolation

[0071]

[0072] It can be seen that at least 6 edge computing nodes are required here to calculate the polynomial I(X), that is, the recovery threshold is 6. The first four terms in I(X) contain the calculation results. That is, as long as the cloud server restores the polynomial I(X), it can obtain the calculation results, so that the calculation can be completed while protecting privacy.

[0073] Furthermore, based on a system described in the above solution, the present technical solution also provides a device, which includes the above system and is used to execute the method for realizing edge network security based on improved entangled polynomial coding described above, which will not be elaborated here.

[0074] The embodiments of the specific implementation manners are all preferred embodiments of the present invention. Without restricting the protection scope of the present invention based on this, therefore: All equivalent changes made according to the structure, shape, and principle of the present invention should be covered within the protection scope of the present invention.

Claims

1. An edge network security computing method based on improved entangled polynomial coding, characterized in that, It includes four stages: the secret sharing stage, the data calculation stage, the edge node communication stage, and the secret reconstruction stage in sequence; The four stages input the private data of different devices, and through polynomial encoding, obtain the polynomial of secret sharing. The terminal device generates edge computing nodes through the public coin protocol; Introduce polynomial F i , perform calculations on each edge computing node to construct polynomial H(X); The edge node calculates polynomial G through polynomial H(X) and the highest degree n (X), and the edge node uses G n (X) to calculate G n (α n' ). Then, it sums to calculate polynomial I(α n' ), and then sends it to the cloud server; The cloud server obtains the private data through interpolation.

2. A system, characterized in that, It includes a secret sharing module, a data calculation module, an edge node communication module, and a secret reconstruction module. The system implements the edge network security calculation method based on the improved entangled polynomial encoding in claim 1; The secret sharing module includes a data preprocessing unit, a polynomial generator, and a secret sharder; The data calculation module includes a verification unit and an error detector; The edge node communication module includes a message authentication unit and a bandwidth optimizer; The secret reconstruction module includes a shared collection unit, an interpolation calculation unit, an error detection and correction unit, and a security verification unit; The secret sharing module generates secret shares and distributes them to the edge nodes of the data calculation module through a secure channel; The data calculation module generates a calculation result and a polynomial interactive oracle protocol commitment, and transmits them to other nodes or cloud verifiers through the edge node communication module.

3. The edge network security system based on the improved entangled polynomial encoding according to claim 2, wherein The secret sharing module is used to perform a unique private input for each private data, and then encode the private data through a polynomial to obtain the polynomial F of the secret sharing i , then select a number a in the field through the public coin protocol n , and send F i (a n ) to the a-th edge computing node; The subscript n represents the nth node of edge computing; Data calculation module: When an edge computing node receives the shared information F(a n ) sent by i terminal devices, through at least two terminal devices, for the polynomial F i Perform calculations through the edge computing point to construct the polynomial H(X), and then construct G n (X) through the highest degree l; Edge node communication module: The edge node uses G n (X) to calculate G n (α n' ), where n'≠n, calculates I(α n' ) through summation, and sends it to the cloud server; The secret reconstruction module: The cloud server recovers the private data through interpolation.

4. An edge network security system based on an improved entangled polynomial coding according to claim 3, characterized in that, In the data calculation module, each edge computing node calculates H(a n ) = F A (a n )F B (a n )… where the corresponding polynomial is in the form that for the highest degree l, it can be obtained from the formula l = 2·(u + z), where u is the highest degree of multiplication from the encoding terms and z represents the highest degree of the random secret terms; thus, H1, H3, H5, H7… are the coefficients to be obtained. Here, G n (X) is constructed, and each edge computing node only calculates the product with H(α n ), that is: All edge computing nodes have known coefficients Here, A and B refer to different terminal devices, and the omitted part refers to other terminal devices.

5. A device, characterized in that, It is configured with the system of claims 2-4.

Images