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

Symmetry

Quantum-Resistant Lattice-Based Proxy Signature

Jinxuan Luo, Liming Zuo, Hao Liu

Published Feb 9, 2025• 2 citations
Publisher

Abstract

With the advancement of quantum computing, the utilization of quantum algorithms such as Shor’s algorithm enables the efficient resolution of problems that are intractable in classical computing paradigms, posing a significant threat to traditional signature schemes. Lattice-based cryptography is considered one of the most promising post-quantum cryptographic algorithms due to its computational advantages and potential resistance to quantum attacks. Proxy signature is an authorization mechanism that allows the original signer to delegate the signing power to a proxy. The security of existing proxy signature schemes is mostly based on classical hard problems, which cannot guarantee security under quantum attacks. Therefore, this paper combines lattice-based cryptography with proxy signatures to propose a new lattice-based proxy signature scheme (NLBPS). NLBPS constructs signatures using lattice-based trapdoor sampling algorithms and preimage sampling algorithms. Comparative analysis shows that the proposed scheme has relatively smaller key and signature sizes compared to some existing lattice-based proxy signature schemes, and it also offers a certain improvement in computational efficiency.

DOI
10.3390/sym17020261

Related papers

An Efficient Lattice-Based Proxy Signature Scheme without Trapdoor

Chunli Yang, Peigang Qiu, Shihui Zheng +1 more

Lattice-based proxy signature is a kind of signature that can resist the known quantum attack and a special digital signature which has the proxy functionality. So far, as far as I know, all lattice-based proxy signatures that use the "hash-and-sign" method of GPV08 signature are low efficient due to the time-consuming preimage sampleable algorithm. Based on the rejection sampling technique of Lyu12 signature, we proposed an efficient lattice-based proxy signature scheme without trapdoor, and the formal security proof of existentially unforgeable is given in random oracle model. In addition, the length of keys and signature in our scheme are shorter than all existing lattice-based proxy signature schemes, and the computations are also small.

International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)•Sep 1, 2015•9 citations

A novel lattice-based proxy signature scheme

Mohammad Beheshti-Atashgah, Mohsen Ajori, Mahmoud Gardeshi +1 more

In a proxy signature scheme, an original signer delegates his/her signing capability to a proxy signer and then the proxy signer can sign messages on behalf of the original signer. The security of many proxy signature schemes that have been proposed depends, either directly or indirectly, on either the difficulty of big integers factoring problem or the difficulty of finding discrete logarithm in a finite group. These types of schemes cannot resist quantum attacks. In this paper, we propose a new lattice-based proxy signature scheme which can resist quantum attacks. The proposed scheme is based on the GGH-signature scheme and also satisfies all the security requirements of proxy signature schemes.

Iranian Conference on Electrical Engineering•May 1, 2012•0 citations

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

Lattice-Based Proxy Signature

Yali Jiang, Fanyu Kong, Xiuling Ju

Those existing proxy signature schemes are mainly based on the assumed hardness of Big Integer Factoring problem and Discrete Logarithm problem. So they can't resist quantum attacks. This proxy signature scheme is based on the assumed hardness of some lattice problem, which can resist quantum attack. The key pair of proxy signer was generated using basis delegation technology. Combined with GPV basic signature scheme, the proxy signature scheme was constructed. This scheme is satisfied with all the security property of proxy signature schemes. Based on this scheme, variant lattice-based proxy signature schemes will be designed, such as blind proxy signature, multi-grade proxy signature, and identity-based proxy signature etc.

International Conference on Computational Intelligence and Security (CIS)•Dec 1, 2010•15 citations

Lattice-based proxy signature scheme with reject sampling method

Zoe L. Jiang, Yudong Liang, Zechao Liu +1 more

A proxy signature scheme permits an entity to delegate its signing rights to another. Proxy signature scheme has been widely used in numerous applications. This paper proposed a proxy signature scheme based on lattice cryptography which is different from traditional proxy signature schemes. This scheme combines the idea of the traditional proxy signature and the lattice-based signature together. The security of the proposed scheme is based on the Short Integer Solution (SIS) problem, the proposed proxy signature scheme has smaller key size and lower computation cost. We use the Bimodal Gaussian Distribution, Reject Sampling, Hash matrix and other technologies to extend the original digital signature scheme to the proxy signature scheme. In this paper we will give the security proof of the proxy signature scheme. Moreover, since the key construction of the scheme is based on the operation of the ring, so the public and private key size can be greatly shrunk.

International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)•Dec 1, 2017•5 citations

Lattice-based Proxy Signature Scheme in the Standard Model

Mingxiang Li, 郑艳娟, Ming XU

