A collaborative searchable encrypted data sharing method and system

By generating user private keys and collaborative keys, the problem of insufficient collaborative access and fine-grained access control in the existing technology is solved, flexible data sharing and efficient retrieval are realized, and data confidentiality and security are ensured. sex.

CN115694974BActive Publication Date: 2024-12-03GUIZHOU UNIV
View PDF 8 Cites 0 Cited by

Patent Information

Application Number
CN202211337747.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-10-28
Publication Date
2024-12-03
Estimated Expiration
2042-10-28

AI Technical Summary

Technical Problem

The existing searchable encryption technology has shortcomings in multi-person collaborative access and fine-grained access control, making it difficult to achieve flexible access control, especially in data sharing between different groups within the company or between superiors and subordinates.

Method used

The authorized organization generates public parameters, system main private key and group private key, and generates user private keys for each user, including sub-keys, collaboration keys and attribute keys. The data owner encrypts the keyword index and uploads it to the cloud server. , the data user determines whether the access policy tree is satisfied based on the attribute set and the collaborative attributes. If so, decrypts the search result.

Benefits of technology

It realizes the collaborative retrieval of data by multiple people, improves the flexibility of access control, allows collaborative access within the allowed controllable range, ensures the confidentiality of the data and resists co-conspiracy attacks.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115694974B_ABST
    Figure CN115694974B_ABST
Patent Text Reader

Abstract

The present invention provides a collaborative searchable encrypted data sharing method and system, belonging to the field of data sharing, the data sharing method comprises: an authorized agency generates public parameters, a system master private key, a group private key and a user private key; a data owner encrypts a keyword index set according to public parameters, an access policy tree and an attribute set to obtain a ciphertext keyword index; a data user encrypts a keyword to be searched according to public parameters and a user private key to generate a search trap; a cloud server determines whether the attribute set of the data user and the collaborative attribute of the collaborator meet the access policy tree, if so, a decryption keyword index is determined according to the public parameters, the search trap, the ciphertext keyword index, the collaborative key of the data user and the collaborator and the access policy tree; if the decryption keyword index corresponds to the ciphertext keyword index, the corresponding data document is sent to the data user. The collaborative retrieval of data by multiple people is realized, and the flexibility of access control is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of data sharing, and in particular to a collaborative searchable encrypted data sharing method and system. Background Art

[0002] The widespread use of cloud storage has led more users to choose to outsource their data to the cloud for storage. Cloud storage has powerful computing power and storage capacity, which reduces the burden of local data storage and management for users. However, cloud servers are not completely trustworthy and may leak sensitive data related to users, threatening user security. To solve this problem, data should be encrypted before outsourcing to cloud servers. For example, in electronic medical systems, electronic health record data is usually encrypted locally before being uploaded to the cloud for storage. Although encrypted data can ensure privacy, it also makes it difficult for users to access and share data later.

[0003] Searchable encryption is a technology that implements search functions without decrypting ciphertext. It matches documents or records with keywords one by one. When searching, the keywords to be searched are bound to the search private key to form a search trap, and the search trap is uploaded to the cloud service to perform the search operation, and finally the search results are returned. At present, there have been many studies on searchable encryption in terms of efficiency and functionality. In the research on attribute-based searchable encryption, most researchers are studying whether a person's attributes meet the search strategy. However, when a document needs to be accessed by different groups of people in a company or requires a superior to assist a subordinate in accessing it, true fine-grained access is not achieved, and the access control structure is not flexible enough. Summary of the invention

[0004] The purpose of the present invention is to provide a collaborative searchable encrypted data sharing method and system, which can realize collaborative data retrieval by multiple people and improve the flexibility of the access control structure.

[0005] To achieve the above object, the present invention provides the following solutions:

[0006] A collaborative searchable encrypted data sharing method, comprising:

[0007] Generate public parameters, system master private key and group private key of each group through the authorized agency; each group includes multiple users; the group private key of each user in the same group is the same;

