Anti-quantum chameleon hash encryption method and system

Abstract

The invention discloses an anti-quantum chameleon Hash encryption method and an anti-quantum chameleon Hash encryption system. The anti-quantum chameleon Hash encryption method comprises the following steps: generating a Hash value # imgabs1 # and a random number # imgabs2 # according to a private key and a strategy # imgabs0 #; the message # imgabs5 # is encrypted according to the public parameter # imgabs3 # and the strategy # imgabs4 #, and a ciphertext # imgabs6 # is generated; a global public parameter # imgabs7 # and a master key # imgabs8 # are generated based on an LPN algorithm and an LWE algorithm, and a hash value # imgabs10 # and a ciphertext # imgabs11 # are calculated in combination with a strategy # imgabs9 #. Quantum strategy attribute-based encryption and quantum chameleon encryption are combined, optimization design is carried out on the basis, quantum computing attacks can be effectively resisted, and meanwhile, the size and computing performance of a ciphertext are optimized.

Description

Technical Field

[0001] The present invention belongs to the technical field of quantum computing encryption and privacy protection protocol, and in particular, relates to a quantum-resistant chameleon hash encryption method and system. Background Art

[0002] Quantum computers can crack many public key encryption algorithms in polynomial time, especially the security of classical encryption mechanisms such as RSA encryption algorithm (Rivest-Shamir-Adleman) and elliptic curve encryption algorithm (ECC) will be seriously threatened. Therefore, researchers have proposed quantum-safe encryption schemes, among which encryption technologies based on LWE problem and LPN problem are considered to be the most promising quantum-safe alternatives. These encryption schemes can provide strong security in quantum computing environments, and in many practical applications, they have stronger anti-quantum attack capabilities than traditional schemes.

[0003] However, although LWE- and LPN-based encryption technologies have significant advantages in the field of quantum security, they still face some challenges in practical applications. First, the existing LWE-based CP-ABE and LPN-based CH usually rely on different mathematical problem constructions, which makes them face the difficulty of how to efficiently collaborate and ensure encryption security when combined in the same system. Secondly, when processing large-scale attribute sets, the size and computational complexity of the ciphertext of LWE- and LPN-based encryption schemes show a linear growth trend, resulting in a sharp increase in the storage and transmission costs of the ciphertext. In addition, server-assisted decryption is considered to be an effective solution, especially when implementing indirect revocation and ciphertext management. Outsourcing decryption can effectively reduce the computing burden on the user side, but in this process, how to ensure the integrity of the decryption operation and prevent malicious attacks has become a problem that needs to be solved urgently.

[0004] In a quantum computing environment, privacy protection and access control are particularly important, and traditional encryption mechanisms often cannot meet the needs of quantum attacks. Existing encryption schemes mostly focus on a single encryption method, which makes it difficult to achieve effective defense against quantum computing threats at the same time. While improving security, they often ignore the efficiency issues in the encryption and decryption process, especially in large-scale data transmission and processing. Computational overhead and system performance are still important factors restricting their widespread application. Summary of the invention

[0005] The present invention provides a quantum-resistant chameleon hash encryption method and system, which are used to solve the technical problem of low efficiency in the encryption and decryption process.

[0006] In a first aspect, the present invention provides a quantum-resistant chameleon hash encryption method, comprising: Based on private key and policy Generate hash value and random numbers ; According to the public parameters and strategies For plain text Encrypt and generate ciphertext ; Generate global common parameters based on LPN algorithm and LWE algorithm and the master key , and combined with strategies Calculating the hash value and ciphertext .

[0007] In a second aspect, the present invention provides a quantum-resistant chameleon hash encryption system, comprising: Generate a module configured to match private keys and policies Generate hash value and random numbers ; Encryption module, configured according to public parameters and strategies For plain text Encrypt and generate ciphertext ; The calculation module is configured to generate global common parameters based on the LPN algorithm and the LWE algorithm. and the master key , and combined with strategies Calculating the hash value and ciphertext .

