Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Internet of Things Journal

Two-Round Identity-Based Proxy Blind Signature Scheme on Lattices

Quanrun Li, Jian Shen, Chao Lin, Zhichao Wang, Debiao He

Published Jun 5, 2025• 6 citations
Publisher

Abstract

As Internet technology develops swiftly, the significance of privacy protection is escalating in the realms of e-commerce, e-government and software security. Due to the combination of the benefits of proxy signatures and blind signatures, the proxy blind signature scheme not only distributes the workload across application networks but also effectively safeguards the confidentiality of sensitive information. Additionally, the identity-based proxy blind signature protocol can avoid the problem of heavy certificate management and is widely used in electronic commerce and other scenarios. However, some identity-based proxy blind signature protocols that rely on the large integer factorization problem and the discrete logarithm problem are unable to withstand from attacks from quantum computers. Furthermore, current lattice-based proxy blind signature protocols offer only heuristic security and require three rounds of information exchange during the signing phase. In this paper, we introduce a new two-round identity-based proxy blind signature scheme based on lattices. This scheme utilizes a zero-knowledge proof protocol on lattices as its core component to develop an interactive two-round signature scheme that is free from security proof vulnerabilities. Additionally, we validate the security of the proposed protocol within the random oracle model and conduct a performance analysis.

DOI
10.1109/jiot.2025.3576929

Related papers

Efficient Identity-Based Proxy Blind Signature Scheme over Lattices

Yi Yan, Mingming Jiang, Yanyan Kong +1 more

In response to the issues of low security and computational efficiency in current lattice-based proxy blind signature systems, a novel identity-based proxy blind signature scheme utilizing lattices is proposed. This scheme integrates the user's identity information through matrix accumulation operations to serve as the verification public key, simplifying the identity validation process and strengthening both security and privacy measures. The user's private key as well as the proxy signing key are produced through the extended algorithm of the left sampling algorithm, while the rejection sampling algorithm is employed to produce the proxy blind signature. These enhance the space utilisation of keys and signatures. Moreover, the scheme's security is reducible to solving the small integer solution problem, thereby attaining resilience against one-more unforgeability under the adaptive chosen-message attacks within the random oracle model. Compared to other schemes, our scheme features smaller key and signature sizes, resulting in greater efficiency.

International Conference on Computer, Vision and Intelligent Technology (ICCVIT)•Nov 24, 2024•1 citation

Post-Quantum Secure Identity-Based Proxy Blind Signature Scheme on a Lattice

Fengyin Li, Mengjiao Yang, Zhihao Song +2 more

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.

Entropy•Aug 2, 2023•15 citations

Identity-based proxy blind signature scheme on lattice in high-speed network environment

Mengjiao Yang, Dongmei Ke, Fengyin Li

The methods of network attacks are becoming more and more diverse In high-speed networks, and protecting private data is a key issue for users’ security. Proxy blind signature technology combines proxy and blind signature technology to achieve signature transitivity and message confidentiality. However, current signature schemes will not be secure in quantum environments. Meanwhile, the certificate storage of the existing scheme is relatively complicated. Therefore, to avoid the need for certificates and resist quantum attacks, this paper proposes an anti-quantum identity-based proxy blind signature (ID-Proxy-BS) scheme on lattice. This ID-Proxy-BS scheme improves the efficiency of signature through Gaussian distribution and sampling techniques. Security analysis shows that the scheme satisfies correctness, efficiency, blindness, and unforgeability.

Journal of High Speed Networks•Sep 15, 2023•1 citation

A Lattice‐Based Identity‐Based Proxy Blind Signature Scheme in the Standard Model

Lili Zhang, Yanqin Ma

A proxy blind signature scheme is a special form of blind signature which allowed a designated person called proxy signer to sign on behalf of original signers without knowing the content of the message. It combines the advantages of proxy signature and blind signature. Up to date, most proxy blind signature schemes rely on hard number theory problems, discrete logarithm, and bilinear pairings. Unfortunately, the above underlying number theory problems will be solvable in the postquantum era. Lattice‐based cryptography is enjoying great interest these days, due to implementation simplicity and provable security reductions. Moreover, lattice‐based cryptography is believed to be hard even for quantum computers. In this paper, we present a new identity‐based proxy blind signature scheme from lattices without random oracles. The new scheme is proven to be strongly unforgeable under the standard hardness assumption of the short integer solution problem (SIS) and the inhomogeneous small integer solution problem (ISIS). Furthermore, the secret key size and the signature length of our scheme are invariant and much shorter than those of the previous lattice‐based proxy blind signature schemes. To the best of our knowledge, our construction is the first short lattice‐based identity‐based proxy blind signature scheme in the standard model.

Mathematical Problems in Engineering•Jan 1, 2014•21 citations

Identity-based blind signature from lattices

Wen Gao, Yupu Hu, Baocang Wang +2 more

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.

Wuhan University Journal of Natural Sciences•Jul 14, 2017•7 citations