[0008] For any user, the authorization agency determines the user private key of the user according to the public parameters, the attribute set of the user and the system master private key; the attribute set of each user includes multiple attributes, and the multiple attributes are divided into common attributes and collaborative attributes; the user private key includes a sub-key, a collaborative key and an attribute key of each attribute;

[0009] The data owner encrypts the keyword index set according to the public parameters, the access policy tree and the attribute set of the data owner to obtain a ciphertext keyword index, and uploads the access policy tree and the ciphertext keyword index to the cloud server; the data owner is a user; the keyword index set includes multiple keywords, each keyword is linked to a corresponding data document;

[0010] The data user encrypts the search keyword according to the public parameters and the user private key of the data user, generates a search trap, and uploads it to the cloud server;

[0011] The cloud server determines whether the access policy tree is satisfied according to the attribute set of the data user and the collaborative attribute of the collaborator. If not, data sharing fails. If satisfied, the decryption keyword index is determined according to the public parameters, the search trap, the ciphertext keyword index, the collaborative key and attribute set of the data user, the collaborative key and collaborative attribute of the collaborator, and the access policy tree.

[0012] It is determined whether the decrypted keyword index exists in the ciphertext keyword index. If so, the retrieval is successful, and the data document corresponding to the keyword to be retrieved is sent to the data user.

[0013] Optionally, generating the public parameters and the system master private key by an authorized institution specifically includes:

[0014] Get security parameters;

[0015] According to the security parameter, two multiplication cyclic groups of order p are determined and

[0016] Generate a bilinear map e from two multiplicative cyclic groups;

[0017] Randomly select the first random number α and the second random number β from the positive integer field modulo p 1 and the third random number β 2 , and determine the hash function H;

[0018] The common parameters are in, and are two multiplication cyclic groups, p is the order of the multiplication cyclic group, e is a bilinear map, α is the first random number, β 1 is the second random number, β 2 is the third random number, g is the generator of the multiplication cyclic group; the system master private key includes the first random number α, the second random number β 1 and the third random number β2 .

[0019] Optionally, the authorization agency determines the user private key of the user according to the public parameter, the attribute set of the user and the system master private key, specifically including:

[0020] The authorization agency checks the group to which the user belongs and determines the group private key of the group to which the user belongs;

[0021] The authorization agency calculates a sub-key according to the system master private key, the group private key of the group to which the user belongs, and the public parameter;

[0022] Randomly selecting a fourth random number, and generating a collaboration key according to a group private key of the group to which the user belongs, the fourth random number and the public parameter;

[0023] For any attribute of the user, an attribute key of the attribute is determined according to the fourth random number, the attribute and the public parameter.

[0024] Optionally, the following formula is used to calculate the key:

[0025]

[0026] Among them, K is the key, g, α, β 1 are all public parameters, θ m The group private key.

[0027] Optionally, the following formula is used to determine the collaboration key:

[0028]

[0029] Among them, E is the collaborative key, g, β 2 are all public parameters, γ is the fourth random number, θ m The group private key.

[0030] Optionally, the attribute key of attribute j is determined using the following formula:

[0031]

[0032] Among them, K j is the attribute key of attribute j, g is the public parameter, γ is the fourth random number, H() is the hash function, a j is the attribute j.

[0033] Optionally, the ciphertext keyword index includes an access strategy tree, a first ciphertext index, a second ciphertext index, a third ciphertext index, and ciphertext components of each node in the access strategy tree;

[0034] The data owner encrypts the keyword index set according to the public parameters, the access policy tree and the attribute set of the data owner to obtain a ciphertext keyword index, which specifically includes:

[0035] Randomly choose a secret value;

[0036] Generate a first ciphertext index, a second ciphertext index, and a third ciphertext index according to the secret value, the public parameter, and the keyword index set;

[0037] Determine the polynomial of each node in the access policy tree according to the secret value; the constant in the polynomial of the root node in the access policy tree is the secret value;

[0038] The ciphertext component of each node is determined according to the polynomial of each node, the public parameter and the attribute set of the data owner.

