Electronic cash (e-cash) has become major payment way in the era of internet of things. However, the leakage of user privacy and transaction data is becoming more and more serious in e-cash system. To solve these problems, we construct a new certificateless blind signcryption from NTRU lattice (NTRUL-CLBSC) suitable for e-cash. NTRUL-CLBSC has low communication overhead and high calculation efficiency because of small storage space and short key size in number theory research unit (NTRU) lattice. Based on RSIS and DNCC problems in NTRU lattice, NTRUL-CLBSC can guarantee the anti-quantum, anti-forgery, confidentiality and blindness, and there is no key escrow and certificate management in e-cash application.
Electronic cash (e-cash) has become major payment way in the era of internet of things. However, the leakage of user privacy and transaction data is becoming more and more serious in e-cash system. To solve these problems, we construct a new certificateless blind signcryption from NTRU lattice (NTRUL-CLBSC) suitable for e-cash. NTRUL-CLBSC has low communication overhead and high calculation efficiency because of small storage space and short key size in number theory research unit (NTRU) lattice. Based on RSIS and DNCC problems in NTRU lattice, NTRUL-CLBSC can guarantee the anti-quantum, anti-forgery, confidentiality and blindness, and there is no key escrow and certificate management in e-cash application.
With the development of wireless sensor networks, IoT devices are crucial for the Smart City; these devices change people's lives such as e-payment and e-voting systems. However, in these two systems, the state-of-art authentication protocols based on traditional number theory cannot defeat a quantum computer attack. In order to protect user privacy and guarantee trustworthy of big data, we propose a new identity-based blind signature scheme based on number theorem research unit lattice, this scheme mainly uses a rejection sampling theorem instead of constructing a trapdoor. Meanwhile, this scheme does not depend on complex public key infrastructure and can resist quantum computer attack. Then we design an e-payment protocol using the proposed scheme. Furthermore, we prove our scheme is secure in the random oracle, and satisfies confidentiality, integrity, and non-repudiation. Finally, we demonstrate that the proposed scheme outperforms the other traditional existing identity-based blind signature schemes in signing speed and verification speed, outperforms the other lattice-based blind signature in signing speed, verification speed, and signing secret key size.
Although the current lattice-based ring signcryption scheme resists quantum attacks,it has large key storage and high encryption/decryption time.The linkable lattice ring signcryption scheme not only can protect signer anonymity,but also can determine whether two signatures are generated by the same signer.Thus,based on the compact Gaussian sampling algorithm and rejection sampling technique,the identity-based linkable ring signcryption scheme is constructed on the NTRU lattice.Firstly,the system master key is generated using the trapdoor generation algorithm on the NTRU lattice.Then private keys of ring members are obtained based on the compact Gaussian sampling algorithm.Finally,the user signature is generated using rejection sampling,and the key encapsulation mechanism encrypts the signature.Security proof in the random oracle model (ROM) that DRLWE and NTRU small integer solutions are difficult to solve ensures confidentiality,unforgeability,unconditional anonymity,and linkability.Performance analysis shows that compared to the lattice-based ring signcryption and linkable ring signature schemes on NTRU,the proposed scheme has a smaller public key and lower encryption/decryption cost,greatly improving efficiency.
At present, several post-quantum cryptosystems have been proposed, and lattice-based cryptography is the main candidate. Especially in the direction of digital signatures, there are now many practical lattice-based signature schemes. However, there exist few lattice-based signatures with special property such as blind signature. Blind signature was introduced by Chaum for creating untraceable payment system. Then, it is widely used in e-cash and voting, especially in the revolutionary digital cash system based on blockchain. In our paper, we present a method to construct a post-quantum blind signature based on lattice assumptions, and we proved that any existential forger against the security of the resulting scheme can solve theSISq,n,m,βproblem forβ=O(dn). Our main technique is the rejection sampling theory. The expected number of times needed to output a blind signature is at moste2under aborting, and our new scheme has much smaller signature size than those of all the previously proposed blind signature schemes over lattices.
The enormous benefits of Internet of Things (IoT) technology have driven its deployment in various applications. Additionally, the development of quantum computers has directed attention towards lattice-based cryptography. Consequently, the computational capabilities of quantum computers pose a threat to the security of the existing IoT signature mechanisms. Quantum computers are proficient at unraveling the complexity bound of computationally hard problems like the integer factorization problem (IFP) and the discrete logarithm problem (DLP). As a result, security is an essential requirement for the IoT communication network against quantum attacks. The amalgamation of certificateless public key cryptosystems (CL-PKC) and lattice-based cryptography (LBC) is one of the solution for alleviating these security menaces. Lucidly, CL-PKC prevents key escrow issues and key management problems; LBC prevents quantum attacks. The Shortest Integer Solution (SIS) problem, which the NTRU lattices offer, serves as the basis for this paper’s introduction of a certificateless signature mechanism for IoT environments. By adopting the Random Oracle Model, we demonstrated the security of the suggested mechanism against Type 1 and Type 2 attackers. Furthermore, security analysis and performance evaluation demonstrate robust communication, as evidenced by metrics such as the computational cost of CL-Sign and CL-Verify phases at 536μs, 376.81μs and communication cost of KGC at 418 bits, CL-Sign at 532 bits and CL-Verify at 446 bits. Also, we calculate the cost of single-message signature generation and verification on an IoT device. These results show that the suggested mechanism’s security and computational efficiency are more reliable, and efficient than other relevant competing frameworks.
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.
The Edge-enabled Industrial Internet of Things (Edge-IIoT) has emerged as a fundamental architecture for intelligent manufacturing by enabling low-latency data collection, processing, and communication among distributed industrial devices. However, the open and distributed nature of Edge-IIoT introduces significant challenges to secure data authentication and privacy preservation. Meanwhile, conventional public key infrastructure incurs considerable certificate management overhead and is not well suited for future industrial environments in the presence of quantum computing. To address these challenges, this paper proposes a lattice-based certificateless blind signature scheme for secure and privacy-preserving authentication in Edge-IIoT. The proposed scheme integrates the Dilithium signature algorithm with certificateless public key cryptography and blind signature techniques to simultaneously provide anonymous authentication, data integrity, conditional identity revocation, and post-quantum security while eliminating the certificate management overhead associated with traditional public key infrastructures. Furthermore, the proposed construction improves existing lattice-based certificateless blind signature schemes by addressing identified security weaknesses and strengthening resistance against forgery attacks, while effectively avoiding the key escrow problem inherent in identity-based cryptography. The correctness, blindness, and unforgeability of the proposed scheme are formally proved in the random oracle model based on the hardness of the Module Short Integer Solution (MSIS) problem. In addition, theoretical performance analysis demonstrates that the proposed scheme incurs acceptable computational, communication, and storage overhead while providing comprehensive security properties, including certificateless operation, identity anonymity, no key escrow, conditional revocation, and post-quantum security. Overall, the proposed scheme achieves an effective balance between security, privacy preservation, and efficiency, which exhibits favorable theoretical security-efficiency trade-offs for secure industrial data authentication in resource-constrained Edge-IIoT environments. Practical implementation is left for future investigation.