Post-quantum non-certificate signature generation method and device based on symmetric cipher primitives

Abstract

The application provides a post-quantum certificateless signature generation method and device based on symmetric cryptographic primitives. The method comprises steps 1 to 7. The application initiatively proposes a post-quantum certificateless signature based on symmetric cryptographic primitives, generates zero-knowledge proof through secure multi-party computation, can achieve the purpose of resisting quantum, and satisfies the post-quantum security requirement of the generation of the certificateless signature, thereby improving the security of the target to be protected.

Description

Technical Field

[0001] This invention relates to the field of information security technology, and in particular to a post-quantum certificateless signature generation method and device based on symmetric cryptographic primitives. Background Technology

[0002] Digital signatures are an important technological means of protecting user privacy and security. By utilizing cryptographic algorithms, they achieve functions similar to paper signatures, ensuring the integrity, authenticity, and non-repudiation of the signed information. With the continuous development of the internet, scenarios requiring user authentication and the protection of digital resource integrity are emerging. Currently, digital signatures are widely used in various fields such as commerce, education, and healthcare.

[0003] Certificateless signature is a cryptographic system that lies between certificate-based and identity-based public-key cryptography. It does not require the certificate authority (CA) to authenticate the certificate, as is the case in traditional certificate-based cryptography, nor does it involve key escrow.

[0004] Post-quantum signatures based on symmetric cryptographic primitives. While digital signatures formally fall under the category of public-key cryptography, theoretically, they can be constructed using only one-way functions of symmetric cryptography, without requiring difficult problems like the RSA problem or lattice problems that generate trapdoor structures. For example, in the post-quantum cryptographic algorithm standard evaluation conducted by the National Institute of Standards and Technology (NIST), the Picnic algorithm in the third round of candidates only relies on symmetric cryptographic algorithms such as hash functions and the LowMC block cipher, while the SPHINCS+ algorithm even only relies on hash functions. Digital signature algorithms typically use hash functions to compress messages into digests; therefore, post-quantum signatures based on symmetric cryptographic primitives utilize the fewest cryptographic primitives and offer the most conservative security. Therefore, developing a post-quantum certificateless signature generation method and device based on symmetric cryptographic primitives can effectively overcome the shortcomings of the aforementioned related technologies, making it a pressing technical problem for the industry. Summary of the Invention

[0005] To address the aforementioned problems in the existing technology, embodiments of the present invention provide a post-quantum certificateless signature generation method and device based on symmetric cryptographic primitives.

[0006] In a first aspect, embodiments of the present invention provide a post-quantum certificateless signature generation method based on symmetric cryptographic primitives, comprising: Step 1, given a security parameter n, performing system initialization; Step 2, given a user identity id and a master private key CLSK, outputting the user's partial private key CLD. id Step 3: Given the security parameter n and the user identity id, output the user secret value CLS. id Step 4: Input system parameters params, user's partial private key CLD id And the user's secret value CLS id Output the signature key CLSK id Step 5: Input system parameters params, user ID, and user secret value CLS. id Output verification key CLPK id Step 6, given user A's private key CLSK id Message m, output signature value σ; Step 7, given message m, signature value σ = (π1,π2), perform signature verification.

[0007] Based on the above method embodiments, the post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided in this embodiment of the invention specifically includes step 1: randomly selecting in For the distribution of a family of one-way functions based on symmetric cryptography, The distribution of the secret input x; Calculate the symmetric cipher f. k The encrypted output y = f k (x); Let the system parameter params←(y,k) and the master private key CLSK←(params,x), and return (params,CLSK).

[0008] Based on the above method embodiments, the post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided in this embodiment of the invention specifically includes step 2 as follows: parsing CLSK as (pk,x), calculating the zero-knowledge proof π = (r,s)←Prove((y,k),x), where r is the random number generated by the prover, s is the proof generated by the prover for the secret value x, and the internal challenge value c←H(r,id); outputting the user's partial private key CLD. id ←π.

[0009] Based on the above method embodiments, the post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided in this embodiment of the invention specifically includes step 3: randomly selecting... calculate Let PK id ←(y1,k1),CLS id ←(pkid ,sk id ), return to CLS id .