[0039] Optionally, the data user encrypts the search keyword according to the public parameter and the user private key of the data user to generate a search trap, specifically including:

[0040] Calculating a first trapdoor component according to the data user's sub-key, the public parameter and the keyword to be searched;

[0041] A retrieval trapdoor is determined according to the first trapdoor component, the attribute key of each attribute of the data user, and the collaboration key of the data user.

[0042] Optionally, determining a decryption keyword index according to the public parameters, the retrieval trap, the ciphertext keyword index, the collaboration key and attribute set of the data user, the collaboration key and collaboration attribute of the collaborator, and the access strategy tree specifically includes:

[0043] For any leaf node in the access strategy tree, determine the intermediate quantity of the leaf node according to the common parameter and the polynomial of the leaf node;

[0044] For any non-leaf node in the access strategy tree, starting from the leaf node, according to the polynomials of each child node of the non-leaf node, the collaboration key of the data user, and the collaboration key of the collaborator, the Lagrange interpolation polynomial is used to calculate the intermediate variables of the non-leaf node from bottom to top; the intermediate variable of the root node is a secret value;

[0045] A decryption keyword index is determined according to the intermediate variable of the root node in the access strategy tree, the collaboration key of the data user and the ciphertext keyword index.

[0046] To achieve the above object, the present invention also provides the following solution:

[0047] A collaborative searchable encrypted data sharing system, comprising:

[0048] The authorization agency is used to generate public parameters, a system master private key and group private keys of each group; for any user, the user private key of the user is determined according to the public parameters, the attribute set of the user and the system master private key; each group includes multiple users; the attribute set of each user includes multiple attributes, and the multiple attributes are divided into common attributes and collaborative attributes; the user private key includes a sub-key, a collaborative key and an attribute key of each attribute; the group private key of each user in the same group is the same;

[0049] The data owner is used to encrypt the keyword index set according to the public parameters, the access policy tree and the attribute set of the data owner to obtain a ciphertext keyword index, and upload the access policy tree and the ciphertext keyword index to the cloud server; the data owner is a user; the keyword index set includes multiple keywords, each keyword is linked to a corresponding data document;

[0050] The data user is used to encrypt the search keyword according to the public parameter and the user private key of the data user to generate a search trap;

[0051] The cloud server is used to determine whether the access policy tree is satisfied based on the attribute set of the data user and the collaborative attributes of the collaborator. If not, data sharing fails; if satisfied, a decryption keyword index is determined based on the public parameters, the retrieval trap, the ciphertext keyword index, the collaboration key and attribute set of the data user, the collaboration key and collaboration attributes of the collaborator, and the access policy tree; and to determine whether the decryption keyword index exists in the ciphertext keyword index. If so, the retrieval is successful, and the data document corresponding to the keyword to be retrieved is sent to the data user.

[0052] According to the specific embodiment provided by the present invention, the present invention discloses the following technical effects: public parameters, system master private key and group private keys of each group are generated by an authorization agency, and a user private key is generated for each user, wherein the user private key includes a sub-key, a collaboration key and an attribute key, the data owner encrypts the keyword index set according to the public parameters, the access policy tree and the attribute set of the data owner, obtains a ciphertext keyword index, and uploads the access policy tree and the ciphertext keyword index to the cloud server; the data user encrypts the keyword to be searched according to the public parameters and the user private key of the data user, generates a retrieval trap, and uploads it to the cloud server; the cloud server determines whether the access policy tree is satisfied according to the attribute sets of the data user and the collaborator, if not, the data sharing fails; if satisfied, the decryption keyword index is determined according to the public parameters, the retrieval trap, the ciphertext keyword index, the attribute set of the data user, the collaboration key of the data user, the collaboration key of the collaborator and the access policy tree; it is determined whether the decryption keyword index exists in the ciphertext keyword index, if so, the retrieval is successful, and the data document corresponding to the keyword to be searched is sent to the data user. When the attributes of the data user are not sufficient to access the data, it can be accessed in collaboration with the attributes of the collaborator, which enables collaborative data retrieval by multiple people and improves the flexibility of access control. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