An Identity-Based Blind Signature Scheme Using Lattice with Provable Security

Quanrun Li, Ching-Fang Hsu, Debiao He +2 more

With the rapid development of quantum computing and quantum information technology, the universal quantum computer will emerge in the near decades with a very high probability and it could break most of the current public key cryptosystems totally. Due to the ability of withstanding the universal quantum computer’s attack, the lattice-based cryptosystems have received lots of attention from both industry and academia. In this paper, we propose an identity-based blind signature scheme using lattice. We also prove that the proposed scheme is provably secure in the random oracle model. The performance analysis shows that the proposed scheme has less mean value of sampling times and smaller signature size than previous schemes. Thus, the proposed scheme is more suitable for practical applications.

Mathematical Problems in Engineering•May 11, 2020•3 citations
As Internet technology develops swiftly, the significance of privacy protection is escalating in the realms of e-commerce, e-government and software security. Due to the combination of the benefits of proxy signatures and blind signatures, the proxy blind signature scheme not only distributes the workload across application networks but also effectively safeguards the confidentiality of sensitive information. Additionally, the identity-based proxy blind signature protocol can avoid the problem of heavy certificate management and is widely used in electronic commerce and other scenarios. However, some identity-based proxy blind signature protocols that rely on the large integer factorization problem and the discrete logarithm problem are unable to withstand from attacks from quantum computers. Furthermore, current lattice-based proxy blind signature protocols offer only heuristic security and require three rounds of information exchange during the signing phase. In this paper, we introduce a new two-round identity-based proxy blind signature scheme based on lattices. This scheme utilizes a zero-knowledge proof protocol on lattices as its core component to develop an interactive two-round signature scheme that is free from security proof vulnerabilities. Additionally, we validate the security of the proposed protocol within the random oracle model and conduct a performance analysis.
In response to the issues of low security and computational efficiency in current lattice-based proxy blind signature systems, a novel identity-based proxy blind signature scheme utilizing lattices is proposed. This scheme integrates the user's identity information through matrix accumulation operations to serve as the verification public key, simplifying the identity validation process and strengthening both security and privacy measures. The user's private key as well as the proxy signing key are produced through the extended algorithm of the left sampling algorithm, while the rejection sampling algorithm is employed to produce the proxy blind signature. These enhance the space utilisation of keys and signatures. Moreover, the scheme's security is reducible to solving the small integer solution problem, thereby attaining resilience against one-more unforgeability under the adaptive chosen-message attacks within the random oracle model. Compared to other schemes, our scheme features smaller key and signature sizes, resulting in greater efficiency.
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 methods of network attacks are becoming more and more diverse In high-speed networks, and protecting private data is a key issue for users’ security. Proxy blind signature technology combines proxy and blind signature technology to achieve signature transitivity and message confidentiality. However, current signature schemes will not be secure in quantum environments. Meanwhile, the certificate storage of the existing scheme is relatively complicated. Therefore, to avoid the need for certificates and resist quantum attacks, this paper proposes an anti-quantum identity-based proxy blind signature (ID-Proxy-BS) scheme on lattice. This ID-Proxy-BS scheme improves the efficiency of signature through Gaussian distribution and sampling techniques. Security analysis shows that the scheme satisfies correctness, efficiency, blindness, and unforgeability.
A proxy blind signature scheme is a special form of blind signature which allowed a designated person called proxy signer to sign on behalf of original signers without knowing the content of the message. It combines the advantages of proxy signature and blind signature. Up to date, most proxy blind signature schemes rely on hard number theory problems, discrete logarithm, and bilinear pairings. Unfortunately, the above underlying number theory problems will be solvable in the postquantum era. Lattice‐based cryptography is enjoying great interest these days, due to implementation simplicity and provable security reductions. Moreover, lattice‐based cryptography is believed to be hard even for quantum computers. In this paper, we present a new identity‐based proxy blind signature scheme from lattices without random oracles. The new scheme is proven to be strongly unforgeable under the standard hardness assumption of the short integer solution problem (SIS) and the inhomogeneous small integer solution problem (ISIS). Furthermore, the secret key size and the signature length of our scheme are invariant and much shorter than those of the previous lattice‐based proxy blind signature schemes. To the best of our knowledge, our construction is the first short lattice‐based identity‐based proxy blind signature scheme in the standard model.
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.
With the rapid development of quantum computing and quantum information technology, the universal quantum computer will emerge in the near decades with a very high probability and it could break most of the current public key cryptosystems totally. Due to the ability of withstanding the universal quantum computer’s attack, the lattice-based cryptosystems have received lots of attention from both industry and academia. In this paper, we propose an identity-based blind signature scheme using lattice. We also prove that the proposed scheme is provably secure in the random oracle model. The performance analysis shows that the proposed scheme has less mean value of sampling times and smaller signature size than previous schemes. Thus, the proposed scheme is more suitable for practical applications.