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

Information Processing Letters

Efficient multi-party concurrent signature from lattices

Xinyin Xiang, Hui Li, Mingyu Wang, Xingwen Zhao

Published Mar 5, 2016• 3 citations
Publisher
DOI
10.1016/j.ipl.2016.02.007

Related papers

Efficient Identity-Based Signature from Lattices

Miaomiao Tian, Liusheng Huang

IFIP advances in information and communication technology•Jan 1, 2014•30 citations

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

Improvement and Efficient Implementation of a Lattice-Based Signature Scheme

Rachid El Bansarkhani, Johannes A Buchmann

Lecture notes in computer science•Jan 1, 2014•60 citations

Lattice-Based Multi-party Concurrent Signatures Scheme

Shangping Wang, Lihua Liu, Juanjuan Chen +3 more

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.

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

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

Policy-based signature scheme from lattices

Shantian Cheng, Khoa Nguyen, Huaxiong Wang

Designs Codes and Cryptography•Aug 17, 2015•22 citations
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.
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).