[0010] Based on the above method embodiments, the post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided in this embodiment of the invention specifically includes step 4: parsing the user secret value CLS. id For (pk) id ,sk id ); Let CLSK id ←(CLD id ,sk id Returns the signing key CLSK id Step 5 specifically includes: parsing CLS id For (pk) id ,sk id ); Let CLPK id ←pk id Return to CLPK id .

[0011] Based on the above method embodiments, the post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided in this embodiment of the invention specifically includes step 6: parsing CLSK. id For (CLD) id ,sk id ); Calculate the zero-knowledge proof π1=(r1,s1)←Prove((y1,k1),sk id ), where the internal challenge value c1←H(r1,m); calculate the zero-knowledge proof π2=(r2,s2)←Prove((y,k),(CLD) id ,id)), where the internal challenge value c2←H(r1,r2); the output signature value σ←(π1,π2).

[0012] Based on the above method embodiments, the post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided in this embodiment of the invention specifically includes step 7: verifying Verify((y,k),(π1,π2))=1, where the internal challenge value c2←H(r1,r2); verifying Verify((y1,k1),π1)=1, where the internal challenge value c1←H(r1,m).

[0013] Secondly, embodiments of the present invention provide a post-quantum certificateless signature generation device based on symmetric cryptographic primitives, comprising: a first main module for implementing step 1, given a security parameter n, performing system initialization; and a second main module for implementing step 2, given a user identity id and a master private key CLSK, outputting a user partial private key CLD. idThe third main module is used to implement step 3, which, given the security parameter n and the user identity id, outputs the user secret value CLS. id The fourth main module is used to implement step 4, which involves inputting system parameters (params) and the user's private key (CLD). id And the user's secret value CLS id Output the signature key CLSK id The fifth main module is used to implement step 5, which involves inputting system parameters params, user ID, and user secret value CLS. id Output verification key CLPK id The sixth main module is used to implement step 6, given user A's private key CLSK. id The first module is the message m, which outputs the signature value σ. The seventh main module is used to implement step 7, given the message m and the signature value σ = (π1,π2), to perform signature verification.

[0014] Thirdly, embodiments of the present invention provide an electronic device, comprising:

[0015] At least one processor; and

[0016] At least one memory communicatively connected to the processor, wherein:

[0017] The memory stores program instructions that can be executed by the processor. The processor can call the program instructions to execute the post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided by any of the various implementations of the first aspect.

[0018] Fourthly, embodiments of the present invention provide a non-transitory computer-readable storage medium storing computer instructions that cause a computer to execute a post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided by any of the various implementations of the first aspect.

[0019] The present invention provides a method and apparatus for generating post-quantum certificateless signatures based on symmetric cryptographic primitives. It innovatively proposes a post-quantum certificateless signature based on symmetric cryptographic primitives, which generates zero-knowledge proofs through secure multi-party computation, thereby achieving quantum resistance. The generation of certificateless signatures meets the post-quantum security requirements and improves the security of the target to be protected. Attached Figure Description

[0020] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0021] Figure 1 A flowchart of a post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided in an embodiment of the present invention;

[0022] Figure 2 A schematic diagram of a post-quantum certificateless signature generation device based on symmetric cryptographic primitives provided in an embodiment of the present invention;

[0023] Figure 3 This is a schematic diagram of the physical structure of an electronic device provided in an embodiment of the present invention. Detailed Implementation

[0024] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention. In addition, the technical features of the various embodiments or individual embodiments provided by the present invention can be arbitrarily combined with each other to form feasible technical solutions. Such combinations are not constrained by the order of steps and / or structural composition patterns, but must be based on the ability of those skilled in the art to implement them. When the combination of technical solutions is contradictory or cannot be implemented, it should be considered that such a combination of technical solutions does not exist and is not within the scope of protection claimed by the present invention.

