To ensure the quantum security requirement in Internet of Things (IoT) scenarios, we first propose certificateless anti-quantum blind signature (CLAQBS) for blockchain-based logistics donation system in IoT scenario, its security relies on the hardness of small integer problem on ring in number theory research unit lattice; the ethereum lightning network enhances the transaction speed of consortium blockchain and the rejection sampling algorithm improves the signature speed; it has short signature key and high-execution efficiency. Then, we propose certificateless anti-quantum sequential aggregate signature (CLAQSAS) for IoT intelligent invoice system, the signer performs sequential aggregate signature on invoice information of each different goods to generate a new signature; it ensures the anti-quantum security because of the unique nonsampling algorithm, trapdoor generation algorithm and matrix preimage sampling algorithm in lattice.
To ensure the quantum security requirement in Internet of Things (IoT) scenarios, we first propose certificateless anti-quantum blind signature (CLAQBS) for blockchain-based logistics donation system in IoT scenario, its security relies on the hardness of small integer problem on ring in number theory research unit lattice; the ethereum lightning network enhances the transaction speed of consortium blockchain and the rejection sampling algorithm improves the signature speed; it has short signature key and high-execution efficiency. Then, we propose certificateless anti-quantum sequential aggregate signature (CLAQSAS) for IoT intelligent invoice system, the signer performs sequential aggregate signature on invoice information of each different goods to generate a new signature; it ensures the anti-quantum security because of the unique nonsampling algorithm, trapdoor generation algorithm and matrix preimage sampling algorithm in lattice.
With the rapid development of quantum computers and quantum computing, Internet of Things (IoT) networks equipped with traditional cryptographic algorithms have become very weak against quantum attacks. This paper focuses on the privacy-preserving problem in IoT networks and proposes a certificateless ring signature (CLRS) scheme. This CLRS is constructed with lattice theories, which show promising advantages in resisting quantum attacks. Meanwhile, the certificateless mechanism reduces the key control ability of the key generation center (KGC) by adding personal secret keys to the private key generated by the system. Meanwhile, the ring signature mechanism protects users' privacy information through a non-central control mechanism. Next, the security proof in a random oracle model is given, which shows that this CLRS scheme can obtain unforgeability and ensure the signer's anonymity. Its security properties include non-repudiation, traceability, and post-quantum security. Then, the efficiency comparison and performance results show that this CLRS scheme is more efficient and practical than similar schemes. Moreover, this work presents an exploration of the post-quantum cryptographic algorithm and its application in IoT networks.
Blockchain technology has become a research hotspot in recent years with the prominent characteristics as public, distributed and decentration. And blockchain-enabled internet of things (BIoT) has a tendency to make a revolutionary change for the internet of things (IoT) which requires distributed trustless consensus. However, the scalability and security issues become particularly important with the dramatically increasing number of IoT devices. Especially, with the development of quantum computing, many extant cryptographic algorithms applied in blockchain or BIoT systems are vulnerable to the quantum attacks. In this paper, an anti-quantum proxy blind signature scheme based on the lattice cryptography has been proposed, which can provide user anonymity and untraceability in the distributed applications of BIoT. Then, the security proof of the proposed scheme can derive that it is secure in random oracle model, and the efficiency analysis can indicate it is efficient than other similar literatures.
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.
In the Forward Secure Ordered Aggregation (FssAgg) signature system, the signer gradually and orderly aggregates the signatures under different keys in different periods into one signature in a hierarchical “onion-like” manner. Among them, the innermost signature is the first signature. In addition, compared with ordinarily ordered aggregate signatures, forward secure requested aggregate signatures are the aggregation of different signatures of the same signer rather than the signatures of additional signers so that the signature verifier can use public key complete verification of all aggregation processes. The forward-safe ordered aggregate signature has the advantages of both forward-secure signature and aggregate signature. It has been widely used in many application scenarios, such as log systems and blockchains. Several existing forward-safe ordered aggregate signatures are based on traditional number theory problems, which will no longer be problematic in the post-quantum era. Therefore, finding a forward-safe requested aggregate signature in the quantum computing environment is imminent. Based on the small integer solution problem on the lattice, a forward-secure lattice-based rated aggregate signature scheme under the standard model is constructed. To achieve high efficiency, the system uses fixed-dimensional lattice-based delegation technology to realize critical updates and achieve forward security; then, the message to be signed and the difficulty problem on the lattice are respectively embedded into the signature using message addition technology and preimage sampling algorithm, making the signature unforgeable under the standard model.
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.
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.