[0054] Figure 1 It is a flow chart of the collaborative searchable encrypted data sharing method of the present invention;

[0055] Figure 2 It is a schematic diagram of the collaborative searchable encrypted data sharing system of the present invention.

[0056] Explanation of symbols:

[0057] Authorization agency-1, data owner-2, data user-3, cloud server-4. DETAILED DESCRIPTION

[0058] The following will be combined with the drawings in the embodiments 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.

[0059] The purpose of the present invention is to provide a collaborative searchable encrypted data sharing method and system, so as to solve the problem that when the attribute authority of a certain user is not sufficient to support retrieval, collaborative retrieval can be performed within a permitted and controllable range through the attributes of another user.

[0060] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the present invention is further described in detail below with reference to the accompanying drawings and specific embodiments.

[0061] Embodiment 1

[0062] like Figure 1 As shown, the collaborative searchable encrypted data sharing method of the present invention includes:

[0063] S1: Generate public parameters, system master private key and group private key of each group through the authorized institution. Each group includes multiple users. The group private key of each group is different. Each project is associated with a different group. For each group m, a unique group key is selected to implicitly indicate which group a specific user belongs to. The group private key of each user in the same group is the same. The group private key of each group is an integer field modulo p. In this embodiment, the authorization agency is an agency that authorizes each user according to the attributes of each user.

[0064] Specifically, step S1 includes:

[0065] S11: Obtain security parameter λ.

[0066] S12: Determine two multiplication cyclic groups of order p according to the security parameter λ and

[0067] S13: Generate bilinear maps from two multiplicative cyclic groups

[0068] S14: From the field of positive integers modulo p Randomly select the first random number α and the second random number β 1 and the third random number β 2 , and determine the hash function In this embodiment, the first random number α and the second random number β 1 and the third random number β 2 As the system master private key MSK. Public parameters g is the generator of two multiplicative cyclic groups. The public parameters are made public.

[0069] S2: For any user, the authorization agency determines the user's attribute set S={a 1 ,a 2 ,...,a m} and the system master private key MSK, determine the user's user private key SK. Each user's attribute set includes n attributes a 1 ,a 2 ,...,a n , n attributes are divided into common attributes and collaborative attributes. The user private key includes the sub-key K, the collaborative key E and the attribute key K of each attribute j .

[0070] Specifically, the authority checks the group to which the user belongs and determines the group private key θ m . Calculate the key sub-key according to the system master private key, the group private key of the group to which the user belongs and the public parameter: Among them, K is the key, g is the generator of the multiplication cyclic group in the public parameters, α is the first random number in the public parameters, β 1 is the second random number in the public parameter, θ m The group private key.

[0071] Randomly select the fourth random number is a positive integer field modulo p, and is calculated based on the group private key θ of the group to which the user belongs. m , the fourth random number γ and the public parameter PP, generate a collaborative key: Among them, E is the collaboration key (translation key for collaboration), g is the generator of the multiplication cycle group in the public parameter, β 2 is the third random number in the public parameters, γ is the fourth random number, θ m The group private key.

[0072] Any attribute a of the user j ∈S, according to the fourth random number, the attribute a j and the public parameter PP, determine the attribute key of the attribute: Among them, K j is the attribute key of attribute j, g is the generator of the multiplication cyclic group in the public parameters, γ is the fourth random number, H() is the hash function in the public parameters, a j is attribute j, 1 <j<n。

[0073] The end user private key is

[0074] Each user's private key is associated with its attributes and embedded with a random number, making the private key more secure and unforgeable.

[0075] S3: The data owner encrypts the keyword index set w according to the public parameter PP, the access strategy tree T and the attribute set of the data owner to obtain the ciphertext keyword index And the access strategy tree T and the ciphertext keyword index Upload to the cloud server. The data owner is the user. The keyword index set includes multiple keywords, each keyword is linked to the corresponding data document. Some nodes on the access strategy tree T are set as conversion nodes, that is, nodes that can be used for collaboration. Leaf nodes correspond to various attributes of users.

