Threshold signature has been widely used in electronic wills, electronic elections, cloud computing, secure multi-party computation and other fields. Until now, certificateless threshold signature schemes are all based on traditional mathematic theory, so they cannot resist quantum computing attacks. In view of this, we combine the advantages of lattice-based cryptosystem and certificateless cryptosystem to construct a certificateless threshold signature from lattice (LCLTS) that is efficient and resistant to quantum algorithm attacks. LCLTS has the threshold characteristics and can resist the quantum computing attacks, and the analysis shows that it is unforgeable against the adaptive Chosen-Message Attacks (UF-CMA) with the difficulty of Inhomogeneous Small Integer Solution (ISIS) problem. In addition, LCLTS solves the problems of the certificate management through key escrow.
Threshold signature has been widely used in electronic wills, electronic elections, cloud computing, secure multi-party computation and other fields. Until now, certificateless threshold signature schemes are all based on traditional mathematic theory, so they cannot resist quantum computing attacks. In view of this, we combine the advantages of lattice-based cryptosystem and certificateless cryptosystem to construct a certificateless threshold signature from lattice (LCLTS) that is efficient and resistant to quantum algorithm attacks. LCLTS has the threshold characteristics and can resist the quantum computing attacks, and the analysis shows that it is unforgeable against the adaptive Chosen-Message Attacks (UF-CMA) with the difficulty of Inhomogeneous Small Integer Solution (ISIS) problem. In addition, LCLTS solves the problems of the certificate management through key escrow.
Certificateless signcryption can simultaneously provide certificateless signature and encryption. In recent years, many certificateless signcryption schemes have been proposed. However, these schemes are based on traditional mathematical theory and not have the ability of resisting the quantum computing attacks. Up to now, lattice-based certificateless signature or encryption schemes have been proposed; however, these schemes only have one function and cannot fulfill two functions of certificateless signature and encryption at the same time. In consideration of this reason, in this article, a certificateless signcryption scheme from lattice (L-CLSS) is constructed. L-CLSS has three advantages. First, in the random oracle model, it is provably indistinguishable against adaptive ciphertext-chosen attacks under the intractability of the learning with errors (LWE) problem and unforgeable against adaptive message-chosen attacks under the hardness of small integer solution (SIS) problem. Second, comparison with the cryptographic algorithms under the difficulty of large integer decomposition, L-CLSS can resist the quantum computing attacks. Third, L-CLSS has higher computation efficiency and a lower communication cost than the existing schemes.
Certificateless signatures (CLS) are noticeable because they may resolve the key escrow problem in ID-based signatures and break away the management problem regarding certificate in conventional signatures. However, the security of the mostly previous CLS schemes relies on the difficulty of solving discrete logarithm or large integer factorization problems. These two problems would be solved by quantum computers in the future so that the signature schemes based on them will also become insecure. For post-quantum cryptography, lattice-based cryptography is significant due to its efficiency and security. However, no study on addressing the revocation problem in the existing lattice-based CLS schemes is presented. In this paper, we focus on the revocation issue and present the first revocable CLS (RCLS) scheme over lattices. Based on the short integer solution (SIS) assumption over lattices, the proposed lattice-based RCLS scheme is shown to be existential unforgeability against adaptive chosen message attacks. By performance analysis and comparisons, the proposed lattice-based RCLS scheme is better than the previously proposed lattice-based CLS scheme, in terms of private key size, signature length and the revocation mechanism.
The certificateless cryptography solves the certificate management and key escrow problems in the Internet of Things. However, these schemes are no longer safe in the quantum environment. Lattice cryptography has become the main method to solve quantum security. At present, only a few lattice-based certificateless signature schemes have been proposed and the use of the trapdoor function limits the efficiency of the lattice cryptography, and the security of these schemes can only reach existential unforgeability. We construct a lattice-based certificateless signature scheme based on Lyubashevsky's signature scheme. The security of our scheme can reach strong unforgeability and the computational efficiency of our scheme is lower than the previous schemes.
With the rapid development of quantum computing technology, traditional collaborative signature schemes based on RSA and elliptic curve cryptography face significant security challenges. This paper proposes a lattice-based certificateless collaborative signature scheme (L-CCS) to address the security and efficiency requirements of multi-party collaboration in intelligent computing and network systems. By leveraging lattice problems such as the Small Integer Solution and Learning With Errors, our scheme ensures post-quantum security. The L-CCS eliminates the need for a trusted Key Generation Center and a dedicated aggregator, enhancing decentralization and system robustness. Our construction achieves existential unforgeability under adaptive chosen-message attacks in the random oracle model. Furthermore, we provide a practical implementation optimized for large-scale data sharing, demonstrating sublinear scalability in signature size and computation time.
A ring signature (RS) scheme enables a group member to sign messages on behalf of its group without revealing the definite signer identify, but this also leads to the abuse of anonymity by malicious signers, which can be prevented by traceable ring signatures (TRS). Up until that point, traceable ring signatures have been secure based on the difficult problem of number-theoretic (discrete logarithms or RSA), but since the advent of quantum computers, traditional traceable ring signatures may no longer be secure. Thus Feng proposed a lattice based TRS, which are resistant to attacks by quantum computers. However, that works did not tackle the certificate management problem. To close this gap, a quantum-resistant certificateless TRS scheme was proposed in the study. To the best of our knowledge, this is the first lattice based certificateless TRS. In detail, a specific TRS scheme was combined with the lattice-based certificateless signature technology to solve the certificate management problem while avoid key escrow problem. Additionally, a better zero-knowledge protocol is used to improve the computational efficiency of the scheme, and by reducing the soundness error of the zero-knowledge protocol, the number of runs of the zero-knowledge protocol is reduced, so that the communication overhead of the scheme is reduced. Under random oracle model, the proposed scheme satisfies tag-linkability, anonymity, exculpability and is secure based on the SIS problem and the DLWE problem. In conclusion, the proposed scheme is more practical and promising in e-voting.
The rapid proliferation of IoT technology has brought billions of devices into play that need to operate in a variety of diverse, resource-constrained environments. Secure authentication among these devices is a critical challenge, as traditional certificate-based public key infrastructures incur heavy computation and management overhead. Moreover, recent breakthroughs in quantum computing put at risk the security of classical cryptographic algorithms commonly used in IoT systems. This paper proposes a post-quantum certificateless authentication framework designed to address the efficiency-long-term security requirements of IoT environments. The proposed framework uses lattice-based cryptography to resist quantum-enabled adversaries while eliminating the need for digital certificates. The certificateless approach evades the problem of key escrow of identity-based cryptography and simplifies the key management process. A lightweight authentication protocol, which is suitable for constrained IoT devices, is developed. Security analyses prove that our proposed framework resists common attacks such as impersonation, replay, and man-in-the-middle attacks. The performance evaluation shows that our proposed framework reduces the communication and computational overheads compared with the traditional certificatebased authentication schemes. In this way, it is appropriate for large-scale and futureproof deployments of IoT systems.