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

International Conference on Intelligent Networking and Collaborative Systems (INCoS)

Lattice-Based Multi-party Concurrent Signatures Scheme

Shangping Wang, Lihua Liu, Juanjuan Chen, Jin Dong Sun, Xinwen Zhang, Yaling Zhang

Published Sep 1, 2013• 4 citations
Publisher

Abstract

Concurrent Signatures scheme is an effective way to solve the problem of fair exchange without the help of any trusted third party, it has the advantage of efficiency. Until now, all concurrent signatures are based on traditional cryptosystems, but the emergence of quantum computing poses a severe threat to the security of classic public-key cryptosystems. More and more attentions are being paid to lattice-based cryptosystems, which is one of the candidate cryptosystems against the attacks from quantum computing. In this paper we present a new formal model of multi-party concurrent signatures scheme which is constructed based on constant-size ring signatures, and a lattice-based multi-party concurrent signatures scheme. The scheme has comparative advantages in both efficiency and security over the existing concurrent signatures schemes based on traditional cryptosystems. In particular, our scheme is constructed based on constant-size ring signatures, and thus we have solved the open problem: how to construct a multi-party concurrent signatures scheme based on constant-size ring signatures, which was proposed by Dongvu Tonien, Willy Susilo and Reihaneh Safavi-Naini in 2006.

DOI
10.1109/incos.2013.105

Related papers

Multi-party concurrent signatures scheme from lattice

Shangping Wang, Lihua Liu, Jin Dong Sun +1 more

Concurrent signatures scheme is an effective way to solve the problem of fair exchange without the help of any trusted third party. Until now, all concurrent signatures are based on traditional cryptosystems, but the emergence of quantum computing poses a severe threat to the security of classic public–key cryptosystems. More and more attentions are being paid to lattice–based cryptosystems, which is one of the candidate cryptosystems against the attacks from quantum computing. In this paper, we present a new formal model of multi–party concurrent signatures scheme and a lattice–based multi–party concurrent signatures scheme. The scheme has comparative advantages in both efficiency and security over the existing concurrent signatures schemes based on traditional cryptosystem. In particular, our scheme is constructed based on constant–size ring signatures, and thus we have solved the open problem: how to construct a multi–party concurrent signatures scheme based on constant–size ring signatures, which was proposed by Tonien et al. (2006).

International Journal of Information and Communication Technology•Jan 1, 2015•1 citation

On the Security of a Lattice-Based Multi-party Concurrent Signature Scheme

Xianping Mao, Kefei Chen, Liangliang Wang +1 more

Fair exchange is essential in E-commerce, and concurrent signature realizes the fair exchange of digital signatures with removing the requirement of a trusted third party. Multi-party concurrent signature is an extension to the multi-user scenario. The security of existing multi-party concurrent signatures is mostly based on traditional hard problems that could be solved efficiently with quantum algorithms in a post-quantum world. Meanwhile, the lattice-based cryptography is considered to be resistant to quantum attack. Wang et al. proposed a lattice-based multi-party concurrent signature. We give the analysis of their proposed signature scheme and find that it is not secure since an inside adversary can forge the signature. Moreover, the initial signer can produce any signatures, instead of a signature on the original messages, if he is malicious.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)•Sep 1, 2014•2 citations

Quantum-Resistant Lattice-Based Proxy Signature

Jinxuan Luo, Liming Zuo, Hao Liu

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.

Symmetry•Feb 9, 2025•2 citations

A Quantum Concurrent Signature Scheme Based on the Quantum Finite Automata Signature Scheme

Hongji Wang, Gang Yao, Beizhan Wang

When using digital signatures, we need to deal with the problem of fairness of information exchange. To solve this problem, Chen, etc. introduced a new conception which is named concurrent signatures in Eurocrypt'04. Using concurrent signatures scheme, two entities in the scheme can generate two ambiguous signatures until one of the entities releases additional information which is called keystone. After the keystone is released, the two ambiguous signatures will be bound to their real signers at the same time. In order to provide a method to solve the fairness problem of quantum digital signatures, we propose a new quantum concurrent signature scheme. The scheme we proposed does not use a trusted third party in a quantum computing environment, and has such advantages as no need to conduct complex quantum operations and easy to implement by a quantum circuit. Quantum concurrent signature improves the theory of quantum cryptography, and it also provides broad prospects for the specific applications of quantum cryptography.

IEEE International Conference on Anti-counterfeiting, Security, and Identification (ASID)•Oct 30, 2020•3 citations

Concurrent Signature Based on Verifiable Ring Signature

Jingwei Liu

In this paper,we first proposed a new concurrent signature based on a verifiable ring signature scheme and constructed a corresponding concurrent signature protocol.At last,we gave the analysis of the security of our scheme.The advantages of concurrent signature scheme is very sufficient to fairness as well as signer-ambiguity,unforgeriability and verifiability.It provides a new way to solve the problem of fair exchange of signatures.