[0076] Further, step S3 includes:

[0077] S31: randomly select a secret value s,

[0078] S32: Generate a first ciphertext index according to the secret value s, the public parameter PP and the keyword index set w Second ciphertext index And the third ciphertext index in, H() is the hash function in the public parameter, g is the generator of the multiplication cycle group in the public parameter, α is the first random number in the public parameter, β 1 is the second random number in the public parameters, β 2 is the third random number in the public parameters, and e is the bilinear mapping in the public parameters.

[0079] S33: According to the secret value, determine the polynomial of each node in the access policy tree T. The constant in the polynomial of the root node in the access policy tree is the secret value.

[0080] Specifically, for each non-leaf node in the access strategy tree T, the data owner starts from the root node r and selects a d x Polynomial of degree q x : a', b', c', d', e' are all constants, among which d x =k x -1, k x is the threshold of node x.

[0081] For the root node of the access strategy tree T, set the root node polynomial q root (0) = s.

[0082] For other non-root nodes, set q x (0) = q parent(x)(index(x)), where the degree of a leaf node is 0. index(x) represents a label of node x, q parent(x) A polynomial representing the parent of node x.

[0083] S34: Determine the ciphertext components of each node according to the polynomial of each node, the public parameter and the attribute set of the data owner. The ciphertext components of the leaf node include the first ciphertext component and the second ciphertext component

[0084] For each leaf node, use the formula Calculate the first ciphertext component using the formula Calculate the second ciphertext component, where g is the generator of the multiplicative cyclic group in the public parameter, q x (0) is the polynomial of node x, H() is the hash function in the public parameters, and att(x) is the attribute of the data owner corresponding to node x.

[0085] For each transition node y, use the formula Calculate the ciphertext component, where g is the generator of the multiplicative cyclic group in the public parameter, β 2 is the third random number in the public parameter, q y (0) is the polynomial of node y.

[0086] Therefore, the ciphertext keyword index is

[0087] S4: The data user encrypts the search keyword according to the public parameters and the data user's user private key, generates a search trap, and uploads it to the cloud server.

[0088] Further, step S4 includes:

[0089] S41: Calculate the first trapdoor component according to the data user's sub-key K, the public parameter PP and the keyword to be searched q Among them, α is the first random number in the public parameters, β 1 is the second random number in the public parameter, H() is the hash function in the public parameter, θ m The group private key.

[0090] S42: According to the first trapdoor component The attribute key of each attribute of the data user and the collaboration key E of the data user determine the retrieval trap S Uis the attribute set of the data user, a is the attribute of the data user, t a is the attribute key of attribute a, γ is the fourth random number, g is the generator of the multiplicative cyclic group in the public parameters, and H() is the hash function in the public parameters.

[0091] S5: The cloud server determines whether the access policy tree is satisfied based on the attribute set of the data user and the collaborative attributes of the collaborator. If not, data sharing fails. If satisfied, the decryption keyword index is determined based on the public parameters, the retrieval trap, the ciphertext keyword index, the data user's collaborative key and attribute set, the collaborator's collaborative key and collaborative attributes, and the access policy tree.

[0092] Specifically, the cloud server will first determine whether the attribute set of the data user satisfies the access policy tree T of the encrypted index, that is, substitute the attribute set of the data user into the polynomial of each leaf node of the access policy tree. If the secret value s of the access policy tree can be decrypted in the end, the access policy is satisfied. If the access policy is not satisfied, ⊥ is returned.

[0093] Furthermore, in step S5, the decryption keyword index is determined according to the public parameters, the search trap, the ciphertext keyword index, the collaboration key and attribute set of the data user, the collaboration key and collaboration attribute of the collaborator, and the access strategy tree, specifically including:

[0094] For any leaf node in the access strategy tree, determine the intermediate quantity F of the leaf node according to the common parameters and the polynomial of the leaf node. x :