[0008] According to a third aspect, an electronic device is provided, comprising: at least one processor, and a memory communicatively connected to the at least one processor, wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can perform the steps of the quantum-resistant chameleon hash encryption method of any embodiment of the present invention.

[0009] In a fourth aspect, the present invention further provides a computer-readable storage medium having a computer program stored thereon, wherein when the program instructions are executed by a processor, the processor executes the steps of the quantum-resistant chameleon hash encryption method of any embodiment of the present invention.

[0010] The quantum-resistant chameleon hash encryption method and system of this application combines quantum strategy attribute-based encryption and quantum chameleon encryption, and optimizes the design on this basis, which can effectively resist quantum computing attacks and optimize the size and computing performance of ciphertext. Ultimately, the present invention aims to achieve a quantum-resistant PCH with both high security and high efficiency, providing a new solution for privacy-preserving communications facing future quantum computing threats. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0012] Figure 1 A flowchart of a quantum-resistant chameleon hash encryption method provided by one embodiment of the present invention; Figure 2 A block diagram of a quantum-resistant chameleon hash encryption system provided by one embodiment of the present invention; Figure 3 It is a schematic diagram of the structure of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0013] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are 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.

[0014] See also Figure 1 , which shows a flow chart of a quantum-resistant chameleon hash encryption method of the present application.

[0015] like Figure 1 As shown, the quantum-resistant chameleon hash encryption method specifically includes the following steps: Step S101, based on the private key and policy Generate hash value and random numbers .

[0016] In this step, according to the private key and policy Generate hash value and random numbers Previously, the first common parameter of CH was generated based on the LPN algorithm and the first master key , based on the LWE algorithm to generate the second public parameter of ABE and the second master key , and embed strategies during the generation process , where the first common parameter generated and the second common parameter Distributed to all users, the first master key and second It is stored securely by KGC and used to generate the user's key pair.

[0017] It should be noted that according to the private key and strategy Generate hash value and random numbers include: CH key generation: KGC uses the first master key and strategies , generate the user's first private key and the public key ; Hash calculation: User uses the first private key Combined with the input plaintext and strategies , through the Chameleon hash function Calculating the hash value and random numbers , hash value Access policies are embedded in the , ensuring that only users who meet the policies can verify or adapt the hash value; Verify: Check the hash value against the public key and policy Is it valid? Random number Is it correct, and the strategy Whether it matches or not, after successful verification, the user is allowed to proceed to the next stage of operation; Collision: User uses private key and the hash value of the input , random numbers , generate a new hash value and new random number , the hash value after the collision satisfies , ensuring that the hash value is in the new message The following is still valid.

[0018] Step S102: according to the common parameters and strategies For plain text Encrypt and generate ciphertext .

[0019] In this step, ABE keys are generated: only users who have passed the policy verification can enter the ABE part, and KGC uses the second master key and the user's attribute collection Generate the user's second private key , the second private key Bind to the user's attribute set for subsequent encryption policy verification and decryption; ABE encryption: The encryption party uses public parameters and access policies , for plaintext Encryption, the generated ciphertext Embedding strategy , ensuring that only User decryption; ABE decryption: User input ciphertext and the second private key , the system checks whether the user attributes meet the encryption policy , if satisfied, decryption is successful and the plaintext is restored ; Otherwise, the decryption fails and a failure flag is returned .

[0020] Step S103: Generate global common parameters based on LPN algorithm and LWE algorithm and the master key , and combined with strategies Calculating the hash value and ciphertext .