Computer Engineering and Applications Journal•Jan 1, 2006•0 citations

Lattice-Based Certificateless Collaborative Signature Scheme for Post-Quantum Intelligent Computing and Network Systems

Yang Li

With the rapid development of quantum computing technology, traditional collaborative signature schemes based on RSA and elliptic curve cryptography face significant security challenges. This paper proposes a lattice-based certificateless collaborative signature scheme (L-CCS) to address the security and efficiency requirements of multi-party collaboration in intelligent computing and network systems. By leveraging lattice problems such as the Small Integer Solution and Learning With Errors, our scheme ensures post-quantum security. The L-CCS eliminates the need for a trusted Key Generation Center and a dedicated aggregator, enhancing decentralization and system robustness. Our construction achieves existential unforgeability under adaptive chosen-message attacks in the random oracle model. Furthermore, we provide a practical implementation optimized for large-scale data sharing, demonstrating sublinear scalability in signature size and computation time.

Journal of Intelligent Computing and Networking•Aug 12, 2025•0 citations
Concurrent Signatures scheme is an effective way to solve the problem of fair exchange without the help of any trusted third party, it has the advantage of efficiency. Until now, all concurrent signatures are based on traditional cryptosystems, but the emergence of quantum computing poses a severe threat to the security of classic public-key cryptosystems. More and more attentions are being paid to lattice-based cryptosystems, which is one of the candidate cryptosystems against the attacks from quantum computing. In this paper we present a new formal model of multi-party concurrent signatures scheme which is constructed based on constant-size ring signatures, and a lattice-based multi-party concurrent signatures scheme. The scheme has comparative advantages in both efficiency and security over the existing concurrent signatures schemes based on traditional cryptosystems. In particular, our scheme is constructed based on constant-size ring signatures, and thus we have solved the open problem: how to construct a multi-party concurrent signatures scheme based on constant-size ring signatures, which was proposed by Dongvu Tonien, Willy Susilo and Reihaneh Safavi-Naini in 2006.
Concurrent signatures scheme is an effective way to solve the problem of fair exchange without the help of any trusted third party. Until now, all concurrent signatures are based on traditional cryptosystems, but the emergence of quantum computing poses a severe threat to the security of classic public–key cryptosystems. More and more attentions are being paid to lattice–based cryptosystems, which is one of the candidate cryptosystems against the attacks from quantum computing. In this paper, we present a new formal model of multi–party concurrent signatures scheme and a lattice–based multi–party concurrent signatures scheme. The scheme has comparative advantages in both efficiency and security over the existing concurrent signatures schemes based on traditional cryptosystem. In particular, our scheme is constructed based on constant–size ring signatures, and thus we have solved the open problem: how to construct a multi–party concurrent signatures scheme based on constant–size ring signatures, which was proposed by Tonien et al. (2006).
Fair exchange is essential in E-commerce, and concurrent signature realizes the fair exchange of digital signatures with removing the requirement of a trusted third party. Multi-party concurrent signature is an extension to the multi-user scenario. The security of existing multi-party concurrent signatures is mostly based on traditional hard problems that could be solved efficiently with quantum algorithms in a post-quantum world. Meanwhile, the lattice-based cryptography is considered to be resistant to quantum attack. Wang et al. proposed a lattice-based multi-party concurrent signature. We give the analysis of their proposed signature scheme and find that it is not secure since an inside adversary can forge the signature. Moreover, the initial signer can produce any signatures, instead of a signature on the original messages, if he is malicious.
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.
When using digital signatures, we need to deal with the problem of fairness of information exchange. To solve this problem, Chen, etc. introduced a new conception which is named concurrent signatures in Eurocrypt'04. Using concurrent signatures scheme, two entities in the scheme can generate two ambiguous signatures until one of the entities releases additional information which is called keystone. After the keystone is released, the two ambiguous signatures will be bound to their real signers at the same time. In order to provide a method to solve the fairness problem of quantum digital signatures, we propose a new quantum concurrent signature scheme. The scheme we proposed does not use a trusted third party in a quantum computing environment, and has such advantages as no need to conduct complex quantum operations and easy to implement by a quantum circuit. Quantum concurrent signature improves the theory of quantum cryptography, and it also provides broad prospects for the specific applications of quantum cryptography.
With the rapid development of quantum computing technology, traditional collaborative signature schemes based on RSA and elliptic curve cryptography face significant security challenges. This paper proposes a lattice-based certificateless collaborative signature scheme (L-CCS) to address the security and efficiency requirements of multi-party collaboration in intelligent computing and network systems. By leveraging lattice problems such as the Small Integer Solution and Learning With Errors, our scheme ensures post-quantum security. The L-CCS eliminates the need for a trusted Key Generation Center and a dedicated aggregator, enhancing decentralization and system robustness. Our construction achieves existential unforgeability under adaptive chosen-message attacks in the random oracle model. Furthermore, we provide a practical implementation optimized for large-scale data sharing, demonstrating sublinear scalability in signature size and computation time.