Distributed secret sharing method and system with efficient storage and storage medium

Abstract

The invention relates to the technical field of privacy computing, and discloses an efficient storage distributed secret sharing method and system and a storage medium, and the method comprises the following steps: determining the share in a storage node in advance; determining a storage node authorized access subset of the user; constructing a linear secret sharing equation, and calculating and disclosing auxiliary secret recovery parameters through an extended Euclidean algorithm; the user downloads the corresponding share according to the storage node of the authorized access set and recovers the secret data in combination with the public parameters; and dynamically expanding the storage nodes to support the requirements of new users. According to the distributed secret sharing system and method, the expandability and the storage efficiency of the distributed secret sharing system are improved by achieving balanced storage uploading and dynamic expansion mechanisms, the delay inconsistency and the node fault risk caused by uneven share storage are avoided, in addition, the safety of the system is enhanced, it is ensured that a user can only access authorized nodes, and the user experience is improved. Therefore, data leakage is effectively prevented, and a more reliable and flexible secret sharing environment is provided.

Description

Technical Field

[0001] The present invention relates to the field of privacy computing technology, and specifically to an efficient storage distributed secret sharing method, system and storage medium. Background Art

[0002] In today's Internet era, distributed systems have become an important support for technologies such as cloud computing, big data analysis, and artificial intelligence due to their advantages in improving business continuity and optimizing resource utilization. However, distributed systems face challenges in data security. Data is stored in multiple nodes in a decentralized manner, which may become a security risk point. Attackers can gain unauthorized access to sensitive information through unencrypted communications or weak authentication, causing significant losses.

[0003] Existing distributed secret sharing schemes can effectively prevent data leakage and ensure that sensitive information is visible only to authorized users. This scheme uses data encoding and distribution mechanisms to ensure that even if some nodes are attacked or fail, secret information can still be safely protected, thus having strong fault tolerance and anti-attack capabilities, and is widely used in finance, government, blockchain and other fields.

[0004] However, existing distributed secret sharing methods usually require data distributors to encode secret data into multiple shares and upload them. As the amount of data increases, the number of shares that storage nodes need to store increases accordingly. This not only makes the system structure complex and difficult to expand, but also causes inconsistent delays between different nodes due to uneven storage, increasing the risk of node failure. Summary of the invention

[0005] In view of the deficiencies in the prior art, the present invention provides a distributed secret sharing method, system and storage medium with efficient storage, which solves the problems of high data storage overhead, uneven data storage, complex system structure and difficulty in expansion in the distributed secret sharing scheme in the prior art.

[0006] To achieve the above objectives, the present invention is implemented through the following technical solutions: a distributed secret sharing method with efficient storage, comprising the following steps:

[0007] Predetermine the shares in the storage nodes;

[0008] Determine the user's authorized access subset of storage nodes;

[0009] Construct a linear secret sharing equation, calculate and publish auxiliary secret recovery parameters;

[0010] The user downloads the corresponding share according to the storage node of the authorized access set, and recovers the secret data through the calculated public parameters;

[0011] Dynamically expand storage nodes to support the needs of new users.

[0012] Preferably, initializing the share allocation of the storage node includes:

[0013] The distributor randomly selects n mutually prime shares;

[0014] The shares are uploaded to n storage nodes, ensuring that each node stores a unique share.

[0015] Preferably, determining the storage node authorized access subset of the user includes:

[0016] Use Sperner's theorem to construct an authorized access subset of storage nodes for each user;

[0017] Ensure that each user's access set does not overlap to prevent users from obtaining other users' secret data.

[0018] Preferably, constructing a linear secret sharing equation includes:

[0019] Construct the corresponding linear equation for each user's secret data;

[0020] The user's share of the authorized access set is used as the coefficient of the equation.

[0021] Preferably, calculating and publishing the auxiliary secret recovery parameter comprises:

[0022] Auxiliary parameters are calculated using the extended Euclidean algorithm;

[0023] Make the calculated auxiliary parameters public and accessible to all users.

[0024] Preferably, the user recovers secret data according to the storage node authorized to access:

[0025] Download the shares in the specified node;