[0021] In this step, PCH key generation: KGC uses the global parameters of the LPN algorithm and the LWE algorithm, combined with the strategy , output the integrated global key for hash calculation, encryption and verification; Hash calculation: User input plain text , random numbers ,Strategy , verify that the user complies with the policy , and ensure that the hash value If the verification fails, the collision phase begins. Verification: Based on the user's attribute set and strategies , through ABE to the plaintext Encryption, generate ciphertext , the user provides the decryption key, combined with the verification results of ABE and CH, to decrypt the ciphertext ; Calculate collision and verification: When the user's attributes or policies do not meet the requirements, a new random number is regenerated using the collision mechanism of Chameleon Hash , and recalculate the new hash value , the result after the collision is re-verified, and ends if the verification fails; User decryption: If the user meets the post-collision policy , decryption is successful, and the plaintext is returned , if the user still does not meet the policy requirements, decryption fails.

[0022] In summary, the method of this application combines quantum policy attribute-based encryption (CP-ABE) and quantum chameleon encryption (CH), and optimizes the design based on this, which can effectively resist quantum computing attacks and optimize the size and computing performance of ciphertext. Ultimately, the present invention aims to achieve a quantum-resistant PCH with both high security and high efficiency, providing a new solution for privacy-preserving communications facing future quantum computing threats.

[0023] In a specific embodiment, a quantum-resistant chameleon hash encryption method includes the following steps: S1: System initialization: The key center KGC performs system initialization and outputs system public parameters and master key.

[0024] S2: CH key generation: The system calls the key generation algorithm to generate CH keys and outputs a CH key pair ; S3: Hash calculation: The system performs hash calculation on the input data and outputs the hash value .

[0025] S4: Verification: The system executes the verification algorithm based on the input data and outputs the verification result true or false.

[0026] S5: Collision: The system calls the collision algorithm based on the verification results, collides the parameters and outputs the new parameter configuration; S6: ABE key generation: The system calls the attribute-based encryption key generation algorithm to generate and output an ABE key pair ; S7: Encryption: The system calls the encryption algorithm based on the user's attribute set, encrypts the data and outputs the ciphertext ; S8: Decryption: The system calls the decryption algorithm based on the attribute set and private key, decrypts the ciphertext and outputs the plaintext ; S9: PCH key generation: The key center calls the PCH key generation algorithm to generate a PCH key pair .

[0027] S10: Hash calculation: The system performs hash calculation on the input data, calls the verification algorithm to verify the hash value, and outputs the verification result true or false.

[0028] S11: Verification: The system performs verification algorithm verification and outputs the verification result true or false.

[0029] S12: Collision and verification: After the system calls the collision algorithm based on the input data, it performs verification algorithm verification and outputs the verification result true or false.

[0030] S13: User decryption: The user uses the private key to call the decryption algorithm, decrypt the ciphertext and output the plaintext .

[0031] As an implementation of the embodiment of the present invention, S1 includes the following steps: Choose a large prime number , set integer ring and polynomial rings ,in , to meet the requirements of quantum security. Select two generators and the bilinear mapping function ,in are different finite groups. Initialize the master key ,in is a random number. The public key is: , used for user encryption and system internal authentication. Define a collection of attributes , used to distinguish the permissions of each user. Define time and space , used to represent the time dimension of access rights so as to control the time validity of attributes.

[0032] As an implementation of the embodiment of the present invention, S2 includes the following steps: The system randomly selects a private key , the private key is used for signing and verification. The public key is calculated by generating the element: , where the generator The security and quantum resistance of the public key are ensured. The key pair is ,in: is the public key that is made available to everyone. It is a private key known only to the holder and is used for signing.

[0033] As an implementation of the embodiment of the present invention, S3 includes the following steps: Preprocess the input data. Encode it and convert it into a binary string . Use a standard encoding algorithm (such as UTF-8 encoding) to convert Convert to a format suitable for hashing. Use a quantum-safe hash function , such as SHA-3, perform hash calculation and get .in, The result hash value is used for integrity verification and key derivation. Returns the hash value , used as input for subsequent encryption and signing.

