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 Access

Blind Proxy Re-Signature Scheme Based on Isomorphisms of Polynomials

Huixian Li, Han Zhipeng, Liqin Wang, Liaojun Pang

Published Jan 1, 2018• 4 citations
Publisher

Abstract

Most of the existing blind proxy re-signature schemes are designed based on the traditional public key cryptosystems, whose security relies on the hardness of big integer factoring, discrete logarithm, elliptic curve discrete logarithm, and so on. However, these problems will be unsecure when facing the attack of quantum computers. Motivated by these concerns, we proposed a blind proxy re-signature scheme based on the problem of isomorphisms of polynomials, which can resist quantum attack, and gave its security proof under the random oracle model. In the proposed scheme, the message can be kept blind by using the hash function, and the delegatee's identity can be kept anonymous by using the problem of isomorphisms of polynomials. Compared with the existing schemes, the new scheme has more secure properties, such as quantum resistance, high efficiency, message blindness, and delegatee anonymity. It is concluded that the proposed scheme has a good application prospect in the future quantum computing environment with low-power hardware.

DOI
10.1109/access.2018.2869041

Related papers

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•16 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•16 citations

Collusion-resistant unidirectional proxy re-encryption scheme from lattices

Kee Sung Kim, Ik Rae Jeong

Most of the previous proxy re-encryption schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, they cannot guarantee its security under quantum analysis, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. In the paper, we propose the first proxy re-encryption scheme based on the hard worst-case lattice problems. Our scheme has many useful properties as follows: Unidirectional, collusion-resistant, noninteractive, proxy invisible, key optimal, and nontransitive. We also provided the formal security proof of the proposed scheme in the random oracle model.

Journal of Communications and Networks•Feb 1, 2016•14 citations

MPKC-based Threshold Proxy Signcryption Scheme

Huixian Li, Gao Jin, Wang Lingyun +1 more

The threshold proxy signcryption can implement signature and encryption simultaneously in one logical step, and can be used to realize the decentralized protection of the group signature key, so it is an efficient technology for network security. Currently, most of the existing threshold proxy signcryption schemes are designed based on the traditional public key cryptosystems, and their security mainly depends on the difficulty of the large integer decomposition and the discrete logarithm. However, the traditional public key cryptosystems cannot resist the quantum computer attack, which makes the existing threshold proxy signcryption schemes based on traditional public key cryptosystems insecure against quantum attacks. Motivated by these concerns, we proposed a threshold proxy signcryption scheme based on Multivariate Public Key Cryptosystem (MPKC) which is one of the quantum attack-resistent public key algorithms. Under the premise of satisfying the threshold signcryption requirements of the threshold proxy, our scheme can not only realize the flexible participation of the proxy signcrypters but also resist the quantum computing attack. Finally, based on the assumption of Multivariate Quadratic (MQ) problem and Isomorphism Polynomial (IP) problem, the proof of the confidentiality and the unforgeability of the proposed scheme under the random oracle model is given.

The International Arab Journal of Information Technology•Feb 28, 2019•0 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

A Quantum Resistant Lattice-based Blind Signature Scheme for Blockchain

Hakjun Lee

In the 4th industrial revolution, the blockchain that distributes and manages data through a P2P network is used as a new decentralized networking paradigm in various fields such as manufacturing, culture, and public service. However, with the advent of quantum computers, quantum algorithms that are able to break existing cryptosystems such as hash function, symmetric key, and public key cryptography have been introduced. Currently, because most major blockchain systems use an elliptic curve cryptography to generate signatures for transactions, they are insecure against the quantum adversary. For this reason, the research on the quantum-resistant blockchain that utilizes lattice-based cryptography for transaction signatures is needed. Therefore, in this paper, we propose a blind signature scheme for the blockchain in which the contents of the signature can be verified later, as well as signing by hiding the contents to be signed using lattice-based cryptography with the property of quantum resistance. In addition, we prove the security of the proposed scheme using a random oracle model.

Korean Institute of Smart Media•Mar 30, 2023•1 citation
Most of the existing blind proxy re-signature schemes are designed based on the traditional public key cryptosystems, whose security relies on the hardness of big integer factoring, discrete logarithm, elliptic curve discrete logarithm, and so on. However, these problems will be unsecure when facing the attack of quantum computers. Motivated by these concerns, we proposed a blind proxy re-signature scheme based on the problem of isomorphisms of polynomials, which can resist quantum attack, and gave its security proof under the random oracle model. In the proposed scheme, the message can be kept blind by using the hash function, and the delegatee's identity can be kept anonymous by using the problem of isomorphisms of polynomials. Compared with the existing schemes, the new scheme has more secure properties, such as quantum resistance, high efficiency, message blindness, and delegatee anonymity. It is concluded that the proposed scheme has a good application prospect in the future quantum computing environment with low-power hardware.
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.
Most of the previous proxy re-encryption schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, they cannot guarantee its security under quantum analysis, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. In the paper, we propose the first proxy re-encryption scheme based on the hard worst-case lattice problems. Our scheme has many useful properties as follows: Unidirectional, collusion-resistant, noninteractive, proxy invisible, key optimal, and nontransitive. We also provided the formal security proof of the proposed scheme in the random oracle model.
The threshold proxy signcryption can implement signature and encryption simultaneously in one logical step, and can be used to realize the decentralized protection of the group signature key, so it is an efficient technology for network security. Currently, most of the existing threshold proxy signcryption schemes are designed based on the traditional public key cryptosystems, and their security mainly depends on the difficulty of the large integer decomposition and the discrete logarithm. However, the traditional public key cryptosystems cannot resist the quantum computer attack, which makes the existing threshold proxy signcryption schemes based on traditional public key cryptosystems insecure against quantum attacks. Motivated by these concerns, we proposed a threshold proxy signcryption scheme based on Multivariate Public Key Cryptosystem (MPKC) which is one of the quantum attack-resistent public key algorithms. Under the premise of satisfying the threshold signcryption requirements of the threshold proxy, our scheme can not only realize the flexible participation of the proxy signcrypters but also resist the quantum computing attack. Finally, based on the assumption of Multivariate Quadratic (MQ) problem and Isomorphism Polynomial (IP) problem, the proof of the confidentiality and the unforgeability of the proposed scheme under the random oracle model is given.
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.
In the 4th industrial revolution, the blockchain that distributes and manages data through a P2P network is used as a new decentralized networking paradigm in various fields such as manufacturing, culture, and public service. However, with the advent of quantum computers, quantum algorithms that are able to break existing cryptosystems such as hash function, symmetric key, and public key cryptography have been introduced. Currently, because most major blockchain systems use an elliptic curve cryptography to generate signatures for transactions, they are insecure against the quantum adversary. For this reason, the research on the quantum-resistant blockchain that utilizes lattice-based cryptography for transaction signatures is needed. Therefore, in this paper, we propose a blind signature scheme for the blockchain in which the contents of the signature can be verified later, as well as signing by hiding the contents to be signed using lattice-based cryptography with the property of quantum resistance. In addition, we prove the security of the proposed scheme using a random oracle model.