[0095] For any non-leaf node in the access strategy tree, starting from the leaf node, the Lagrange interpolation polynomial is used to calculate the intermediate variables of the non-leaf node from bottom to top based on the polynomials of each child node of the non-leaf node, the collaboration key of the data user, and the collaboration key of the collaborator.

[0096] Specifically, we first calculate the k of node x x The intermediate variable of the child node z and store it in S x In. S x Indicates that the child nodes that satisfy the predicate represented by node x are selected. E' is the collaboration key of the collaborator. F' z It is the intermediate variable of the collaborative attribute.

[0097] If there is no such k x If there is a child node z of size ⊥, the query fails.

[0098] Secondly, the Lagrange interpolation polynomial is used to calculate the intermediate quantity Through such an iterative loop, the intermediate variable of the root node r is calculated as

[0099] A decryption keyword index is determined according to the intermediate variable of the root node in the access strategy tree, the collaboration key of the data user and the ciphertext keyword index.

[0100] Specifically, the cloud server uses the formula Calculate the total intermediate quantity F. Then calculate the decryption keyword index according to the matching formula

[0101] S6: Determine the decryption keyword index I and the ciphertext keyword index I The first ciphertext index in Whether it corresponds, if it does, the search is successful, and the data document corresponding to the keyword to be searched is sent to the data user. That is, if the decrypted keyword index exists in the ciphertext keyword index, the search is successful.

[0102] The present invention generates a collaborative key during the key generation phase, and implements the retrieval of ciphertext keywords under the cooperation of the collaborative key during retrieval, so that a certain user can retrieve ciphertext keywords under the cooperation of another user within a controllable range. Based on the DBDH (Decisional Bilinear Diffie-Hellman) difficulty problem assumption, the confidentiality of data can be guaranteed under a chosen plaintext attack, and collusion attacks can be resisted.

[0103] Embodiment 2

[0104] In order to execute the method corresponding to the above-mentioned embodiment 1 to achieve the corresponding functions and technical effects, a collaborative searchable encrypted data sharing system is provided below.

[0105] like Figure 2 As shown, the collaborative searchable encrypted data sharing system provided in this embodiment includes: an authorization agency 1, a data owner 2, a data user 3 and a cloud server 4.

[0106] Among them, the authorization agency 1 is used to generate public parameters, the system master private key and the group private key of each group; for any user, the user private key of the user is determined according to the public parameters, the attribute set of the user and the system master private key. Each group includes multiple users. The attribute set of each user includes multiple attributes, and the multiple attributes are divided into common attributes and collaborative attributes. The user private key includes a sub-key, a collaborative key and an attribute key of each attribute. The group private key of each user in the same group is the same.

[0107] The data owner 2 is used to encrypt the keyword index set according to the public parameters, the access policy tree and the attribute set of the data owner to obtain a ciphertext keyword index, and upload the access policy tree and the ciphertext keyword index to the cloud server 4. The data owner 2 is a user. The keyword index set includes multiple keywords, each keyword is linked to a corresponding data document.

[0108] The data user 3 is used to encrypt the search keyword according to the public parameters and the user private key of the data user 3 to generate a search trap.

[0109] The cloud server 4 is used to determine whether the access policy tree is satisfied based on the attribute set of the data user 3 and the collaborative attributes of the collaborator. If not, data sharing fails; if satisfied, the decryption keyword index is determined based on the public parameters, the retrieval trap, the ciphertext keyword index, the collaboration key of the data user 3 and the attribute set of the data user, the collaboration key and collaboration attributes of the collaborator, and the access policy tree; and determine whether the decryption keyword index exists in the ciphertext keyword index. If so, the retrieval is successful, and the data document corresponding to the keyword to be retrieved is sent to the data user 3.

[0110] In this embodiment, the authorization agency 1, the data owner 2, and the data user 3 are all computers or other terminal devices.

[0111] The various embodiments in this specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the various embodiments can be referenced to each other.

[0112] The principles and implementation methods of the present invention are described in this article using specific examples. The description of the above embodiments is only used to help understand the method and core idea of ​​the present invention. At the same time, for those skilled in the art, according to the idea of ​​the present invention, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as limiting the present invention.