[0025] This invention provides a post-quantum certificateless signature generation method based on symmetric cryptographic primitives, see [link to relevant documentation]. Figure 1 The method includes: Step 1, given a security parameter n, performing system initialization; Step 2, given a user identity id and a master private key CLSK, outputting the user's partial private key CLD. id Step 3: Given the security parameter n and the user identity id, output the user secret value CLS. id Step 4: Input system parameters params, user's partial private key CLD id And the user's secret value CLS id Output the signature key CLSK id Step 5: Input system parameters params, user ID, and user secret value CLS.id Output verification key CLPK id Step 6, given user A's private key CLSK id Message m, output signature value σ; Step 7, given message m, signature value σ = (π1,π2), perform signature verification.

[0026] Based on the above method embodiments, as an optional embodiment, the post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided in this embodiment of the invention specifically includes step 1: randomly selecting... in For the distribution of a family of one-way functions based on symmetric cryptography, The distribution of the secret input x; computation of the symmetric cipher f. k The encrypted output y = f k (x); Let the system parameter params←(y,k) and the master private key CLSK←(params,x), and return (params,CLSK).

[0027] Based on the above method embodiments, as an optional embodiment, the post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided in this embodiment of the invention specifically includes step 2 as follows: parsing CLSK as (pk,x), calculating the zero-knowledge proof π = (r,s)←Prove((y,k),x), where r is the random number generated by the prover, s is the proof generated by the prover for the secret value x, and the internal challenge value c←H(r,id); outputting the user's partial private key CLD. id ←π.

[0028] Based on the above method embodiments, as an optional embodiment, the post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided in this embodiment of the invention specifically includes step 3: randomly selecting... calculate Let PK id ←(y1,k1),CLS id ←(pk id ,sk id ), return to CLS id .

[0029] Based on the above method embodiments, as an optional embodiment, the post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided in this embodiment of the invention specifically includes step 4: parsing the user secret value CLS. id For (pk) id ,sk id ); Let CLSK id ←(CLD id ,sk idReturns the signing key CLSK id Step 5 specifically includes: parsing CLS id For (pk) id ,sk id ); Let CLPK id ←pk id Return to CLPK id .

[0030] Based on the above method embodiments, as an optional embodiment, the post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided in this embodiment of the invention specifically includes step 6: parsing CLSK. id For (CLD) id ,sk id ); Calculate the zero-knowledge proof π1=(r1,s1)←Prove((y1,k1),sk id ), where the internal challenge value c1←H(r1,m); calculate the zero-knowledge proof π2=(r2,s2)←Prove((y,k),(CLD) id ,id)), where the internal challenge value c2←H(r1,r2); the output signature value σ←(π1,π2).

[0031] Based on the above method embodiments, as an optional embodiment, the post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided in this embodiment of the invention specifically includes step 7: verifying Verify((y,k),(π1,π2))=1, where the internal challenge value c2←H(r1,r2); verifying Verify((y1,k1),π1)=1, where the internal challenge value c1←H(r1,m).

[0032] The post-quantum certificateless signature generation method based on symmetric cryptographic primitives provided in this invention provides an innovative approach to post-quantum certificateless signature generation. By generating zero-knowledge proofs through secure multi-party computation, it achieves quantum resistance. The certificateless signature generation meets post-quantum security requirements and improves the security of the target to be protected.

[0033] The implementation of the various embodiments of the present invention is based on programmed processing through a device with processor functionality. Therefore, in practical engineering, the technical solutions and functions of the various embodiments of the present invention can be encapsulated into various modules. Based on this reality, and building upon the above embodiments, the embodiments of the present invention provide a post-quantum certificateless signature generation device based on symmetric cryptographic primitives. This device is used to execute the post-quantum certificateless signature generation method based on symmetric cryptographic primitives in the above method embodiments. See also... Figure 2The device includes: a first main module for implementing step 1, which involves initializing the system given a security parameter n; and a second main module for implementing step 2, which involves outputting the user's partial private key CLD given a user identity id and a master private key CLSK. id The third main module is used to implement step 3, which, given the security parameter n and the user identity id, outputs the user secret value CLS. id The fourth main module is used to implement step 4, which involves inputting system parameters (params) and the user's private key (CLD). id And the user's secret value CLS id Output the signature key CLSK id The fifth main module is used to implement step 5, which involves inputting system parameters params, user ID, and user secret value CLS. id Output verification key CLPK id The sixth main module is used to implement step 6, given user A's private key CLSK. id The first module is the message m, which outputs the signature value σ. The seventh main module is used to implement step 7, given the message m and the signature value σ = (π1,π2), to perform signature verification.