[0026] A linear secret sharing equation is constructed by combining the public parameters to recover the secret data.

[0027] Preferably, the dynamically expanded storage node further comprises:

[0028] Implement load monitoring to monitor the load of existing storage nodes in real time to determine when to dynamically expand;

[0029] During the expansion process, secure communication between new storage nodes and existing nodes is maintained to ensure the security of data sharing.

[0030] The present invention also provides a distributed secret sharing system with efficient storage, comprising:

[0031] Secret data distributor, used to allocate storage node shares;

[0032] n storage nodes, used to store the shares uploaded by the distributor;

[0033] m users download and recover secret data according to the nodes they are authorized to access.

[0034] Preferably, the secret data distributor includes:

[0035] A module for generating and distributing unique shares, ensuring that each storage node stores only specific shares;

[0036] The permission management module is used to dynamically update and manage the user's storage node authorization access subset to ensure the security and flexibility of the system when users change;

[0037] The automatic expansion module can automatically expand new storage nodes and allocate corresponding shares to them when it detects that the number of users exceeds the maximum carrying capacity of the current storage node to maintain the efficient operation of the system.

[0038] The present invention also provides a distributed secret sharing storage medium with efficient storage, comprising:

[0039] Multiple storage nodes, each of which is used to store the shares uploaded by the distributor and has a data integrity check function to prevent data tampering;

[0040] The permission management module is used to control the user's access rights to each storage node and implement dynamic updates to adapt to user changes;

[0041] An auxiliary parameter storage unit, used to store the calculated auxiliary secret recovery parameters so that the user can call them during the recovery process;

[0042] The load monitoring module monitors the load of each storage node in real time, and triggers the dynamic expansion mechanism when the load exceeds the set threshold, adding new storage nodes to maintain efficient storage and access performance.

[0043] The present invention provides a distributed secret sharing method, system and storage medium with efficient storage.

[0044] It has the following beneficial effects:

[0045] 1. The present invention ensures that the system can maintain efficient storage and access performance when the number of users increases through dynamic expansion and load monitoring of storage nodes. This flexibility not only improves the scalability of the system, but also enhances the user experience, allowing users to quickly and securely restore secret data.

[0046] 2. The present invention makes user access control more precise and secure by combining the authority management module with the Sperner theorem. Each user can only access the nodes authorized by him / her, thus preventing the risk of data leakage and enhancing the overall security of the system.

[0047] 3. The present invention ensures that the data in the storage node has not been tampered with through the data integrity verification function, thereby improving the credibility of the data. This multi-level security mechanism enhances the reliability of the system when processing sensitive data and provides users with a safe secret sharing environment. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] Figure 1 A distributed secret sharing method model for efficient storage of the present invention;

[0049] Figure 2 The figure is a flow chart of the method of the present invention. DETAILED DESCRIPTION

[0050] The following will be combined with the drawings in the specification of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0051] Please see attached Figure 1 and attached Figure 2 The embodiment of the present invention provides a distributed secret sharing method, system and storage medium for efficient storage, including the following steps:

[0052] The shares in the storage nodes are determined in advance. Through random allocation of shares and redundant design, the security and robustness of the system are enhanced to ensure that data can still be recovered when the storage node fails.

[0053] Determine the user's storage node authorized access subset. Through precise control of access rights, the system effectively prevents data leakage and ensures the security of each user's secret data.

[0054] By constructing a linear secret sharing equation, calculating and disclosing auxiliary secret recovery parameters, the system not only optimizes the efficiency of data recovery, but also simplifies the user's operation steps, making it more intuitive;

[0055] Calculate and disclose auxiliary secret recovery parameters. By disclosing auxiliary recovery parameters, they do not occupy the memory of storage nodes, simplify the structure, reduce storage overhead, lower the user's technical threshold, make the system more convenient to use, and improve the user experience;

[0056] Users download the corresponding shares according to the storage nodes of the authorized access set, and through the calculated public parameters, by simplifying the data recovery process, users can quickly and efficiently recover secret data, thereby improving the practicality and response speed of the system;