Claims

1. A collaborative searchable encrypted data sharing method, characterized in that: The collaborative searchable encrypted data sharing method includes: Generate public parameters, system master private key and group private key of each group through the authorized agency; each group includes multiple users; the group private key of each user in the same group is the same; For any user, the authorization agency determines the user private key of the user according to the public parameters, the attribute set of the user and the system master private key, which specifically includes: the authorization agency checks the group to which the user belongs and determines the group private key of the group to which the user belongs; the authorization agency calculates the sub-key according to the system master private key, the group private key of the group to which the user belongs and the public parameters; randomly selects a fourth random number, and generates a collaboration key according to the group private key of the group to which the user belongs, the fourth random number and the public parameters; for each attribute of the user, determines the attribute key of the attribute according to the fourth random number, the attribute and the public parameters; the attribute set of each user includes multiple attributes, and the multiple attributes are divided into common attributes and collaborative attributes; the user private key includes a sub-key, a collaboration key and the attribute key of each attribute; The data owner encrypts the keyword index set according to the public parameters, the access policy tree and the attribute set of the data owner to obtain a ciphertext keyword index, and uploads the access policy tree and the ciphertext keyword index to the cloud server; the data owner is a user; the keyword index set includes multiple keywords, each keyword is linked to a corresponding data document; The data user encrypts the search keyword according to the public parameters and the user private key of the data user, generates a search trap, and uploads it to the cloud server; The cloud server determines whether the access policy tree is satisfied according to the attribute set of the data user and the collaborative attribute of the collaborator. If not, data sharing fails. If satisfied, the decryption keyword index is determined according to the public parameters, the search trap, the ciphertext keyword index, the collaborative key and attribute set of the data user, the collaborative key and collaborative attribute of the collaborator, and the access policy tree. It is determined whether the decrypted keyword index exists in the ciphertext keyword index. If so, the retrieval is successful, and the data document corresponding to the keyword to be retrieved is sent to the data user.

2. The collaborative searchable encrypted data sharing method according to claim 1 is characterized in that: The generation of public parameters and system master private key by an authorized agency specifically includes: Get security parameters; According to the security parameter, two multiplication cyclic groups of order p are determined and Generate a bilinear map e from two multiplicative cyclic groups; Randomly select a first random number α, a second random number β1, and a third random number β2 from a positive integer field with a modulus of p, and determine a hash function H; The common parameters are in, and are two multiplication cyclic groups, p is the order of the multiplication cyclic group, e is a bilinear map, α is a first random number, β1 is a second random number, β2 is a third random number, and g is a generator of the multiplication cyclic group; the system master private key includes the first random number α, the second random number β1 and the third random number β2.

3. The collaborative searchable encrypted data sharing method according to claim 1, characterized in that: Use the following formula to calculate the key: Among them, K is the key, g, α, β1 are all public parameters, θ m The group private key.

4. The collaborative searchable encrypted data sharing method according to claim 1, characterized in that: The collaboration key is determined using the following formula: Among them, E is the collaborative key, g and β2 are public parameters, γ is the fourth random number, θ m The group private key.

5. The collaborative searchable encrypted data sharing method according to claim 1, characterized in that: Determine the attribute key for attribute j using the following formula: Among them, K j is the attribute key of attribute j, g is the public parameter, γ is the fourth random number, H() is the hash function, a j is the attribute j.

6. The collaborative searchable encrypted data sharing method according to claim 1, characterized in that: The data owner encrypts the keyword index set according to the public parameters, the access policy tree and the attribute set of the data owner to obtain a ciphertext keyword index, which specifically includes: Randomly select a secret value; Generate a first ciphertext index, a second ciphertext index, and a third ciphertext index according to the secret value, the public parameter, and the keyword index set; Determine the polynomial of each node in the access policy tree according to the secret value; the constant in the polynomial of the root node in the access policy tree is the secret value; The ciphertext component of each node is determined according to the polynomial of each node, the public parameters and the attribute set of the data owner; the ciphertext keyword index includes an access strategy tree, a first ciphertext index, a second ciphertext index, a third ciphertext index and the ciphertext components of each node in the access strategy tree.

