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

Lecture notes in computer science

On Concurrent Multi-party Quantum Computation

Vipul Goyal, Xiao Rong Liang, Giulio Malavolta

Published Jan 1, 2023• 5 citations
Publisher
DOI
10.1007/978-3-031-38554-4_5

Related papers

Secure Multi-Party Quantum Computation Based on Blind Quantum Computation

Gui-Ju Qu, Ming‐Ming Wang

International Journal of Theoretical Physics•Jul 12, 2021•9 citations

Post-Quantum Multi-Party Computation

Amit Agarwal, James Bartusek, Vipul Goyal +2 more

Lecture notes in computer science•Jan 1, 2021•21 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

Application of Blind Quantum Computation to Two-Party Quantum Computation

Zhiyuan Sun, Qin Li, Fang Yu +1 more

International Journal of Theoretical Physics•Mar 13, 2018•8 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

Distributed Quantum Computations

Ming‐Xing Luo

Springer eBooks•Jan 1, 2024•0 citations
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).
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.