Abstract:The provably secure public-key cryptosystems in the standard model are more practical, but the provably secure lattice-based proxy signature schemes in the standard model have not been constructed up to now. A new lattice-based proxy signature scheme was constructed by using the Boyen’s preimage sampling algorithm.The proposed proxy signature scheme was proved to satisfy the existential unforgeability against adaptive chosen-message attacks based on the hardness of the small integer solution (SIS) problem in the standard model.Finally,the computational performance of the proposed proxy signature scheme was compared with that of the existing lattice-based proxy signature schemes.The comparative results showed that the proposed proxy signature scheme has higher efficiency.

•Jan 1, 2014•0 citations
With the advancement of quantum computing, the utilization of quantum algorithms such as Shor’s algorithm enables the efficient resolution of problems that are intractable in classical computing paradigms, posing a significant threat to traditional signature schemes. Lattice-based cryptography is considered one of the most promising post-quantum cryptographic algorithms due to its computational advantages and potential resistance to quantum attacks. Proxy signature is an authorization mechanism that allows the original signer to delegate the signing power to a proxy. The security of existing proxy signature schemes is mostly based on classical hard problems, which cannot guarantee security under quantum attacks. Therefore, this paper combines lattice-based cryptography with proxy signatures to propose a new lattice-based proxy signature scheme (NLBPS). NLBPS constructs signatures using lattice-based trapdoor sampling algorithms and preimage sampling algorithms. Comparative analysis shows that the proposed scheme has relatively smaller key and signature sizes compared to some existing lattice-based proxy signature schemes, and it also offers a certain improvement in computational efficiency.
Lattice-based proxy signature is a kind of signature that can resist the known quantum attack and a special digital signature which has the proxy functionality. So far, as far as I know, all lattice-based proxy signatures that use the "hash-and-sign" method of GPV08 signature are low efficient due to the time-consuming preimage sampleable algorithm. Based on the rejection sampling technique of Lyu12 signature, we proposed an efficient lattice-based proxy signature scheme without trapdoor, and the formal security proof of existentially unforgeable is given in random oracle model. In addition, the length of keys and signature in our scheme are shorter than all existing lattice-based proxy signature schemes, and the computations are also small.
In a proxy signature scheme, an original signer delegates his/her signing capability to a proxy signer and then the proxy signer can sign messages on behalf of the original signer. The security of many proxy signature schemes that have been proposed depends, either directly or indirectly, on either the difficulty of big integers factoring problem or the difficulty of finding discrete logarithm in a finite group. These types of schemes cannot resist quantum attacks. In this paper, we propose a new lattice-based proxy signature scheme which can resist quantum attacks. The proposed scheme is based on the GGH-signature scheme and also satisfies all the security requirements of proxy signature schemes.
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.
Those existing proxy signature schemes are mainly based on the assumed hardness of Big Integer Factoring problem and Discrete Logarithm problem. So they can't resist quantum attacks. This proxy signature scheme is based on the assumed hardness of some lattice problem, which can resist quantum attack. The key pair of proxy signer was generated using basis delegation technology. Combined with GPV basic signature scheme, the proxy signature scheme was constructed. This scheme is satisfied with all the security property of proxy signature schemes. Based on this scheme, variant lattice-based proxy signature schemes will be designed, such as blind proxy signature, multi-grade proxy signature, and identity-based proxy signature etc.
A proxy signature scheme permits an entity to delegate its signing rights to another. Proxy signature scheme has been widely used in numerous applications. This paper proposed a proxy signature scheme based on lattice cryptography which is different from traditional proxy signature schemes. This scheme combines the idea of the traditional proxy signature and the lattice-based signature together. The security of the proposed scheme is based on the Short Integer Solution (SIS) problem, the proposed proxy signature scheme has smaller key size and lower computation cost. We use the Bimodal Gaussian Distribution, Reject Sampling, Hash matrix and other technologies to extend the original digital signature scheme to the proxy signature scheme. In this paper we will give the security proof of the proxy signature scheme. Moreover, since the key construction of the scheme is based on the operation of the ring, so the public and private key size can be greatly shrunk.
Abstract:The provably secure public-key cryptosystems in the standard model are more practical, but the provably secure lattice-based proxy signature schemes in the standard model have not been constructed up to now. A new lattice-based proxy signature scheme was constructed by using the Boyen’s preimage sampling algorithm.The proposed proxy signature scheme was proved to satisfy the existential unforgeability against adaptive chosen-message attacks based on the hardness of the small integer solution (SIS) problem in the standard model.Finally,the computational performance of the proposed proxy signature scheme was compared with that of the existing lattice-based proxy signature schemes.The comparative results showed that the proposed proxy signature scheme has higher efficiency.