[0034] The post-quantum certificateless signature generation device based on symmetric cryptographic primitives provided in this invention adopts... Figure 2 Several modules in the paper innovatively propose post-quantum certificateless signatures based on symmetric cryptographic primitives. By generating zero-knowledge proofs through secure multi-party computation, it can achieve quantum resistance. The generation of certificateless signatures meets the post-quantum security requirements and improves the security of the target to be protected.

[0035] It should be noted that the apparatus in the device embodiments provided by the present invention can be used not only to implement the methods in the above method embodiments, but also to implement the methods in other method embodiments provided by the present invention. The difference lies only in the setting of corresponding functional modules. Its principle is basically the same as that of the above device embodiments provided by the present invention. As long as those skilled in the art, based on the above device embodiments and referring to the specific technical solutions in other method embodiments, obtain corresponding technical means and technical solutions composed of these technical means by combining technical features, and improve the apparatus in the above device embodiments while ensuring the practicality of the technical solutions, they can obtain corresponding device-type embodiments for implementing the methods in other method-type embodiments. For example:

[0036] Based on the above device embodiments, as an optional embodiment, the post-quantum certificateless signature generation device based on symmetric cryptographic primitives provided in this embodiment of the invention further includes: a first submodule, used to implement step 1, specifically including: randomly selecting... in For the distribution of a family of one-way functions based on symmetric cryptography, The distribution of the secret input x; computation of the symmetric cipher f. k The encrypted output y = f k (x); Let the system parameter params←(y,k) and the master private key CLSK←(params,x), and return (params,CLSK).

[0037] Based on the above device embodiments, as an optional embodiment, the post-quantum certificateless signature generation device based on symmetric cryptographic primitives provided in this embodiment of the invention further includes: a second submodule, used to implement step 2 specifically including: parsing CLSK as (pk,x), calculating the zero-knowledge proof π=(r,s)←Prove((y,k),x), where r is the random number generated by the prover, s is the proof generated by the prover for the secret value x, and the internal challenge value c←H(r,id); outputting the user's partial private key CLD. id ←π.

[0038] Based on the above device embodiments, as an optional embodiment, the post-quantum certificateless signature generation device based on symmetric cryptographic primitives provided in this embodiment of the invention further includes: a third submodule, used to implement step 3, specifically including: randomly selecting... calculate Let PK id ←(y1,k1),CLS id ←(pk id ,sk id ), return to CLS id .

[0039] Based on the above device embodiments, as an optional embodiment, the post-quantum certificateless signature generation device based on symmetric cryptographic primitives provided in this embodiment of the invention further includes: a fourth submodule, used to implement step 4, specifically including: parsing the user secret value CLS. id For (pk) id ,sk id ); Let CLSK id ←(CLD id ,sk id Returns the signing key CLSK id Step 5 specifically includes: parsing CLS id For (pk) id ,sk id ); Let CLPK id ←pk id Return to CLPK id .

[0040] Based on the above device embodiments, as an optional embodiment, the post-quantum certificateless signature generation device based on symmetric cryptographic primitives provided in this embodiment of the invention further includes: a fifth submodule, used to implement step 6, specifically including: parsing CLSK. id For (CLD) id ,sk id ); Calculate the zero-knowledge proof π1=(r1,s1)←Prove((y1,k1),sk id ), where the internal challenge value c1←H(r1,m); calculate the zero-knowledge proof π2=(r2,s2)←Prove((y,k),(CLD) id ,id)), where the internal challenge value c2←H(r1,r2); the output signature value σ←(π1,π2).

[0041] Based on the above device embodiments, as an optional embodiment, the post-quantum certificateless signature generation device based on symmetric cryptographic primitives provided in this embodiment of the invention further includes: a sixth sub-module, used to implement step 7 specifically including: verifying Verify((y,k),(π1,π2))=1, where the internal challenge value c2←H(r1,r2); verifying Verify((y1,k1),π1)=1, where the internal challenge value c1←H(r1,m).