[0057] Dynamically expand storage nodes to support the needs of new users. By dynamically expanding storage nodes, the system can flexibly adapt to changes in user needs and ensure efficient storage and access performance, thereby enhancing the scalability and flexibility of the system.

[0058] In a preferred embodiment of the present invention, initializing the share allocation of the storage node includes:

[0059] The distributor randomly selects n mutually prime shares;

[0060] The shares are uploaded to n storage nodes, ensuring that each node stores a unique share of the shares.

[0061] Specifically: the distributor first needs to randomly select n mutually prime shares to ensure that the linear secret sharing equation constructed by the mutually prime shares in the access set has an integer solution of the auxiliary secret recovery parameter, which is unique and effective during data recovery. Next, the distributor uploads these selected shares to n storage nodes according to each user's authorized access subset, and uploads them to n storage nodes according to certain rules. During the upload process, the distributor needs to ensure that each storage node stores a unique share to achieve load balancing and avoid data redundancy, thereby enhancing the security and reliability of the data, so that in the event of node failure, the original data can still be restored through other nodes, reducing the risk of data loss, and through the selection and uniform distribution of mutually prime shares, the data security, recovery efficiency and system stability are improved, so that users can enjoy efficient and reliable secret sharing services during use.

[0062] In a preferred embodiment of the present invention, determining the storage node authorized access subset of the user includes:

[0063] Use Sperner's theorem to construct an authorized access subset of storage nodes for each user;

[0064] Ensure that each user's access set does not overlap to prevent users from obtaining other users' secret data.

[0065] Specifically: Sperner's theorem is an important theorem in combinatorial mathematics, which describes the maximum size of a subset of a set under certain conditions. Through this theory, the distributor can effectively construct the access set of each user so that it can serve the maximum number of users and contain the most storage nodes under the condition that the storage nodes are fixed, without causing information leakage. First, all storage nodes are numbered and organized into a hierarchical structure. Then, according to the needs and permissions of each user, the distributor uses Sperner's theorem to select a suitable subset to ensure that the shares of these nodes are necessary for each user to recover their own secrets without leaking information about other users' secrets. Each user's authorized access set is designed to be independent and non-overlapping, thereby ensuring privacy and data security between users.

[0066] In a preferred embodiment of the present invention, constructing a linear secret sharing equation includes:

[0067] Construct the corresponding linear equation for each user's secret data;

[0068] The user's share of the authorized access set is used as the coefficient of the equation.

[0069] In a preferred embodiment of the present invention, calculating and publishing the auxiliary secret recovery parameter comprises:

[0070] Auxiliary parameters are calculated using the extended Euclidean algorithm;

[0071] Make the calculated auxiliary parameters public and accessible to all users.

[0072] Specifically: the distributor first constructs a multivariate first-order polynomial for each user's secret data. The number of multivariate variables of the function is determined by the threshold required for secret recovery. For example, if you want to recover the secret data in at least k shares, you can use a k-variable first-order polynomial. After determining the polynomial, the distributor will select the corresponding shares as the coefficients of the equation according to the user's authorized access set. Specifically, since the distributor has a certain amount of secret data for user i, s i and access set A i ={x 1 ,...,x k} is known, so the equation can be constructed as follows:

[0073]

[0074] where i∈{1,...,m}, represents the i-th user, represents the kth unknown parameter of the i-th user, due to the share x i ,i∈{1,..,k} are mutually prime, which ensures that the equation has integer solutions. Integer solutions are computed via the extended Euclidean algorithm.

[0075] In a preferred embodiment of the present invention, the user recovers secret data according to the storage node authorized to access:

[0076] Download the shares in the specified node;

[0077] A linear secret sharing equation is constructed by combining the public parameters to recover the secret data.

[0078] Specifically: First, the extended Euclidean algorithm is used to calculate the auxiliary parameters. Second, the calculated auxiliary parameters will be made public to allow all users to access them. In this way, when users recover secret data, they only need to download the shares in the node access set and combine them with the public parameters to recover the data.

[0079] When recovery is required, user i downloads all shares of the recovery secret A through the authorized access set node i ={x 1 ,...,x k}, and then users construct their own linear secret sharing equations based on the collected shares and public auxiliary parameters:

[0080]

[0081] To recover their own secret data i ,Since the selection of shares is random and the combination of k shares is unique, this ensures that each user can download a unique combination of k shares through his / her authorized access set, and the secret that can be recovered is also unique. This process ensures the convenience and effectiveness of the user in data recovery.

[0082] In a preferred embodiment of the present invention, the dynamically expanded storage node further comprises:

[0083] Implement load monitoring to monitor the load of existing storage nodes in real time to determine when to dynamically expand;

[0084] During the expansion process, the Sperner theorem is used to determine the access set for the newly added nodes and maintain secure communication between the new storage nodes and the existing nodes to ensure the security of data sharing.

[0085] Specifically: First, the user downloads the corresponding shares from the authorized storage node. After the user logs in to the system, the system will automatically identify the storage node access rights he has based on his identity verification results. The user then requests to download the shares stored in the corresponding node through the network. These shares are generated based on the previous distribution of secret data and are usually stored in encrypted or encoded form. Secondly, the user uses the downloaded shares and the previously disclosed auxiliary parameters combined with the linear secret sharing equation to recover the secret data; this process ensures that the user can effectively recover the complete secret information from multiple shares;

[0086] The principle of recovering secret data at the same time is mainly based on the theory of linear secret sharing. In distributed secret sharing, secret data is divided into multiple shares, which are distributed according to a certain linear relationship; storage nodes store part of the secret information. When users need to recover the secret, they download these shares based on their access rights.

[0087] The present invention also provides a distributed secret sharing system with efficient storage, comprising:

[0088] Secret data distributor, used to allocate storage node shares;

[0089] n storage nodes, used to store the shares uploaded by the distributor;

[0090] m users download and recover secret data according to the nodes they are authorized to access.

[0091] Specifically: By implementing load monitoring, the system can automatically expand under high load conditions, improving the performance and reliability of the system. Secure communication management ensures that the addition of new nodes does not pose a security risk, thereby protecting the confidentiality and integrity of the data. At the same time, through the combination of dynamic expansion and secure communication, the system has flexibility and security when facing load changes. This not only improves the system's responsiveness under high concurrency conditions, but also protects the privacy and security of user data, providing users with a more stable and secure distributed storage environment.

[0092] In a preferred embodiment of the present invention, the secret data distributor comprises:

[0093] A module for generating and distributing unique shares, ensuring that each storage node stores only specific shares;

[0094] The permission management module is used to dynamically update and manage the user's storage node authorization access subset to ensure the security and flexibility of the system when users change;

[0095] Automatic expansion module, when it detects that the number of users exceeds the maximum carrying capacity of the current storage node, it can automatically expand new storage nodes and allocate corresponding shares to them to maintain the efficient operation of the system;

[0096] Specifically: First, the module that generates and allocates unique shares is responsible for creating unique shares. These shares need to be mutually prime. After generation, the distributor allocates these shares to n storage nodes to ensure that each node only stores a specific share to reduce the risk of data leakage; secondly, the permission management module is an important part of the system. It is responsible for dynamically managing users' authorized access to storage nodes. Through the permission management module, the system can adjust the access rights of storage nodes in real time according to user changes to ensure that only authorized users can access the corresponding secret data; finally, the automatic expansion module plays a key role when the system load is too high. When it is detected that the number of users exceeds the maximum carrying capacity of the current storage node, the module can automatically expand the new storage node and allocate corresponding shares to it. This process ensures that the system can always maintain an efficient operating state and avoid performance degradation due to insufficient nodes.

[0097] The present invention also provides a distributed secret sharing storage medium with efficient storage, comprising:

[0098] Multiple storage nodes, each of which is used to store the shares uploaded by the distributor and has a data integrity check function to prevent data tampering;

[0099] The permission management module is used to control the user's access rights to each storage node and implement dynamic updates to adapt to user changes;

[0100] An auxiliary parameter storage unit, used to store the calculated auxiliary secret recovery parameters so that the user can call them during the recovery process;