[0034] As an implementation of the embodiment of the present invention, S4 includes the following steps: The system receives input data , using the specified hash function Calculate the hash value again: Compare (recomputed hash value) with (expected correct value), if the two are equal, the verification is successful. The output result is a Boolean value. If the verification is successful, True is output, indicating that the data integrity has not been tampered with; if the verification fails, False is output, indicating that the data may have been tampered with or transmitted incorrectly.

[0035] As an implementation of the embodiment of the present invention, S5 includes the following steps: The collision module receives the following input: plaintext data (possibly updated plaintext), or policy (may be an updated policy description, such as attributes or access control logic), quantum-resistant hash function specified in the system , such as SHA-3 or other suitable irreversible hash algorithms. If the input is plain text data ,right Encode and convert to a standardized format (such as a binary string). If the input is a strategy , convert its structured representation (such as a Boolean logic expression) into a string representation and then encode it. Then use a hash function Encrypt the data and generate a new hash value: or . Output the updated hash value .

[0036] As an implementation of the embodiment of the present invention, S6 includes the following steps: Based on the user's attribute set Select the attribute and generate the key part corresponding to each attribute. , calculate the key: ,in, and It is the master key parameter generated when the system is initialized. The key is composed of the attribute set The corresponding key fragment Composition, called attribute key . Output attribute key Used to control access to specific attributes during decryption As an implementation manner of the embodiment of the present invention, S7 includes the following steps: Select random number , then the plaintext Encrypt and calculate the ciphertext: The ciphertext consists of three parts: , which are the encrypted part used to hide the plaintext and the related values ​​of the two encrypted random numbers. Return ciphertext For decryption by the receiver.

[0037] As an implementation of the embodiment of the present invention, S8 includes the following steps: First, according to the input strategy , converting it into a collection of attributes , then in the polynomial ring Randomly generate matrices and the error vector Then, by calculating Generate Public Key ,in is the master private key. For each attribute , generate the corresponding attribute key , after binding the policy, a complete key pair is formed .in, is the public key, ; is the private key, .

[0038] As an implementation manner of the embodiment of the present invention, S9 includes the following steps: First receive strategy and normalize it to string form (for example, converting a Boolean expression Convert to a string in a fixed format). Then use the hash function Hash the string to generate At the same time, the generated public key Input into the hash function and calculate its corresponding hash value Finally, compare and Are they consistent? If they are consistent, the verification passes, otherwise it fails.

[0039] As an implementation of the embodiment of the present invention, S10 includes the following steps: Checking the user-supplied attribute set Is the strategy met? ,if , returns failure and the verification terminates; if , continue to the next step. Using the public key and random numbers , reconstruct the hash value .if , verification is successful, and the result is passed; if , verification fails and returns failure.

[0040] As an implementation manner of the embodiment of the present invention, S11 includes the following steps: First, check if the plaintext or policy has changed. If the plaintext has changed, recalculate the hash value. ; If the policy changes, recalculate the policy hash value . Then, the old hash value is replaced by the hash value after the collision, and the new hash value is verified to be consistent with the calculated result. If they are consistent, the collision passes; otherwise, the collision fails.

[0041] As an implementation of the embodiment of the present invention, S12 includes the following steps: User decryption module receives ciphertext and the private key held by the user First, through Calculate the decryption factor and then pass Restore the plaintext. Finally, output the decrypted plaintext to the user.

[0042] The innovations of the present invention are as follows: (1) Traditional chameleon hashing is vulnerable to quantum computing attacks, and the introduction of quantum-resistant cryptographic algorithms (such as LWE or RLWE schemes based on lattice theory) provides strong security for this purpose; (2) In PCH key generation, the key generation method based on LWE is used to ensure that the policy-bound keys are immune to quantum computing; (3) In hash verification, a quantum-resistant hash algorithm (such as SHA-3) is used to verify the integrity of the data; (4) The PCH mechanism combines policies and quantum-resistant algorithms to achieve fine-grained access control of trapdoors, while ensuring the confidentiality of trapdoors and the quantum-resistant capabilities of chameleon anti-collision.

