A privacy-based computational data authorization and sharing method
By computing the data authorization public and private keys on elliptic curves, a privacy computing structure is constructed, which solves the problems of lack of authorization parties and key leakage risks in existing technologies, and realizes a secure data sharing process.
Patent Information
- Application Number
- CN202310596997.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-05-25
- Publication Date
- 2026-11-17
- Estimated Expiration
- 2043-05-25
AI Technical Summary
Existing technologies lack a data authorization party during data sharing. Data sharing schemes based on symmetric encryption mechanisms require the distribution of symmetric keys through a secure channel in advance, and the data decryption process repeatedly uses a fixed private key for calculation, increasing the risk of key leakage.
A privacy-based computation method is adopted. By selecting temporary private and public keys on an elliptic curve, and using the temporary key of the data authorizing party to calculate the data authorization public and private keys, a privacy multiplication and addition computation structure is constructed to avoid the pre-distribution of symmetric keys and protect the private key from leakage through privacy computation.
Data sharing requires the consent of two authorized parties, avoiding the premature distribution of symmetric keys and the repeated calculation of fixed private keys, reducing the risk of key leakage, and protecting data privacy.
Smart Images

Figure CN116628747B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of data security technology, and more specifically to a data authorization and sharing method based on privacy computing. Background Technology
[0002] Privacy-preserving computation refers to a set of technologies that enable data analysis and computation while protecting the data itself from external disclosure, achieving the goal of making the data "usable but not visible." It aims to transform and release the value of data while fully protecting data and privacy. Currently, mainstream privacy-preserving computation technologies fall into three main categories: the first is cryptography-based privacy-preserving computation, represented by multi-party secure computation; the second is technologies derived from the integration of artificial intelligence and privacy protection technologies, represented by federated learning; and the third is privacy-preserving computation technologies based on trusted hardware, represented by trusted execution environments. These different technologies are often used in combination to complete data computation and analysis tasks while ensuring the security and privacy of the original data.
[0003] Currently, data sharing is carried out using cloud storage node-based data sharing schemes, including data sharing schemes based on symmetric encryption mechanisms and data sharing schemes based on asymmetric encryption mechanisms.
[0004] The main process of building a cloud data sharing solution using symmetric encryption mechanisms is as follows:
[0005] (1) The data provider uses a symmetric key to encrypt the data, and the resulting ciphertext is stored in the storage node STO.
[0006] (2) The data provider uses out-of-band channels to directly provide symmetric keys to the data users.
[0007] (3) Data users download encrypted data from cloud storage node STO and decrypt it using the symmetric key obtained directly from the data provider.
[0008] The main process of building a cloud data sharing solution using asymmetric encryption mechanisms is as follows:
[0009] (1) The data holder, the data provider, uses a symmetric key to encrypt the data, and the resulting ciphertext is stored in the storage node STO.
[0010] (2) The data holder, the data provider, uses the data user's public key to encrypt the symmetric key, generating a symmetric key digital envelope. The resulting digital envelope is uploaded and stored on the storage node STO, or it can be delivered to the data user through other communication channels.
[0011] (3) Data users download encrypted data from cloud storage node STO, decrypt the digital envelope using the private key, and obtain the symmetric key for decryption.
[0012] The above solution has the following disadvantages:
[0013] (1) During the data sharing process, there is a lack of data authorization parties.
[0014] (2) Data sharing schemes based on symmetric encryption mechanisms require the symmetric key to be distributed in advance through a secure channel.
[0015] (3) The data decryption process repeatedly uses a fixed private key for calculation, which may cause key leakage.
[0016] (4) Using the full private key in the data decryption process may increase the risk of exposing the private key to data. Summary of the Invention
[0017] To address the shortcomings of existing technologies, this invention aims to provide a data authorization and sharing method based on privacy computing.
[0018] To achieve the above objectives, the present invention adopts the following technical solution:
[0019] A data authorization and sharing method based on privacy computing includes the following steps:
[0020] Step 1: The data holder calculates the data authorization public key:
[0021] (1.1) The data holder selects Data Authorizer 1 and Data Authorizer 2 as the authorizers of the data sent to the data recipient in this transaction;
[0022] On the elliptic curve E over a finite field, choose a cyclic group G of prime order p, with generator P, and select a secure hash function H: The data holder randomly selects parameters. As a temporary private key, the corresponding temporary public key Pub tmp_alice =Pri tmp_alice *P; The data acquisition party randomly selects parameters. As the private key, the corresponding public key is Pub. bob =Pri bob *P; Data authorizer randomly selects parameters. As the private key, the corresponding public key is Pub. andy =Pri andy *P; Randomly select parameters As a temporary private key; the second data authorizer randomly selects parameters. As the private key, the corresponding public key is Pub. woody =Pri woody *P; Randomly select parameters As a temporary private key;
[0023] (1.2) The data holder communicates with the data authorizer, who uses its own temporary private key Pritmp_andy And the public key Pub of the second data authorizer woody Calculate Auth andy =Pri tmp_andy *Pub woody , calculate the Auth andy Send to the data holder;
[0024] (1.3) The data holder communicates with the data authorizing party two, and the data authorizing party two uses its own temporary private key Pri tmp_woody Public key of data authorizer 1 andy Calculate Auth woody =Pri tmp_woody *Pub andy The calculated Auth woody Send to the data holder;
[0025] (1.4) At this point, the data holder has obtained a set of values [Auth] andy Auth woody ], as the public key for data authorization;
[0026] Step 2: The data holder encrypts and uploads the data.
[0027] (2.1) The data holder uses the data authorization public key [Auth] obtained in step one. andy Auth woody ], and the public key Pub of the data acquisition party. bob Generate a temporary encrypted public key Pub data ;
[0028] (2.2) Data holder encrypts data:
[0029] The data holder uses the temporary encrypted public key Pub data Encrypt the data to be uploaded and generate ciphertext Data. enc ;
[0030] (2.3) Data holder uploads encrypted data:
[0031] The data holder will [Pub] tmp_alice Data enc As encrypted data, it is uploaded to the data sharing node STO;
[0032] Step 3: The data user calculates the data authorization private key:
[0033] (3.1) Construct a privacy computing structure, which includes: 4 privacy multiplication computing nodes Mul_1, Mul_2, Mul_3, and Mul_4, and 2 privacy addition computing nodes Add_1 and Add_2;
[0034] (3.2) Using the privacy computation structure established in step (3.1), and following the privacy multiplication operation method, Data Authorizer 1 and Data Authorizer 2 respectively calculate Pri tmp_andy *Pri woody and Pri tmp_woody *Pri andy ;
[0035] (3.3) Using the privacy-preserving computation structure established in step (3.1), and following the privacy-preserving addition operation method, the two intermediate data summation nodes calculate (Pri... tmp_andy *Pri woody +Pri tmp_woody *Pri andy ), as the private key for data authorization;
[0036] Step 4: The data user obtains and decrypts the data.
[0037] (4.1) The data acquirer downloads the encrypted data uploaded by the data holder from the shared node STO [Pub] tmp_alice Data enc ];
[0038] (4.2) The data acquirer uses the Pub file in the encrypted data uploaded by the data holder. tmp_alice and data authorization private key (Pri tmp_andy *Pri woody +Pri tmp_woody *Pri andy They jointly calculated the temporary encrypted private key Pri. data :
[0039] (4.3) Data acquisition party decrypts the data:
[0040] The data acquirer uses the calculated temporary encrypted private key Pri data Decrypt shared data enc , generate plaintext.
[0041] Furthermore, in step (2.1), Pub data Calculate using the following formula:
[0042] Pub data =Hash(Pri tmp _ alice *
[0043] (Pritmp_andy *Pub woody +Pri tmp_woody *Pub andy )+Pri tmp_alice *Pub bob )*P+Pri tmp_andy *Pub woody +Pri tmp_woody *Pub andy .
[0044] Furthermore, in step (2.2), the data to be uploaded is encrypted using digital envelope technology.
[0045] Furthermore, in step (4.2), Pri data Calculate using the following formula:
[0046] Pri data =
[0047] Hash = Pub tmp_alice *(Pri tmp_andy *Pri woody +Pri tmp_woody *Pri andy )+Pub tmp_alice *Pri bob )+Pri tmp_andy *Pri woody +Pri tmp_woody *Pri andy .
[0048] The beneficial effects of this invention are as follows:
[0049] (1) The method of the present invention adds two data licensors, and data sharing requires the consent of the two licensors. The data holder needs to obtain the data licensor public key in advance, and the data licensor public key is calculated by the two data licensors using their own temporary private key and the other party's public key.
[0050] (2) In the method of the present invention, the data encryption and data authorization processes are based on the elliptic curve DH key exchange principle, and there is no need to distribute the symmetric key in advance through the secure channel.
[0051] (3) In the method of the present invention, temporary keys are used in the generation process of data authorization key and data encryption key. By using temporary keys and fixed keys to calculate blind fixed keys, the calculation of fixed private keys can be avoided repeatedly, and the fixed keys can be protected from being leaked.
[0052] (4) The method of the present invention uses privacy computing to protect the private key, avoids using the complete private key to participate in the calculation, and reduces the risk of data exposure of the private key in the calculation process.
[0053] Specifically, this invention constructs a multiplication and addition algebraic operation structures and utilizes privacy-preserving arithmetic operations to ensure that the complete private key does not appear at any stage of the calculation process involving the private key, thereby protecting the private key from leakage. Attached Figure Description
[0054] Figure 1 This is a schematic diagram of the architecture for implementing the method in Embodiment 1 of the present invention;
[0055] Figure 2 This is a schematic diagram of the privacy computing structure in Embodiment 1 of the present invention;
[0056] Figure 3 This is a schematic diagram illustrating the principle of the privacy multiplication operation method of the present invention;
[0057] Figure 4 This is a schematic diagram illustrating the principle of the privacy addition operation method of the present invention;
[0058] Figure 5 This is a schematic diagram illustrating the implementation of the privacy multiplication method in Embodiment 1 of the present invention;
[0059] Figure 6 This is a schematic diagram illustrating the implementation of the privacy addition operation method in Embodiment 1 of the present invention. Detailed Implementation
[0060] The present invention will be further described below with reference to the accompanying drawings. It should be noted that this embodiment is based on the present technical solution and provides detailed implementation methods and specific operation processes, but the protection scope of the present invention is not limited to this embodiment.
[0061] Example 1
[0062] This embodiment provides a data authorization and sharing method based on privacy computing, such as... Figure 1 As shown, there are four participating parties:
[0063] (1) Data holder: Alice
[0064] (2) Data Acquisition Party: Bob
[0065] (3) Two data licensors: Andy and Woody
[0066] (4) Data sharing node: STO
[0067] The method in this embodiment mainly consists of four steps: (1) the data holder calculates the data authorization public key; (2) the data holder encrypts the data and uploads it; (3) the data user calculates the data authorization private key; and (4) the data user obtains the data and decrypts it.
[0068] Before starting sharing, perform initialization:
[0069] (1) On the elliptic curve E over a finite field, choose a cyclic group G of prime order p, with generator P. Choose a secure hash function H:
[0070] (2) Alice randomly selects parameters As a temporary private key, the corresponding temporary public key Pub tmp_alice =Pri tmp_alice *P.
[0071] (3) Bob randomly selects parameters As the private key, the corresponding public key is Pub. bob =Pri bob *P.
[0072] (4) Andy randomly selects parameters As the private key, the corresponding public key is Pub. andy =Pri andy *P. Randomly select parameters As a temporary private key.
[0073] (5) Woody randomly selects parameters As the private key, the corresponding public key is Pub. woody =Pri woody *P. Randomly select parameters As a temporary private key.
[0074] The parameters for each party are now shown in Table 1.
[0075] Table 1
[0076]
[0077] The specific process of the method in this embodiment is as follows:
[0078] Step 1: The data holder calculates the data authorization public key:
[0079] (1.1) Alice selected Andy and Woody as the authorized parties for the data sent to Bob.
[0080] (1.2) Alice communicates with Andy, and Andy uses his own temporary private key Pri tmp_andy And Woody's public key Pub woody Calculate Auth andy =Pri tmp_andy *Pub woody , calculate the Auth andy Send it to Alice.
[0081] (1.3) Alice communicates with Woody, who uses his temporary private key Pri tmp_woody Andy's public key Pub andy Calculate Auth woody =Pri tmp_woody *Pub andy The calculated Auth woody Send it to Alice.
[0082] (1.4) At this point, Alice has obtained a set of values [Auth] andy Auth woody ], as the public key for data authorization.
[0083] Step Two: The data holder encrypts and uploads the data.
[0084] (2.1) Alice uses the data obtained in step one to authorize the public key [Auth]. andy Auth woody ], and Bob's public key Pub bob Generate a temporary encrypted public key Pub data :
[0085] Pub data =Hash(Pri tmp_alice *(Pri tmp_andy *Pub woody +Pri tmp_woody *Pub andy )+Pri tmp_alice *Pub bob )*P+Pri tmp_andy *Pub woody +Pri tmp_woody *Pub andy .
[0086] Where P is a generator of the prime-order p-order cyclic group G on the elliptic curve E. Alice's temporary private key is Pri. tmp_alice The corresponding temporary public key is Pub. tmp_alice .
[0087] (2.2) Alice encrypts data:
[0088] Alice uses the temporary encrypted public key Pub data Encrypt the data to be uploaded (using digital envelope technology) to generate ciphertext Data. enc .
[0089] (2.3) Alice uploads encrypted data:
[0090] Alice will [Pub]tmp_alice Data enc As encrypted data, it is uploaded to the data sharing node STO.
[0091] Step 3: The data user calculates the data authorization private key.
[0092] (3.1) Constructing a privacy-preserving computation architecture:
[0093] like Figure 2 As shown, the privacy computing structure includes: four privacy multiplication computing nodes Mul_1, Mul_2, Mul_3, and Mul_4, and two privacy addition computing nodes Add_1 and Add_2.
[0094] (3.2) Calculate using privacy multiplication:
[0095] Using the privacy computation structure established in step (3.1), and following the privacy multiplication method, Andy and Woody respectively calculate Pri tmp_andy *Pri woody and Pri tmp_woody *Pri andy .like Figure 5 As shown.
[0096] It should be noted that the principle of the privacy multiplication method is as follows:
[0097] There are two users, each possessing integers X and Y. They wish to secretly calculate the product of X and Y. This can be achieved by setting up a set (2) of privacy-preserving multiplication calculation nodes and a public integer BeaverTriple triple generator node. This ensures that the values of integers X and Y are not exposed at any point during the entire calculation process, allowing the product of X and Y to be calculated. For example... Figure 3 As shown.
[0098] (3.3) Calculate using privacy addition operation
[0099] Using the privacy-preserving computation structure established in step (3.1), and following the privacy-preserving addition operation method, the two intermediate data summation nodes calculate (Pri tmp_andy *Pri woody +Pri tmp_woody *Pri andy (), used as the private key for data authorization. For example... Figure 6 As shown.
[0100] It should be noted that the principle of the privacy addition operation method is as follows:
[0101] Two users, each possessing integers X and Y, wish to secretly calculate the sum of X and Y. By setting up a set (2) of privacy-preserving addition nodes, the sum of X and Y can be calculated without revealing the values of X and Y at any point during the entire calculation process. For example... Figure 4 As shown.
[0102] Step 4: The data user obtains and decrypts the data.
[0103] (4.1) Bob downloads the encrypted data uploaded by Alice from the shared node STO [Pub] tmp_alice Data enc ].
[0104] (4.2) Bob uses Pub from the encrypted data uploaded by Alice. tmp_alice and data authorization private key (Pri tmp_andy *Pri woody +Pri tmp_woody *Pri andy They jointly calculated the temporary encrypted private key Pri. data :
[0105]
[0106] (4.3) Bob decrypts the data:
[0107] Bob used the calculated temporary encrypted private key Pri data Decrypt shared data enc (Using digital envelope technology), generate plaintext.
[0108] Example 2
[0109] This embodiment provides an application example of the method of Embodiment 1 in the scenario of government data sharing.
[0110] Alice is the data holder, and Andy is the authorized manager of the industry to which the data holder belongs; Bob is the data user, and Woody is the authorized manager of the industry to which the data user belongs; Node STO is a public data exchange.
[0111] Following the method described in Example 1, the data holder and the data user completed a data sharing process with the approval of their respective regulatory agencies.
[0112] Example 3
[0113] This embodiment provides an application example of the method of Embodiment 1 in a data sharing scenario based on a consortium blockchain.
[0114] Alice is the data holder, and Andy is the ingress point of the data holder's consortium chain; Bob is the data user, and Woody is the ingress point of the data user's consortium chain; the node STO represents a consortium chain.
[0115] According to the method in Example 1, the data holder and the data user authorize each other at the entry point of the consortium blockchain, thus completing a data sharing based on the consortium blockchain.
[0116] For those skilled in the art, various corresponding changes and modifications can be made based on the above technical solutions and concepts, and all such changes and modifications should be included within the protection scope of the claims of this invention.
Claims
1. A data authorization and sharing method based on privacy computing, characterized in that, Includes the following steps: Step 1: The data holder calculates the data authorization public key: (1.1) The data holder selects Data Authorizer 1 and Data Authorizer 2 as the authorizers of the data sent to the data recipient in this transaction; On the elliptic curve E over a finite field, choose a cyclic group G of prime order p, with generator P, and select a secure hash function. ; Data holders randomly select parameters As a temporary private key, the corresponding temporary public key = ; The data acquisition party randomly selects parameters. As the private key, the corresponding public key = The data authorizing party randomly selects parameters. As the private key, the corresponding public key = Randomly select parameters As a temporary private key; the second data authorizer randomly selects parameters. As the private key, the corresponding public key = Randomly select parameters As a temporary private key; (1.2) The data holder communicates with the data authorizer, who uses its own temporary private key. The public key of the data authorization party 2 ,calculate = * , calculate Send to the data holder; (1.3) The data holder communicates with the data authorizing party two, and the data authorizing party two uses its own temporary private key. The public key of the data authorization party ,calculate = * Calculated Send to the data holder; (1.4) At this point, the data holder has obtained a set of values [ , ], as the public key for data authorization; Step 2: The data holder encrypts and uploads the data. (2.1) The data holder uses the data authorization public key obtained in step one [ , ], and the public key of the data acquisition party. Generate a temporary encrypted public key ; Calculate using the following formula: =Hash( *( * + * + * )*P+ * + * ; (2.2) Data holder encrypts data: Data holders use temporary encrypted public keys Encrypt the data to be uploaded and generate ciphertext. ; (2.3) Data holder uploads encrypted data: The data holder will [ , As encrypted data, it is uploaded to the data sharing node STO; Step 3: The data user calculates the data authorization private key: (3.1) Construct a privacy computing structure, which includes: 4 privacy multiplication computing nodes Mul_1, Mul_2, Mul_3, and Mul_4, and 2 privacy addition computing nodes Add_1 and Add_2; (3.2) Using the privacy computation structure established in step (3.1), data licensor 1 and data licensor 2 respectively calculate according to the privacy multiplication operation method. * and * ; (3.3) Using the privacy-preserving computation structure established in step (3.1), and following the privacy-preserving addition operation method, the two intermediate data summation nodes calculate ( * + * ), as the private key for data authorization; Step 4: The data user obtains and decrypts the data. (4.1) The data acquirer downloads the encrypted data uploaded by the data holder from the shared node STO. , ]; (4.2) The data acquirer uses the encrypted data uploaded by the data holder. and data authorization private key ( * + * ), jointly calculate temporary encrypted private key ; Calculate using the following formula: = ( * + * + * )+ * + * ; (4.3) Data acquisition party decrypts the data: The data acquirer uses the calculated temporary encrypted private key Decrypt shared data , generate plaintext.
2. The method according to claim 1, characterized in that, In step (2.2), the data to be uploaded is encrypted using digital envelope technology.
Citation Information
Patent Citations
Encrypted call method and apparatus, terminal, and storage medium
WO2022143156A1
Method and system for re-encrypting threshold proxy based on attribute condition
WO2023044963A1