[0101] The load monitoring module monitors the load of each storage node in real time, and triggers the dynamic expansion mechanism when the load exceeds the set threshold, adding new storage nodes to maintain efficient storage and access performance.

[0102] Specifically: the permission management module dynamically manages the user's access rights and uses the access control algorithm to perform real-time updates based on the user role to ensure that the system adapts to user changes; at the same time, the auxiliary parameter storage unit stores auxiliary parameters in the secret recovery process to improve data recovery efficiency; in addition, the load monitoring module tracks the node load in real time, automatically triggers the dynamic expansion mechanism, and adds new nodes to maintain efficient performance.

[0103] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.

Claims

1. A distributed secret sharing method with efficient storage, characterized in that: The following steps are involved: Predetermine the shares in the storage nodes; Determine the user's authorized access subset of storage nodes; Construct a linear secret sharing equation, calculate and publish auxiliary secret recovery parameters; The user downloads the corresponding share according to the storage node of the authorized access set and recovers the secret data through the calculated public parameters; Dynamically expand storage nodes to support the needs of new users.

2. The distributed secret sharing method with efficient storage according to claim 1, characterized in that: Initializing the storage node share allocation includes: The distributor randomly selects n mutually prime shares; The shares are uploaded to n storage nodes, ensuring that each node stores a unique share.

3. The distributed secret sharing method with efficient storage according to claim 1, characterized in that: Determine the user's authorized access subset of storage nodes including: Use Sperner's theorem to determine the authorized access set of storage nodes for each user; Ensure that each user's access set does not overlap to prevent users from obtaining other users' secret data.

4. The distributed secret sharing method with efficient storage according to claim 1, characterized in that: Constructing the linear secret sharing equation includes: Construct the corresponding linear equation for each user's secret data; The user's share of the authorized access set is used as the coefficient of the equation.

5. The distributed secret sharing method with efficient storage according to claim 1, characterized in that: The auxiliary secret recovery parameters are calculated and disclosed including: Auxiliary parameters are calculated using the extended Euclidean algorithm; Make the calculated auxiliary parameters public and accessible to all users.

6. The distributed secret sharing method with efficient storage according to claim 1, characterized in that: The storage nodes that users can access based on their authorization to recover secret data include: Download the shares in the specified node; A linear secret sharing equation is constructed by combining the public parameters to recover the secret data.

7. The distributed secret sharing method with efficient storage according to claim 1, characterized in that: The dynamically expanded storage node further includes: Implement load monitoring to monitor the load of existing storage nodes in real time to determine when to dynamically expand; During the expansion process, secure communication between new storage nodes and existing nodes is maintained to ensure the security of data sharing.

8. A distributed secret sharing system with efficient storage, characterized in that: A distributed secret sharing method with efficient storage using any one of claims 1 to 7, comprising: Secret data distributor, used to allocate storage node shares; n storage nodes, used to store the shares uploaded by the distributor; m users recover secret data based on the download shares of the nodes they are authorized to access.

9. The distributed secret sharing system with efficient storage according to claim 8, characterized in that: Distributors of secret data include: A module for generating and distributing unique shares, ensuring that each storage node stores only specific shares; The permission management module is used to dynamically update and manage the user's storage node authorization access subset to ensure the security and flexibility of the system when the number of users changes; The automatic expansion module can automatically expand new storage nodes and allocate corresponding shares to them when it detects that the number of users exceeds the maximum carrying capacity of the current storage node to maintain the efficient operation of the system.

10. A distributed secret sharing storage medium with efficient storage, characterized in that: A distributed secret sharing method and system with efficient storage as described in any one of claims 1 to 9, comprising: Multiple storage nodes, each of which is used to store the shares uploaded by the distributor and has a data integrity check function to prevent data tampering; The permission management module is used to control the user's access rights to each storage node and implement dynamic updates to adapt to user changes; An auxiliary parameter storage unit, used to store the calculated auxiliary secret recovery parameters so that the user can call them during the recovery process; The load monitoring module monitors the load of each storage node in real time, and triggers the dynamic expansion mechanism when the load exceeds the set threshold, adding new storage nodes to maintain efficient storage and access performance.

Images