[0042] The method in this embodiment of the invention is implemented using an electronic device; therefore, it is necessary to introduce the relevant electronic device. For this purpose, this embodiment of the invention provides an electronic device, such as... Figure 3 As shown, the electronic device includes at least one processor, a communications interface, at least one memory, and a communications bus, wherein the at least one processor, the communications interface, and the at least one memory communicate with each other via the communications bus. The at least one processor can invoke logical instructions stored in the at least one memory to execute all or part of the steps of the methods provided in the foregoing method embodiments.

[0043] Furthermore, when the logical instructions in at least one of the aforementioned memories can be implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various method embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0044] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.

[0045] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.

[0046] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. Based on this understanding, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than those shown in the drawings. For example, two consecutive blocks may actually be executed substantially in parallel, or sometimes in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or action, or using a combination of dedicated hardware and computer instructions.

[0047] It should be noted that the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0048] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A post-quantum certificateless signature generation method based on symmetric cryptographic primitives, characterized in that, include: Step 1: Given the security parameter n, perform system initialization; Step 2: Given the user's identity id and master private key CLSK, output the user's partial private key. ; Step 3: Given the security parameter n and the user's identity ID, output the user's secret value. Step 4: Input system parameters params, and the user's partial private key. and user secret value Output the signature key Step 5: Input system parameters params, user ID, and user secret value. Output verification key Step 6, given user A's private key Message m, output signature value Step 7, given message m, signature value Perform signature verification; Step 4 specifically includes: parsing the user's secret value. for ;make Return the signing key Step 5 specifically includes: parsing for ;make ,return ; Step 6 specifically includes: parsing for Computational zero-knowledge proofs The internal challenge value Computational zero-knowledge proofs The internal challenge value Output signature value .

2. The method for generating post-quantum certificateless signatures based on symmetric cryptographic primitives according to claim 1, characterized in that, Step 1 specifically includes: random selection , ,in For the distribution of a family of one-way functions based on symmetric cryptography, The distribution of the secret input x; computation of the symmetric cipher. Encrypted output ; set system parameters Master private key ,return .

3. The method for generating post-quantum certificateless signatures based on symmetric cryptographic primitives according to claim 2, characterized in that, Step 2 specifically includes: resolving CLSK to (pk,x) and calculating the zero-knowledge proof. Where r is the random number generated by the prover, s is the proof generated by the prover for the secret value x, and the internal challenge value. Output the user's partial private key. .

4. The method for generating post-quantum certificateless signatures based on symmetric cryptographic primitives according to claim 3, characterized in that, Step 3 specifically includes: random selection , ,calculate ;make , ,return .

5. The method for generating post-quantum certificateless signatures based on symmetric cryptographic primitives according to claim 1, characterized in that, Step 7 specifically includes: verification The internal challenge value ;verify The internal challenge value .

6. A post-quantum certificateless signature generation device based on symmetric cryptographic primitives, based on the post-quantum certificateless signature generation method based on symmetric cryptographic primitives as described in any one of claims 1 to 5, characterized in that, include: The first main module is used to implement step 1, which involves initializing the system given a security parameter n; the second main module is used to implement step 2, which involves outputting the user's partial private key given a user identity ID and master private key CLSK. The third main module is used to implement step 3, which, given the security parameter n and the user's identity ID, outputs the user's secret value. The fourth main module is used to implement step 4, which involves inputting system parameters (params) and the user's private key. and user secret value Output the signature key ; The fifth main module is used to implement step 5, which involves inputting system parameters (params), user ID, and user secret value. Output verification key ; The sixth main module is used to implement step 6, given user A's private key. Message m, output signature value ; The seventh main module is used to implement step 7, given message m, signature value Then, perform signature verification.

7. An electronic device, characterized in that, include: At least one processor, at least one memory, and a communication interface; wherein, The processor, memory, and communication interface communicate with each other; The memory stores program instructions that can be executed by the processor, which invokes the program instructions to perform the method described in any one of claims 1 to 5.

8. A non-transitory computer-readable storage medium, characterized in that, The non-transitory computer-readable storage medium stores computer instructions that cause the computer to perform the method described in any one of claims 1 to 5.

Images