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.
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.
Blind signatures have been widely applied when privacy preserving is required, and the delegation of blind signature rights and a proxy blind signature (Proxy-BS) become necessary when the signer cannot sign. Existing Proxy-BS schemes are based on traditional cryptographically hard problems, and they cannot resist quantum attacks. Moreover, most current Proxy-BS schemes depend on public key infrastructure (PKI), which leads to high certificate storage and management overhead. To simplify key management and resist quantum attacks, we propose a post-quantum secure identity-based proxy blind signature (ID-Proxy-BS) scheme on a lattice using a matrix cascade technique and lattice cryptosystem. Under the random oracle model (ROM), the security of the proposed scheme is proved. Security shows that the proposed scheme assures security against quantum attacks and satisfies the correctness, blindness, and unforgeability. In addition, we apply the ID-Proxy-BS scheme on a lattice to e-voting and propose a quantum-resistant proxy e-voting system, which is resistant to quantum attacks and achieves the efficiency of e-voting.
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.
Blind signature allows a user to get a signature of a signer on an arbitrary message, and the verifier can convince that the signature is indeed signed by the signer without leaking any information about the message. This property is necessary when the user’s privacy needs protection, such as a bank bill, a trade secret, etc. As an alternative of public key infrastructure, the identity-based system can simplify the key management procedures in certificate-based public key systems. Inspired by the requirement of identity-based blind signature in the post quantum world, we research on identity-based blind signature based on hard lattice problems under the random Oracle model. We propose a construction built upon the blind signature by Rückert, and it is proved to be one-more unforgeable against selective identity and chosen message attacks (sID-CMA) and unconditionally blind. The proposed scheme has 2 moves, and its security can be reduced to the small integer solution (SIS) problem.
Wireless sensor networks (WSNs) are pervasively employed in critical domains such as smart healthcare, industrial automation, and environmental surveillance, where secure access control is essential. User authentication protocols are vital for thwarting unauthorized intrusions, yet the vast majority of existing schemes rely on conventional public-key cryptography (such as ECC, RSA), which is provably insecure in the post-quantum era due to Shor's algorithm. This motivates the design of post-quantum authentication that is also lightweight for resource-limited sensors. To address this challenge, we propose an efficient authentication and key agreement protocol based on Number Theory Research Unit (NTRU), a lattice-based cryptosystem offering proven resistance to quantum attacks. We have proven the correctness and security of our scheme through BAN logic and random oracle model and demonstrated through informal analysis that our scheme can resist various attack methods and possesses high security features. Moreover, we thoroughly evaluate our protocol against the most recent state-of-the-art schemes. The results indicate that our scheme has the lowest computational cost, and its communication cost is superior to that of most other schemes. Overall, our proposed protocol provides a robust, efficient, and future-proof authentication solution for WSNs, well-suited for deploying WSNs environments.
Blind signature (BS) plays one of key ingredients in electronic cash or electronic voting system. However, the key exposures bring out very serious problems in insecure mobile devices. Forward-secure blind signatures preserve the validity of past signatures and prevent a forger from forging past signatures even if current secret key has been compromised. In this paper, we propose the first forward-secure identity-based shorter blind signature scheme from lattices which can resist quantum attack, and prove that our scheme satisfies the security requirements of blindness, unforgeability, and forward secrecy in the random oracle model. Furthermore, we also extend our construction to a forward-secure identity-based shorter blind signature in the standard model.
Traditional digital signatures are based on mathematical hard problems that are vulnerable to quantum attacks. For privacy-sensitive applications such as electronic cash and electronic voting, partially blind signatures are preferable because they protect private messages while allowing signers to verify necessary public information. This paper proposes an identity-based quantum partially blind signature scheme based on quantum teleportation. Each signing session is assigned a unique identifier. The user blinds the private binary message by applying Pauli-X operations with a one-time random string, while public information remains visible to the signer. A trusted PKG performs identity authentication, signature authorization, session-key distribution, and time-period-based key lifecycle management. Quantum tags and quantum authentication codes provide verification and arbitration evidence, while quantum teleportation is used to transmit quantum information. In case of disputes, an arbitrator can verify independently stored quantum evidence, and channel monitoring enables the detection of eavesdropping and tampering. Security analysis shows that the proposed scheme satisfies partial blindness, unforgeability, and non-repudiation, and resists malicious third-party attacks. It is suitable for privacy-preserving and restricted-authorization applications such as electronic cash and electronic voting.