7. The collaborative searchable encrypted data sharing method according to claim 1, characterized in that: The data user encrypts the search keyword according to the public parameter and the user private key of the data user to generate a search trap, which specifically includes: Calculating a first trapdoor component according to the data user's sub-key, the public parameter and the keyword to be searched; A retrieval trapdoor is determined according to the first trapdoor component, the attribute key of each attribute of the data user, and the collaboration key of the data user.

8. The collaborative searchable encrypted data sharing method according to claim 1, characterized in that: Determining a decryption keyword index according to the public parameters, the search trap, the ciphertext keyword index, the collaboration key and attribute set of the data user, the collaboration key and collaboration attribute of the collaborator, and the access strategy tree specifically includes: For any leaf node in the access strategy tree, determine the intermediate quantity of the leaf node according to the common parameter and the polynomial of the leaf node; For any non-leaf node in the access strategy tree, starting from the leaf node, according to the polynomials of each child node of the non-leaf node, the collaboration key of the data user, and the collaboration key of the collaborator, the Lagrange interpolation polynomial is used to calculate the intermediate variables of the non-leaf node from bottom to top; the intermediate variable of the root node is a secret value; A decryption keyword index is determined according to the intermediate variable of the root node in the access strategy tree, the collaboration key of the data user and the ciphertext keyword index.

9. A collaborative searchable encrypted data sharing system, characterized in that: The collaborative searchable encrypted data sharing system includes: An authorization agency is used to generate public parameters, a system master private key and group private keys of each group; for any user, the user private key of the user is determined according to the public parameters, the attribute set of the user and the system master private key, specifically including: the authorization agency checks the group to which the user belongs and determines the group private key of the group to which the user belongs; the authorization agency calculates a sub-key according to the system master private key, the group private key of the group to which the user belongs and the public parameters; randomly selects a fourth random number, and generates a collaboration key according to the group private key of the group to which the user belongs, the fourth random number and the public parameters; for each attribute of the user, the attribute key of the attribute is determined according to the fourth random number, the attribute and the public parameters; each group includes multiple users; the attribute set of each user includes multiple attributes, and the multiple attributes are divided into common attributes and collaborative attributes; the user private key includes a sub-key, a collaboration key and the attribute key of each attribute; the group private key of each user in the same group is the same; The data owner is used to encrypt the keyword index set according to the public parameters, the access policy tree and the attribute set of the data owner to obtain a ciphertext keyword index, and upload the access policy tree and the ciphertext keyword index to the cloud server; the data owner is a user; the keyword index set includes multiple keywords, each keyword is linked to a corresponding data document; The data user is used to encrypt the search keyword according to the public parameter and the user private key of the data user to generate a search trap; The cloud server is used to determine whether the access policy tree is satisfied based on the attribute set of the data user and the collaborative attributes of the collaborator. If not, data sharing fails; if satisfied, a decryption keyword index is determined based on the public parameters, the retrieval trap, the ciphertext keyword index, the collaboration key and attribute set of the data user, the collaboration key and collaboration attributes of the collaborator, and the access policy tree; and to determine whether the decryption keyword index exists in the ciphertext keyword index. If so, the retrieval is successful, and the data document corresponding to the keyword to be retrieved is sent to the data user.

Citation Information

Patent Citations

  • Attribute-based multi-keyword ciphertext retrieval method under background of multiple data owners

    CN105871543A

  • Attribute-based searchable encrypted electronic medical record system and encryption method

    CN107634829A

  • Multi-keyword searchable encryption method supporting numerical attribute comparison

    CN108156140A

  • Judicial electronic evidence system and method based on alliance chain and homomorphic encryption

    CN112733192A

  • Searchable encryption system and method supporting multi-keyword subset retrieval

    CN114398650A