A certificateless encryption method with searchable and equivalence-testable ciphertext.
By employing a certificateless public-key system without bilinear pairing operations, combined with keyword search and equivalence test trapdoor design, the problem of high computational overhead and security risks in existing certificateless ciphertext equivalence test encryption schemes is solved. This achieves searchable and equivalence-testable ciphertext, improving the search efficiency and security of resource-constrained devices.
Patent Information
- Application Number
- CN202611313030.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-08-27
- Publication Date
- 2026-11-17
AI Technical Summary
Existing certificateless ciphertext equivalence testing encryption schemes have high computational overhead, making them unsuitable for resource-constrained devices. They also lack keyword search functionality, resulting in low search efficiency and security risks.
It adopts a certificateless public-key system without bilinear pairing operations, and uses the sender's private key to participate in ciphertext generation. Combined with keyword search and equivalence test trapdoor design, it realizes that the ciphertext is searchable and equivalence testable, reducing computational overhead and enhancing security.
It improves encrypted retrieval efficiency, reduces invalid tests, is suitable for resource-constrained devices, and enhances message privacy protection and system security.
Smart Images

Figure CN123122815A_ABST
Abstract
Description
Technical Field
[0001] This invention belongs to the field of information security and cryptography technology, specifically relating to a certificateless authentication encryption method in which the ciphertext is searchable and can be equivalently tested. Background Technology
[0002] With the development of cloud computing technology, more and more users are uploading personal medical information, corporate transaction data, and financial data to cloud servers for storage and processing. To prevent data leakage in the cloud environment, data is usually encrypted before uploading. After encryption, the original plaintext structure is hidden, making traditional plaintext retrieval and processing methods difficult to apply directly to encrypted data. To solve the problem of comparing ciphertexts in a multi-user environment, researchers have proposed a public-key encryption technique for ciphertext equivalence testing. This technique can determine whether different ciphertexts correspond to the same plaintext without decryption. Furthermore, to alleviate the certificate management burden in traditional public key infrastructures and avoid key escrow issues in identity-based encryption, a certificateless ciphertext equivalence testing encryption scheme has been proposed.
[0003] However, existing certificateless ciphertext equivalence testing encryption schemes still have some shortcomings in practical applications. Most existing schemes rely on bilinear pairing operations and dot mapping operations, which incur significant computational overhead, making them unsuitable for resource-constrained devices such as smartphones and wireless sensors. Furthermore, some schemes lack keyword search functionality, failing to filter the ciphertext before performing equivalence testing, leading to numerous invalid tests and low search efficiency. In addition, existing schemes also pose certain security risks, being vulnerable to message recovery attacks and failing to fully guarantee the privacy of messages within the ciphertext. Therefore, it is necessary to propose a certificateless ciphertext equivalence testing authentication encryption scheme that does not require bilinear pairing operations, supports keyword search, and is resistant to message recovery attacks.
[0004] Patent application CN202510792327.5 discloses a lattice-based threshold signature method capable of equivalence detection. The method includes inputting security parameters and running an initialization algorithm to output a set of public parameters; each user terminal generating a public-private key pair based on the public parameters using a key generation algorithm; each user terminal generating its own secret shared value using its own public-private key and the secret shared values of other user terminals using a sharing algorithm; the message sender calculating the final ciphertext using a threshold signature algorithm and its own secret shared value and sending it to the message receiver; the message receiver verifying the validity of the final ciphertext using a designification algorithm and decrypting the message value; and the message receiver then performing an equivalence test on the received final ciphertext using its own tag. The key technical point of this patent is combining lattice cryptography, threshold signatures, and equivalence detection to improve resistance to quantum attacks and enhance security and flexibility in multi-participant scenarios. However, this patented method mainly focuses on equivalence detection in threshold signature scenarios. It can only determine the similarity between ciphertexts, but it does not have keyword search capabilities and cannot pre-screen ciphertexts before equivalence testing. Therefore, it is difficult to meet the application requirements of on-demand retrieval and efficient search of ciphertexts in the cloud.
[0005] Chinese patent application CN202510396322.0 discloses a searchable encrypted management method, device, storage medium, and electronic device. This method is applied to a proxy server. The proxy server receives a target data request from a target device and determines the database operation type and target data based on the request. Subsequently, it executes data operations corresponding to the database operations based on keywords in the target data. These database operations include data initialization, data query, data addition, data deletion, and data update. In implementation, the proxy server extracts keywords from the plaintext data, generates ciphertext data using a format-preserving encryption algorithm based on the target key and a counter, and uses the keyword set as input to generate a corresponding Bloom filter using a Bloom filter generation algorithm. This enables the cloud server to manage the query, addition, deletion, and update of encrypted data. The key technology of this patent lies in improving the management efficiency, access efficiency, and update efficiency of searchable encrypted data in a database scenario through a proxy server, multiple cloud servers, and Bloom filter indexing. However, although the method in this application supports keyword retrieval, it can only achieve the search and management of encrypted data, and does not have the ability to perform encrypted equivalence testing. It cannot determine whether different encrypted data correspond to the same plaintext, and therefore it is difficult to meet the application requirements of collaborative processing of encrypted search and equivalence testing in a certificateless environment. Summary of the Invention
[0006] To address the shortcomings of existing technologies, this application proposes a certificateless encryption method that allows ciphertext to be searchable and equivalence-tested.
[0007] In a first aspect, the present invention provides a certificateless encryption method with searchable and equivalence-testable ciphertext, comprising: The key generation center generates a partial private key and a partial public key based on the identity of the sender or receiver, and sends the partial private key and partial public key to the sender and receiver respectively. The sender generates a complete private key and a public key based on a portion of the private key, a portion of the public key, and a first secret value chosen by the sender. When data needs to be sent, the sender uses the sender's complete private key, the receiver's public key, and the receiver's identity identifier to encrypt the message to be protected and the corresponding keywords into searchable ciphertext, and then sends the searchable ciphertext to the cloud server. The recipient generates the recipient's complete private key and public key based on a portion of the private key, a portion of the public key, and a second secret value chosen by the recipient. The recipient then uses the recipient's complete private key, the sender's public key, the sender's identity identifier, and the keyword to be queried to generate a keyword search trapdoor and sends the keyword search trapdoor to the cloud server. The cloud server uses keyword search trapdoors to verify whether the searchable ciphertext contains the corresponding keywords, and returns the keyword search test results to the receiver. When the keyword search test result shows that the corresponding keyword is included, the receiver generates an equivalence test trap based on the receiver's complete private key, the sender's public key, the sender's identity identifier, the public key of the other receiver to be compared, and the identity identifier of the other receiver to be compared, and sends the equivalence test trap to the cloud server. After receiving equivalence test traps generated by different recipients, the cloud server verifies whether the searchable ciphertexts of different recipients are the encryption of the same message to be protected, and returns the equivalence test results. The receiver uses the receiver's complete private key, the sender's public key, and the sender's identity identifier to decrypt the searchable ciphertext that has passed the equivalence test, and recover the plaintext data of the message to be protected.
[0008] The key generation center generates a partial private key and a partial public key based on the sender's or receiver's identity, and sends the partial private key and partial public key to the sender and receiver, including: The key generation center generates system parameters and a master key. After receiving the sender's or receiver's identity identifier, it generates a partial private key and a partial public key based on the system parameters and the master key, and sends the partial private key and partial public key to the sender and receiver, respectively.
[0009] The searchable ciphertext is a ciphertext component, including: a first ciphertext, a second ciphertext, a third ciphertext, a fourth ciphertext, and a fifth ciphertext, expressed as follows: ; ; ; ; ; ; in, The master public key, For encrypted components, This is the first ciphertext. This is the second ciphertext. This is the third ciphertext. This is the fourth ciphertext. Fifth cipher, For the sender in the cyclic multiplication group The third random number is randomly selected from the data. For the sender in the cyclic multiplication group The fourth random number is randomly selected from the list. For generators, For messages to be protected , The scalar obtained after hashing the message to be protected. Messages to be protected bit length, In this context, 0 and 1 represent binary bits, indicating all lengths of 0. A collection of binary strings of bits. For the corresponding keywords, For the sender's complete private key, , The first component of the sender's complete private key. The second component is the sender's complete private key. The public key of the receiver R. , This is the first component of the public key of the receiver R. The second component of receiver R's public key, The third component of receiver R's public key, For the identity identifier of receiver R, For the first one-way hash function, It is the third one-way hash function. This is the fourth one-way hash function. This is the fifth one-way hash function. It is the sixth one-way hash function.
[0010] The keyword search trapdoor has the following expression: ; ; ; in, The master public key, For keyword search traps, As the first key trapdoor component, For the second key trapdoor component, For the first one-way hash function, It is the third one-way hash function. Keywords entered by the recipient For the sender's public key, , This is the first component of the public key of the receiver R. The second component of receiver R's public key, The third component of receiver R's public key, For the sender's identity, For the recipient's complete private key, , The first component of the recipient's complete private key. The second component is the recipient's complete private key.
[0011] The cloud server uses a keyword search trapdoor to verify whether the searchable ciphertext contains the corresponding keyword, and returns the keyword search test results to the receiver, including: Search for trapdoors using keywords. And searchable encrypted text Verify the equation Check if the statement is true. If true, output a keyword search test result of 1, indicating that the same keyword is contained. If not, output a result of 1. If true, the output keyword search test result will be 0, indicating that no duplicate keywords are found. For keyword search traps, As the first key trapdoor component, For the second key trapdoor component, For encrypted components, First ciphertext, The second ciphertext, The third ciphertext, Fourth cipher text, Fifth cipher, This is the fourth one-way hash function.
[0012] The receiver generates an equivalence test trapdoor based on its complete private key, the sender's public key, the sender's identity identifier, the public key of the other receiver to be compared, and the identity identifier of the other receiver to be compared, including: Based on the receiver R's complete private key The sender's public key Sender's identification The other receiver to be compared public key and the other recipient to be compared Identity identifier Generate an equivalence test trapdoor, expressed as follows: ; ; ; in, This is a trapdoor for equivalence testing. The first component of the equivalent test trapdoor generated for receiver R. The second component of the equivalent test trapdoor generated for receiver R. The first component of the receiver R's complete private key. The second component of the receiver R's complete private key. The first component of the sender's public key. The second component of the sender's public key, The third component of the sender's public key, For another recipient The first component of the public key; For another recipient The second component of the public key; Another receiver generated by the key generation center A portion of the public key, and as another recipient. The third component of the public key.
[0013] After receiving equivalence test trapdoors generated by different recipients, the cloud server verifies whether the searchable ciphertexts of different recipients are encryptions of the same message to be protected, and returns the equivalence test result, expressed as follows: Verify whether the following equation holds true: ; If true, the output of the equivalence test result is 1, indicating that the searchable ciphertext of different receivers is the encryption of the same message to be protected; if false, the output of the equivalence test result is 0, indicating that the searchable ciphertext of different receivers is the encryption of different plaintext data. in, This is the fourth ciphertext. This is the fifth one-way hash function. For the first one-way hash function, For the identity identifier of receiver R, This is the first ciphertext. The fourth ciphertext, which is the searchable ciphertext for another recipient. As an identifier for another recipient, The first component of the equivalent test trapdoor generated for receiver R. The second component of the equivalent test trapdoor generated for receiver R. The first component of the equivalent test trapdoor, generated symmetrically for another receiver R. The second component of the equivalent test trapdoor, generated symmetrically for another receiver R, The second component of receiver R's public key, The third component of receiver R's public key is the partial public key of receiver R generated by the key generation center. For another recipient The second component of the public key, For another recipient The third component of the public key is another recipient generated by the key generation center. Part of the public key; The master public key.
[0014] The receiver uses its complete private key, the sender's public key, and the sender's identity identifier to decrypt the searchable ciphertext that has passed the equivalence test, recovering the plaintext data of the message to be protected, including: The recipient uses the complete private key of recipient R. The sender's public key Sender's identification Calculate the corresponding plaintext: ; Verify whether the following two equations are both true: and ; in, The plaintext of the message M to be protected. For the sender in the cyclic multiplication group The third random number is randomly selected from the data. For the complete private key of the recipient R, The first component of the receiver R's complete private key. The second component of the receiver R's complete private key. For the sender's public key, The first component of the sender's public key. The second component of the sender's public key, The third component of the sender's public key, This is the first ciphertext. This is the second ciphertext. This is the fourth ciphertext. Fifth cipher, For the first one-way hash function, For the second one-way hash function, This is the fifth one-way hash function. It is the sixth one-way hash function. The master public key, It is a generator.
[0015] If both conditions are met, output the plaintext of the message to be protected. Otherwise, output an invalid flag.
[0016] Beneficial effects: This application proposes a certificate-free encryption method with searchable and equivalence-testable ciphertext, which has the following advantages: (1) This application has both keyword search function and ciphertext equivalence test function. By performing keyword search first in the ciphertext processing process and then performing equivalence test on the filtered candidate ciphertexts, it is possible to avoid blindly comparing irrelevant ciphertexts, reduce the number of invalid tests, and improve the efficiency of ciphertext retrieval.
[0017] (2) This application adopts a bilinear pair-free technical approach, which eliminates the need to perform time-consuming bilinear pair operations and point mapping operations during system initialization, encryption, keyword search authorization, equivalence test authorization, testing and decryption, thereby effectively reducing computational overhead and improving operating efficiency, making it more suitable for deployment and application in resource-constrained environments such as mobile terminals and wireless sensors.
[0018] (3) This application adopts a certificateless public key system and introduces the concept of authentication encryption into the scheme, so that the sender's private key participates in the ciphertext generation process. This not only avoids the certificate management burden in the traditional public key infrastructure and the key custody problem in the identity-based encryption system, but also enhances the resistance to message recovery attacks, improves the privacy protection level of messages in the ciphertext and the overall security of the system. Attached Figure Description
[0019] Figure 1 Flowchart of a certificateless authentication encryption method with searchable and equivalent-testable ciphertext according to an embodiment of the present invention; Figure 2 A block diagram illustrating the principle of a certificateless encryption system with searchable and equivalence-testable ciphertext according to an embodiment of the present invention. Detailed Implementation
[0020] The specific implementation methods of this application will be further described in detail below with reference to the accompanying drawings and embodiments.
[0021] Existing certificateless ciphertext equivalence testing encryption schemes mostly rely on bilinear pairing operations and dot mapping operations, which incur significant computational overhead and are difficult to apply to resource-constrained terminal devices. Furthermore, existing schemes typically only allow ciphertext equivalence testing without decryption, lacking keyword search capabilities. If the ciphertext stored on the cloud server does not contain the information the user needs, the user still needs to blindly perform equivalence testing, resulting in wasted network bandwidth and reduced search efficiency. In addition, existing schemes also suffer from security issues such as poorly designed test credentials, making them vulnerable to message recovery attacks. To address these problems, this application proposes a certificateless authentication encryption method that allows ciphertext to be searchable and equivalence tested. Under a certificateless system, it combines authentication encryption, keyword search, and ciphertext equivalence testing. By performing keyword search first and then equivalence testing, it improves ciphertext search efficiency, reduces unnecessary testing overhead, and avoids the high computational burden of bilinear pairing operations, thereby enhancing the system's security and practicality.
[0022] Example 1: This embodiment provides a certificate-free encryption method where the ciphertext is searchable and can be tested for equality. Figure 1 As shown, it includes: Step S1: The key generation center generates a partial private key and a partial public key based on the sender's or receiver's identity, and sends the partial private key and partial public key to the sender and receiver, including: The key generation center generates system parameters and a master key. After receiving the sender's or receiver's identity identifier, it generates a partial private key and a partial public key based on the system parameters and the master key, and sends the partial private key and partial public key to the sender and receiver, respectively.
[0023] The key generation center generates system parameters and a master key, including: Step S1.1: Based on safety parameters The generating order is a prime number. Elliptic curve cyclic addition group Select the elliptic curve cyclic addition group generator And record For model The cyclic multiplication group consisting of non-zero residue classes; In this embodiment, it can be implemented based on elliptic curve groups and multiple hash functions. Unlike existing schemes that rely on bilinear mappings, this embodiment does not require the introduction of bilinear pairing operations and point mapping operations. Instead, under a certificateless public-key cryptosystem, it achieves keyword retrieval and equivalence testing of ciphertext through the collaborative design of the sender's private key, the receiver's public key, a keyword search trapdoor, and an equivalence test trapdoor. Their basic definitions are briefly introduced below.
[0024] Elliptic curve group: Assumption It is a model q The finite field consisting of the remainder classes, where q It is a prime number. A point on an elliptic curve is represented as: ; in, It is a point at infinity. , yes Let (G1, p, P) be two integers in the domain G1, representing the elliptic curve group, where p is the order of group G1 and P is a generator of group G1. For prime numbers of order 1 Elliptic curve cyclic addition group, Let x be the coordinates of a point on the elliptic curve, where x is the x-coordinate and y is the y-coordinate.
[0025] Hash functions: This embodiment sets up multiple collision-resistant one-way hash functions for identity mapping, message mapping, keyword mapping, as well as operations such as searchable ciphertext generation, keyword search trapdoor generation, equality test trapdoor generation, and decryption verification. Six hash functions are set. .
[0026] Certificate-free key generation mechanism: This embodiment employs a certificate-free public-key cryptosystem. The Key Generation Center (KGC) generates a partial private key and a partial public key for the user based on their identity; the user then combines this with a secret value they choose to generate a complete private key and a public key. Since the user's (in this embodiment, the user includes the sender or receiver) complete private key contains the secret value chosen by the user, the KGC cannot obtain the user's complete private key independently, thus avoiding the key escrow problem inherent in identity-based cryptosystems.
[0027] Searchable ciphertext: In this embodiment, searchable ciphertext refers to a type of composite ciphertext generated by the sender based on the message to be encrypted, keywords, the sender's private key, the receiver's public key, and identity information. This ciphertext not only contains message protection information but also ciphertext components that allow the cloud server to perform keyword searches and equivalence tests without decrypting the ciphertext.
[0028] Keyword search trapdoor: A keyword search trapdoor is an authorization message generated by the recipient based on the keyword to be searched, the sender's public key and identity information, and the recipient's private key. The cloud server can use this keyword search trapdoor to perform keyword search tests on searchable ciphertext, determining whether the ciphertext contains the target keyword without obtaining the plaintext message.
[0029] Equivalence test trapdoor: An equivalence test trapdoor is an authorization message generated by the recipient based on the sender's public key and identity information, the recipient's private key, and another recipient's public key and identity information, provided that a keyword search test is successful. Cloud servers can utilize equivalence test trapdoors provided by different recipients to perform equivalence tests on searchable ciphertext corresponding to different recipients to determine whether they are encryptions of the same plaintext.
[0030] The entities involved in this embodiment are as follows: (1) Key Generation Center (KGC): responsible for generating system parameters and master keys; after receiving user identity information, it generates part of the private key and part of the public key for the user.
[0031] (2) Sender: The entity that sends the ciphertext obtains a partial key from KGC through registration and generates a complete private key and public key by combining the secret value it selects. When data needs to be sent, the sender encrypts the message to be protected and the keywords extracted from the message into searchable ciphertext using its own private key and the recipient's public key, and sends it to the cloud server for storage.
[0032] (3) Cloud server: responsible for storing the searchable ciphertext uploaded by the sender in the system. After receiving the keyword search trap submitted by the receiver, it performs a keyword search test on the searchable ciphertext. When the keyword search test result is a hit, it further performs a ciphertext equivalence test in combination with the equivalence test traps submitted by different receivers.
[0033] Step S1.2: In the cyclic multiplication group In the middle, randomly select the first random number. As the master key, and based on the first random number and generators ,calculate ; Step S1.3: Select 6 collision-resistant one-way hash functions; In this embodiment, , , , , , ,in, Messages to be protected bit length, for The length of the integer in the middle. The closure is a set of binary strings of arbitrary finite length consisting of 0s and 1s. Step S1.4: Based on the prime number p and the elliptic curve cyclic addition group Generator And a one-way hash function is used to obtain system parameters, the expression of which is as follows: ; in, For system parameters, It is a prime number. It is an elliptic curve group. For generators, The master public key, For the first one-way hash function, For the second one-way hash function, It is the third one-way hash function. This is the fourth one-way hash function. This is the fifth one-way hash function. It is the sixth one-way hash function.
[0034] The process of generating a partial private key and a partial public key based on system parameters and the master key is as follows: ; ; in, For a portion of the private key, For a portion of the public key, For generators, For user identity , The closure is a set of binary strings of arbitrary finite length consisting of 0s and 1s. Master key For key generation center in finite cyclic multiplication group The second random number is randomly selected from the list.
[0035] Step S2: The sender generates the sender's complete private key and the sender's public key based on a portion of the private key, a portion of the public key, and a first secret value chosen by the sender. When data needs to be sent, the sender uses the sender's complete private key, the receiver's public key, and the receiver's identity identifier to encrypt the message to be protected and the corresponding keywords into searchable ciphertext, and sends the searchable ciphertext to the cloud server. The sender generates their complete private key and public key based on a portion of their private key, a portion of their public key, and a first secret value of their own choice, as shown in the following expression: ; ; in, For the sender's complete private key, For the sender's public key, The first component of the sender's complete private key. The second component is the sender's complete private key. The first component of the sender's public key. The second component of the sender's public key, The third component of the sender's public key, The first component of the first secret value chosen by the sender. The second component is the first secret value chosen by the sender. It is a cyclic multiplication group. For a portion of the private key, For a portion of the public key, It is a generator.
[0036] The searchable ciphertext is a ciphertext component, including: a first ciphertext, a second ciphertext, a third ciphertext, a fourth ciphertext, and a fifth ciphertext, expressed as follows: ; ; ; ; ; ; in, The master public key, For encrypted components, This is the first ciphertext. This is the second ciphertext. This is the third ciphertext. This is the fourth ciphertext. Fifth cipher, For the sender in the cyclic multiplication group The third random number is randomly selected from the data. For the sender in the cyclic multiplication group The fourth random number is randomly selected from the list. For generators, For messages to be protected , The scalar obtained after hashing the message to be protected. Messages to be protected bit length, In this context, 0 and 1 represent binary bits, indicating all lengths of 0. A collection of binary strings of bits. For the corresponding keywords, For the sender's complete private key, , The first component of the sender's complete private key. The second component is the sender's complete private key. The public key of the receiver R. , This is the first component of the public key of the receiver R. The second component of receiver R's public key, The third component of receiver R's public key, For the identity identifier of receiver R, For the first one-way hash function, It is the third one-way hash function. This is the fourth one-way hash function. This is the fifth one-way hash function. It is the sixth one-way hash function.
[0037] In this embodiment, the first ciphertext It is a shared component for three functions: ciphertext search, ciphertext equivalence test, and ciphertext decryption. It uses a third random number generator. Three functional ciphertext components have been bound together. Without this component, the other three functional ciphertext components will be ineffective. Second ciphertext It is a shared component for both ciphertext search and ciphertext decryption. It is generated using the sender's private key and is used to authenticate the sender of the ciphertext during ciphertext search and decryption, proving the authenticity of the ciphertext's source.
[0038] First cipher Second ciphertext Third cipher Three components implement the ciphertext search function, among which the third ciphertext... It uses the sender S's private key through a two-key mechanism. The public key of receiver R and identity Keywords Ciphertext components generated by encryption.
[0039] Step S3: The recipient generates the recipient's complete private key and the recipient's public key based on a portion of the private key, a portion of the public key, and a second secret value chosen by the recipient; the recipient uses the recipient's complete private key, the sender's public key, the sender's identity identifier, and the keyword to be queried to generate a keyword search trapdoor, and sends the keyword search trapdoor to the cloud server. The recipient generates their complete private key and public key using a portion of their private key, a portion of their public key, and a second secret value of their own choice, as shown in the following expressions: ; ; in, For a portion of the private key, For a portion of the public key, For generators, For the complete private key of the recipient R, For the recipient's public key, The first component of the receiver R's complete private key. The second component of the receiver R's complete private key. This is the first component of the public key of the receiver R. The second component of receiver R's public key, The third component of receiver R's public key, The first component of the first secret value chosen by the receiver. The second component of the first secret value, chosen by the receiver. It is a cyclic multiplication group.
[0040] The keyword search trapdoor has the following expression: ; ; ; in, The master public key, For keyword search traps, As the first key trapdoor component, For the second key trapdoor component, For the first one-way hash function, It is the third one-way hash function. Keywords entered by the recipient For the sender's public key, , This is the first component of the public key of the receiver R. The second component of receiver R's public key, The third component of receiver R's public key, For the sender's identity, For the recipient's complete private key, , The first component of the recipient's complete private key. The second component is the recipient's complete private key.
[0041] Step S4: The cloud server uses keyword search trapdoors to verify whether the searchable ciphertext contains the corresponding keywords, and returns the keyword search test results to the receiver; The cloud server uses a keyword search trapdoor to verify whether the searchable ciphertext contains the corresponding keyword, and returns the keyword search test results to the receiver, including: Search for trapdoors using keywords. And searchable encrypted text Verify the equation Check if the statement is true. If true, output a keyword search test result of 1, indicating that the same keyword is contained. If not, output a result of 1. If true, the output keyword search test result will be 0, indicating that no duplicate keywords are found. For keyword search traps, As the first key trapdoor component, For the second key trapdoor component, For encrypted components, First ciphertext, The second ciphertext, The third ciphertext, Fourth cipher text, Fifth cipher, This is the fourth one-way hash function.
[0042] In this embodiment, when the receiver R needs to perform a keyword search, it can use the sender S's public key. and identity The receiver R's own private key Keywords for search Encryption generates keyword search traps Among them, trapdoor components , .
[0043] Receiver R will use keyword search traps The message is sent to the cloud server, which then performs a keyword search test, effectively exploiting a search trap. Verify the ciphertext of receiver R one by one Medium components Does it satisfy the equation? If the conditions are met, then it indicates the third ciphertext. Encrypted keywords and search traps The encrypted keys are the same; otherwise, they are different. This process is performed directly in encrypted form without decryption, therefore the cloud server can only determine... and We know if the keywords are the same, but we don't know the specific information about the keywords.
[0044] Ciphertext search verification equation The mathematical mechanism is as follows:
[0045]
[0046]
[0047]
[0048]
[0049] It is obvious that if Equation Established.
[0050] The ciphertext search function can be performed by one of the two receivers in the ciphertext equivalence test to reduce the amount of ciphertext on the receiving party; or it can be performed by both parties simultaneously to reduce the amount of ciphertext on both receiving parties.
[0051] Step S5: When the keyword search test result contains the corresponding keyword, the receiver generates an equivalence test trap based on the receiver's complete private key, the sender's public key, the sender's identity identifier, the public key of the other receiver to be compared, and the identity identifier of the other receiver to be compared, and sends the equivalence test trap to the cloud server. The receiver generates an equivalence test trapdoor based on its complete private key, the sender's public key, the sender's identity identifier, the public key of the other receiver to be compared, and the identity identifier of the other receiver to be compared, including: Based on the receiver R's complete private key The sender's public key Sender's identification The other receiver to be compared public key and the other recipient to be compared Identity identifier Generate an equivalence test trapdoor, expressed as follows: ; ; ; in, This is a trapdoor for equivalence testing. The first component of the equivalent test trapdoor generated for receiver R. The second component of the equivalent test trapdoor generated for receiver R. The first component of the receiver R's complete private key. The second component of the receiver R's complete private key. The first component of the sender's public key. The second component of the sender's public key, The third component of the sender's public key, For another recipient The first component of the public key; For another recipient The second component of the public key; Another receiver generated by the key generation center A portion of the public key, and as another recipient. The third component of the public key.
[0052] Step S6: After receiving the equivalence test trapdoors generated by different recipients, the cloud server verifies whether the searchable ciphertexts of different recipients are encryptions of the same message to be protected, and returns the equivalence test result, expressed as follows: Verify whether the following equation holds true: ; If true, the output of the equivalence test result is 1, indicating that the searchable ciphertext of different receivers is the encryption of the same message to be protected; if false, the output of the equivalence test result is 0, indicating that the searchable ciphertext of different receivers is the encryption of different plaintext data. in, This is the fourth ciphertext. This is the fifth one-way hash function. For the first one-way hash function, For the identity identifier of receiver R, This is the first ciphertext. The fourth ciphertext, which is the searchable ciphertext for another recipient. As an identifier for another recipient, The first component of the equivalent test trapdoor generated for receiver R. The second component of the equivalent test trapdoor generated for receiver R. The first component of the equivalent test trapdoor, generated symmetrically for another receiver R. The second component of the equivalent test trapdoor, generated symmetrically for another receiver R, The second component of receiver R's public key, The third component of receiver R's public key is the partial public key of receiver R generated by the key generation center. For another recipient The second component of the public key, For another recipient The third component of the public key is another recipient generated by the key generation center. Part of the public key; The master public key.
[0053] In this embodiment, the first ciphertext Fourth cipher Two components implement the ciphertext equality test function, among which It uses the sender S's private key through a two-key mechanism. The public key of receiver R and identity plaintext Ciphertext components generated by encryption.
[0054] When two receivers R and R' need to perform a ciphertext equality test, receiver R uses the sender S's public key. and identity The receiver R's own private key The public key of another recipient R' and identity Calculate the equivalent test trapdoor Among them, trapdoor components and The other receiver, R', generates its equivalent test trapdoor in a symmetric manner.
[0055] Receivers R and R' will each use an equivalence test trapdoor. and The encrypted data is sent to the cloud server, which performs a ciphertext equality test, verifying the ciphertext of each pair of devices. and Does it satisfy the equation? If the conditions are met, it means that the plaintext encrypted by both parties' ciphertexts is the same; otherwise, they are different. This process is calculated directly in encrypted form without decryption. Therefore, the cloud server can only determine whether the plaintext in both parties' ciphertexts is the same, but it does not know the specific information of the plaintext.
[0056] Ciphertext equivalence test verifies the equation The mathematical mechanism is as follows:
[0057]
[0058]
[0059]
[0060] Similarly, we can obtain .
[0061] It is obvious that if Equation Established, among which, This is another message that needs to be protected.
[0062] Step S7: The receiver uses the receiver's complete private key, the sender's public key, and the sender's identity identifier to decrypt the searchable ciphertext whose equivalence test result has passed verification, recovering the plaintext data of the message to be protected, including: The recipient uses the complete private key of recipient R. The sender's public key Sender's identification Calculate the corresponding plaintext: ; Verify whether the following two equations are both true: and ; in, The plaintext of the message M to be protected. For the sender in the cyclic multiplication group The third random number is randomly selected from the data. For the complete private key of the recipient R, The first component of the receiver R's complete private key. The second component of the receiver R's complete private key. For the sender's public key, The first component of the sender's public key. The second component of the sender's public key, The third component of the sender's public key, This is the first ciphertext. This is the second ciphertext. This is the fourth ciphertext. Fifth cipher, For the first one-way hash function, For the second one-way hash function, This is the fifth one-way hash function. It is the sixth one-way hash function. The master public key, It is a generator.
[0063] If both conditions are met, output the plaintext of the message to be protected. Otherwise, output an invalid flag.
[0064] In this embodiment, the first ciphertext Second ciphertext And the fifth cipher Three components implement the ciphertext decryption function, among which It uses the sender S's private key through a two-key mechanism. The public key of receiver R and identity Plaintext Ciphertext components generated by encryption.
[0065] When receiver R needs to decrypt the ciphertext, it uses sender S's public key. and identity and one's own private key For ciphertext ; Decryption can recover Encryption Decryption The mathematical mechanism is as follows:
[0066]
[0067]
[0068] ; ;therefore, .
[0069] Example 2: This application proposes a certificate-free encryption system with searchable and equivalence-testable ciphertext, such as... Figure 2 As shown, it includes: system initialization module, partial key generation module, user key generation module, searchable ciphertext generation module, keyword search authorization module, keyword search testing module, equivalence testing authorization module, equivalence testing module, and ciphertext decryption module; The system initialization module is connected to the partial key generation module, the searchable ciphertext generation module, the ciphertext decryption module, and the equivalence test module, respectively. The partial key generation module is connected to the user key generation module. The user key generation module is connected to the keyword search authorization module, the searchable ciphertext generation module, and the ciphertext decryption module, respectively. The keyword search authorization module is connected to the keyword search test module. The keyword search test module is connected to the equivalence test authorization module. The equivalence test authorization module is connected to the equivalence test module. The system initialization module is used by the key generation center to generate system parameters and the master key; The partial key generation module is used to generate a partial private key and a partial public key based on system parameters and the master key after receiving the identity identifier of the sender or receiver, and then send the partial private key and the partial public key to the sender and receiver respectively. The user key generation module is used by the sender to generate the sender's complete private key and the sender's public key based on a portion of the private key, a portion of the public key, and a first secret value chosen by the sender; and by the receiver to generate the receiver's complete private key and the receiver's public key based on a portion of the private key, a portion of the public key, and a second secret value chosen by the receiver. The searchable ciphertext generation module is used to encrypt the message to be protected and the corresponding keywords into searchable ciphertext when data needs to be sent. This is done by using the sender's complete private key, the receiver's public key, and the receiver's identity identifier. The searchable ciphertext is then sent to the cloud server. The keyword search authorization module is used by the recipient to generate a keyword search trap using the recipient's complete private key, the sender's public key, the sender's identity identifier, and the keyword to be queried, and then send the keyword search trap to the cloud server. The keyword search test module is used by the cloud server to use keyword search traps to verify whether the searchable encrypted text contains the corresponding keywords, and returns the keyword search test results to the receiver. The equivalence test authorization module is used to generate an equivalence test trapdoor when the keyword search test result contains the corresponding keyword. The receiver generates the equivalence test trapdoor based on the receiver's complete private key, the sender's public key, the sender's identity identifier, the public key of the other receiver to be compared, and the identity identifier of the other receiver to be compared, and sends the equivalence test trapdoor to the cloud server. The equivalence test module is used by the cloud server to verify whether the searchable ciphertexts of different recipients are the same encrypted message to be protected after receiving equivalence test trapdoors generated by different recipients, and to return the equivalence test results. The ciphertext decryption module is used by the receiver to decrypt searchable ciphertext that has passed the equivalence test using the receiver's complete private key, the sender's public key, and the sender's identity identifier, thereby recovering the plaintext data of the message to be protected.
[0070] Example 3: This embodiment proposes an electronic device, including: one or more processors, and a memory for storing instructions, which, when executed by the one or more processors, cause the one or more processors to perform the certificateless authentication encryption method with searchable and equivalence-testable ciphertext.
[0071] The electronic device may be a mobile phone, computer, or tablet computer, etc., and includes a memory and a processor. The memory stores a computer program, which, when executed by the processor, implements a certificate-free authentication encryption method with searchable and equivalence-testable ciphertext as described in the embodiments. It is understood that the electronic device may also include input / output (I / O) interfaces and communication components.
[0072] The processor is used to execute all or part of the steps in the certificateless authentication encryption method with searchable and equivalence-testable ciphertext as described in the above embodiments. The memory is used to store various types of data, which may include, for example, instructions for any application or method in the electronic device, as well as application-related data.
[0073] The processor can be implemented as an Application Specific Integrated Circuit (ASIC), Digital Signal Processor (DSP), Programmable Logic Device (PLD), Field Programmable Gate Array (FPGA), controller, microcontroller, microprocessor, or other electronic components, and is used to execute the certificateless authentication encryption method described in the above embodiments, which allows for ciphertext searchability and equivalence testing.
[0074] Example 4: This embodiment proposes a computer-readable storage medium that stores executable instructions. When these instructions are executed, if they are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium.
[0075] The computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of a certificateless authentication encryption method with searchable and equivalent-testable ciphertext as described in various embodiments of this application.
[0076] The aforementioned storage media include: flash memory, hard disks, multimedia cards, card-type memory (e.g., SD (Secure Digital Memory Card) or DX (Memory Data Register, MDR) memory), random access memory (RAM), static random-access memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic storage, disks, optical discs, servers, APP (Application) application stores, and other media capable of storing program verification codes. These media store computer programs, and when executed by a processor, they can implement the various steps of the aforementioned certificateless authentication encryption method that allows for ciphertext searchability and equivalence testing.
[0077] Example 5: This embodiment proposes a computer program product, including a computer program or instructions, which, when executed by a processor, implements a certificateless authentication encryption method with searchable and equivalence-testable ciphertext.
[0078] Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or part of the technical solution, can be embodied in the form of a computer program product.
[0079] The various embodiments in this application are described in a progressive manner. The same or similar parts between the various embodiments can be referred to each other. Each embodiment focuses on describing the differences from other embodiments.
[0080] The scope of protection of this application is not limited to the embodiments described above. Obviously, those skilled in the art can make various modifications and variations to this disclosure without departing from the scope and spirit of this disclosure. If such modifications and variations fall within the scope of equivalent technology of this disclosure, then the intent of this disclosure also includes such modifications and variations.
Claims
1. A certificate-free encryption method for encrypted text that is searchable and equivalence-testable, characterized in that, include: The key generation center generates a partial private key and a partial public key based on the identity of the sender or receiver, and sends the partial private key and partial public key to the sender and receiver respectively. The sender generates the sender's complete private key and the sender's public key based on a portion of the private key, a portion of the public key, and a first secret value chosen by the sender. When data needs to be sent, the sender uses the sender's complete private key, the receiver's public key, and the receiver's identity identifier to encrypt the message to be protected and the corresponding keywords into searchable ciphertext, and then sends the searchable ciphertext to the cloud server. The recipient generates the recipient's complete private key and public key based on a portion of the private key, a portion of the public key, and a second secret value chosen by the recipient. The recipient then uses the recipient's complete private key, the sender's public key, the sender's identity identifier, and the keyword to be queried to generate a keyword search trapdoor and sends the keyword search trapdoor to the cloud server. The cloud server uses keyword search trapdoors to verify whether the searchable ciphertext contains the corresponding keywords, and returns the keyword search test results to the receiver. When the keyword search test result shows that the corresponding keyword is included, the receiver generates an equivalence test trap based on the receiver's complete private key, the sender's public key, the sender's identity identifier, the public key of the other receiver to be compared, and the identity identifier of the other receiver to be compared, and sends the equivalence test trap to the cloud server. After receiving equivalence test traps generated by different recipients, the cloud server verifies whether the searchable ciphertexts of different recipients are the encryption of the same message to be protected, and returns the equivalence test results. The receiver uses the receiver's complete private key, the sender's public key, and the sender's identity identifier to decrypt the searchable ciphertext that has passed the equivalence test, and recover the plaintext data of the message to be protected.
2. The certificateless encryption method with searchable and equivalence-testable ciphertext according to claim 1, characterized in that, The searchable ciphertext is a ciphertext component, including: a first ciphertext, a second ciphertext, a third ciphertext, a fourth ciphertext, and a fifth ciphertext, expressed as follows: ; ; ; ; ; ; in, The master public key, For encrypted components, This is the first ciphertext. This is the second ciphertext. This is the third ciphertext. This is the fourth ciphertext. Fifth cipher, For the sender in the cyclic multiplication group The third random number is randomly selected from the data. For the sender in the cyclic multiplication group The fourth random number is randomly selected from the list. For generators, For messages to be protected , The scalar obtained after hashing the message to be protected. Messages to be protected bit length, In this context, 0 and 1 represent binary bits, indicating all lengths of 0. A collection of binary strings of bits. For the corresponding keywords, For the sender's complete private key, , The first component of the sender's complete private key. The second component is the sender's complete private key. The public key of the receiver R. , This is the first component of the public key of the receiver R. The second component of receiver R's public key, The third component of receiver R's public key, For the identity identifier of receiver R, For the first one-way hash function, It is the third one-way hash function. This is the fourth one-way hash function. This is the fifth one-way hash function. It is the sixth one-way hash function.
3. The certificateless encryption method for ciphertext that is searchable and equivalence-testable according to claim 1, characterized in that, The keyword search trapdoor has the following expression: ; ; ; in, The master public key, For keyword search traps, As the first key trapdoor component, For the second key trapdoor component, For the first one-way hash function, It is the third one-way hash function. Keywords entered by the recipient For the sender's public key, , This is the first component of the public key of the receiver R. The second component of receiver R's public key, The third component of receiver R's public key, For the sender's identity, For the recipient's complete private key, , The first component of the recipient's complete private key. The second component is the recipient's complete private key.
4. The certificateless encryption method with searchable and equivalence-testable ciphertext according to claim 1, characterized in that, The cloud server uses a keyword search trapdoor to verify whether the searchable ciphertext contains the corresponding keyword, and returns the keyword search test results to the receiver, including: Search for trapdoors using keywords. And searchable encrypted text Verify the equation Check if the statement is true. If true, output a keyword search test result of 1, indicating that the same keyword is contained. If not, output a result of 1. If true, the output keyword search test result will be 0, indicating that no duplicate keywords are found. For keyword search traps, As the first key trapdoor component, For the second key trapdoor component, For encrypted components, First ciphertext, The second ciphertext, The third ciphertext, Fourth cipher text, Fifth cipher, This is the fourth one-way hash function.
5. The certificateless encryption method for ciphertext searchable and equivalence-testable encryption according to claim 1, characterized in that, The receiver generates an equivalence test trapdoor based on its complete private key, the sender's public key, the sender's identity identifier, the public key of the other receiver to be compared, and the identity identifier of the other receiver to be compared, including: Based on the receiver R's complete private key The sender's public key Sender's identification The other receiver to be compared public key and the other recipient to be compared Identity identifier Generate an equivalence test trapdoor, expressed as follows: ; ; ; in, This is a trapdoor for equivalence testing. The first component of the equivalent test trapdoor generated for receiver R. The second component of the equivalent test trapdoor generated for receiver R. The first component of the receiver R's complete private key. The second component of the receiver R's complete private key. The first component of the sender's public key. The second component of the sender's public key, The third component of the sender's public key, For another recipient The first component of the public key; For another recipient The second component of the public key; Another receiver generated by the key generation center A portion of the public key, and as another recipient. The third component of the public key.
6. The certificateless encryption method with searchable and equivalence-testable ciphertext according to claim 1, characterized in that, After receiving equivalence test trapdoors generated by different recipients, the cloud server verifies whether the searchable ciphertexts of different recipients are encryptions of the same message to be protected, and returns the equivalence test result, expressed as follows: Verify whether the following equation holds true: ; If true, the output of the equivalence test result is 1, indicating that the searchable ciphertext of different receivers is the encryption of the same message to be protected; if false, the output of the equivalence test result is 0, indicating that the searchable ciphertext of different receivers is the encryption of different plaintext data. in, This is the fourth ciphertext. This is the fifth one-way hash function. For the first one-way hash function, For the identity identifier of receiver R, This is the first ciphertext. The fourth ciphertext, which is the searchable ciphertext for another recipient. As an identifier for another recipient, The first component of the equivalent test trapdoor generated for receiver R. The second component of the equivalent test trapdoor generated for receiver R. The first component of the equivalent test trapdoor, generated symmetrically for another receiver R. The second component of the equivalent test trapdoor, generated symmetrically for another receiver R, The second component of receiver R's public key, The third component of receiver R's public key is the partial public key of receiver R generated by the key generation center. For another recipient The second component of the public key, For another recipient The third component of the public key is another recipient generated by the key generation center. Part of the public key; The master public key.
7. The certificateless encryption method for ciphertext that is searchable and equivalence-testable according to claim 1, characterized in that, The receiver uses its complete private key, the sender's public key, and the sender's identity identifier to decrypt the searchable ciphertext that has passed the equivalence test, recovering the plaintext data of the message to be protected, including: The recipient uses the complete private key of recipient R. The sender's public key Sender's identification Calculate the corresponding plaintext: ; Verify whether the following two equations are both true: and ; in, The plaintext of the message M to be protected. For the sender in the cyclic multiplication group The third random number is randomly selected from the data. For the complete private key of the recipient R, The first component of the receiver R's complete private key. The second component of the receiver R's complete private key. For the sender's public key, The first component of the sender's public key. The second component of the sender's public key, The third component of the sender's public key, This is the first ciphertext. This is the second ciphertext. This is the fourth ciphertext. Fifth cipher, For the first one-way hash function, For the second one-way hash function, This is the fifth one-way hash function. It is the sixth one-way hash function. The master public key, For generators; If both conditions are met, output the plaintext of the message to be protected. Otherwise, output an invalid flag.
Citation Information
Patent Citations
Searchable encryption management method and device, storage medium and electronic equipment
CN120408657A
Certificate-based multi-user multi-ciphertext equivalent test public key encryption method and system
CN120512248A