[0043] See also Figure 2 , which shows a structural block diagram of a quantum-resistant chameleon hash encryption system of the present application.

[0044] like Figure 2 As shown, the Chameleon hash encryption system 200 includes a generation module 210 , an encryption module 220 and a calculation module 230 .

[0045] The generation module 210 is configured to generate a Generate hash value and random numbers ; The encryption module 220 is configured to and strategies For plain text Encrypt and generate ciphertext ; The calculation module 230 is configured to generate global common parameters based on the LPN algorithm and the LWE algorithm. and the master key , and combined with strategies Calculating the hash value and ciphertext .

[0046] It should be understood that Figure 2 Modules and references documented in Figure 1 Therefore, the operations and features described above for the method and the corresponding technical effects are also applicable to Figure 2 The modules in it will not be described in detail here.

[0047] In some other embodiments, the embodiments of the present invention further provide a computer-readable storage medium having a computer program stored thereon, wherein when the program instructions are executed by a processor, the processor is caused to execute the quantum-resistant chameleon hash encryption method in any of the above method embodiments; As an implementation mode, the computer-readable storage medium of the present invention stores computer-executable instructions, and the computer-executable instructions are configured as follows: Based on private key and policy Generate hash value and random numbers ; According to the public parameters and strategies For plain text Encrypt and generate ciphertext ; Generate global common parameters based on LPN algorithm and LWE algorithm and the master key , and combined with strategies Calculating the hash value and ciphertext .

[0048] The computer-readable storage medium may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of a quantum-resistant chameleon hash encryption system, etc. In addition, the computer-readable storage medium may include a high-speed random access memory, and may also include a memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some embodiments, the computer-readable storage medium may optionally include a memory remotely disposed relative to the processor, and these remote memories may be connected to the quantum-resistant chameleon hash encryption system via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0049] Figure 3 is a schematic diagram of the structure of an electronic device provided by an embodiment of the present invention, such as Figure 3 As shown, the device includes: a processor 310 and a memory 320. The electronic device may also include: an input device 330 and an output device 340. The processor 310, the memory 320, the input device 330 and the output device 340 may be connected via a bus or other means. Figure 3 In the example, the bus connection is used. The memory 320 is the above-mentioned computer-readable storage medium. The processor 310 executes various functional applications and data processing of the server by running the non-volatile software programs, instructions and modules stored in the memory 320, that is, the quantum-resistant chameleon hash encryption method of the above-mentioned method embodiment is implemented. The input device 330 can receive input digital or character information, and generate key signal input related to user settings and function control of the quantum-resistant chameleon hash encryption system. The output device 340 may include a display device such as a display screen.

[0050] The electronic device can execute the method provided by the embodiment of the present invention, and has the functional modules and beneficial effects corresponding to the execution method. For technical details not described in detail in this embodiment, please refer to the method provided by the embodiment of the present invention.

[0051] As an implementation mode, the electronic device is applied to a quantum-resistant chameleon hash encryption system and is used for a client, and includes: at least one processor; and a memory connected to the at least one processor in communication; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can: Based on private key and policy Generate hash value and random numbers ; According to the public parameters and strategies For plain text Encrypt and generate ciphertext ; Generate global common parameters based on LPN algorithm and LWE algorithm and the master key , and combined with strategies Calculating the hash value and ciphertext .

[0052] Through the description of the above implementation modes, those skilled in the art can clearly understand that each implementation mode can be implemented by means of software plus a necessary general hardware platform, or of course by hardware. Based on such an understanding, the above technical solution can essentially or in other words be embodied in the form of a software product that contributes to the prior art. The computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a magnetic disk, an optical disk, etc., and includes a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods of each embodiment or some parts of the embodiment.

[0053] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A quantum-resistant chameleon hash encryption method, characterized in that: include: Based on private key and policy Generate hash value and random numbers ; According to the public parameters and strategies For plain text Encrypt and generate ciphertext ; Generate global common parameters based on LPN algorithm and LWE algorithm and the master key , and combined with strategies Calculating the hash value and ciphertext .

2. A quantum-resistant chameleon hash encryption method according to claim 1, characterized in that: Based on the private key and policy Generate hash value and random numbers Previously, the method also included: Generate the first common parameter of CH based on LPN algorithm and the first master key , based on the LWE algorithm to generate the second public parameter of ABE and the second master key , and embed strategies during the generation process , where the first common parameter generated and the second common parameter Distributed to all users, the first master key and the second master key It is stored securely by KGC and used to generate the user's key pair.

3. A quantum-resistant chameleon hash encryption method according to claim 2, characterized in that: According to the private key and policy Generate hash value and random numbers include: CH key generation: KGC uses the first master key and strategies , generate the user's first private key and the public key ; Hash calculation: User uses the first private key Combined with the input plaintext and strategies , through the Chameleon hash function Calculating the hash value and random numbers , hash value Access policies are embedded in the , ensuring that only users who meet the policies can verify or adapt the hash value; Verify: Check the hash value against the public key and policy Is it valid? Random number Is it correct, and the strategy Whether it matches or not, after successful verification, the user is allowed to proceed to the next stage of operation; Collision: User uses private key and the hash value of the input , random numbers , generate a new hash value and new random number , the hash value after the collision satisfies , ensuring that the hash value is in the new plaintext The following is still valid.

4. A quantum-resistant chameleon hash encryption method according to claim 3, characterized in that: The public parameters and strategies For plain text Encrypt and generate ciphertext include: ABE key generation: Only users who have passed the policy verification can enter the ABE part, KGC uses the second master key and the user's attribute collection Generate the user's second private key , the second private key Bind to the user's attribute set for subsequent encryption policy verification and decryption; ABE encryption: The encryption party uses public parameters and access policies , for plaintext Encryption, generated ciphertext Embedding strategy , ensuring that only User decryption; ABE decryption: User input ciphertext and the second private key , the system checks whether the user attributes meet the encryption policy , if satisfied, decryption is successful and the plaintext is restored ; Otherwise, the decryption fails and a failure flag is returned .

5. A quantum-resistant chameleon hash encryption method according to claim 1, characterized in that: The global common parameters generated based on the LPN algorithm and the LWE algorithm and the master key , and combined with strategies Calculating the hash value and ciphertext include: PCH key generation: KGC uses the global parameters of the LPN algorithm and the LWE algorithm, combined with the strategy , output the integrated global key for hash calculation, encryption and verification; Hash calculation: User input plain text , random numbers ,Strategy , verify that the user complies with the policy , and ensure that the hash value If the verification fails, the collision phase begins. Verification: Based on the user's attribute set and strategies , through ABE to the plaintext Encryption, generate ciphertext , the user provides the decryption key, combined with the verification results of ABE and CH, to decrypt the ciphertext ; Calculate collision and verification: When the user's attributes or policies do not meet the requirements, a new random number is regenerated using the collision mechanism of Chameleon Hash , and recalculate the new hash value , the result after the collision is re-verified, and ends if the verification fails; User decryption: If the user meets the post-collision policy , decryption is successful, and the plaintext is returned , if the user still does not meet the policy requirements, decryption fails.

6. A quantum-resistant chameleon hash encryption system, characterized in that: include: Generate a module configured to match private keys and policies Generate hash value and random numbers ; Encryption module, configured according to public parameters and strategies For plain text Encrypt and generate ciphertext ; The calculation module is configured to generate global common parameters based on the LPN algorithm and the LWE algorithm. and the master key , and combined with strategies Calculating the hash value and ciphertext .

7. An electronic device, characterized in that: include: At least one processor, and a memory communicatively connected to the at least one processor, wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to execute the method described in any one of claims 1 to 5.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 5 is implemented.

Images