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

Journal of the Optical Society of America B

Multi-party ring quantum digital signatures

Wenxiu Qu, Yong Zhang, Hongwei Liu, Tianqi Dou, Jipeng Wang, Zhenhua Li, Shunyu Yang, Haiqiang Ma

Published Apr 25, 2019• 15 citations
Publisher

Abstract

Quantum digital signatures (QDSs), which are unforgeable, non-repudiable, and transferable, are widely used in quantum communication networks. Unfortunately, previous protocols have often relied on three-party models for security analysis and experimental verification. As the number of parties increases, the number of quantum links required increases exponentially, undoubtedly leading to high channel losses and cost for multi-party QDSs. This study proposes a multi-party ring QDS scheme that can effectively deal with the issue of redundant quantum links. Furthermore, compared with the previously proposed QDS protocols, our protocol can prevent repudiation attacks without symmetry operation or swap test. Hence, it also can reduce the possibility of forging attacks by eliminating the possibility of forgery using illegal strings.

DOI
10.1364/josab.36.001335

Related papers

Secure and practical multiparty quantum digital signatures

Chen-Xun Weng, Yu-Shuo Lu, Rui-Qi Gao +6 more

Quantum digital signatures (QDSs) promise information-theoretic security against repudiation and forgery of messages. Compared with currently existing three-party QDS protocols, multiparty protocols have unique advantages in the practical case of more than two receivers when sending a mass message. However, complex security analysis, numerous quantum channels and low data utilization efficiency make it intractable to expand three-party to multiparty scenario. Here, based on six-state non-orthogonal encoding protocol, we propose an effective multiparty QDS framework to overcome these difficulties. The number of quantum channels in our protocol only linearly depends on the number of users. The post-matching method is introduced to enhance data utilization efficiency and make it linearly scale with the probability of detection events even for five-party scenario. Our work compensates for the absence of practical multiparty protocols, which paves the way for future QDS networks.

arXiv:2104.12059•Optics Express•Jul 28, 2021•28 citations

Quantum Digital Signatures without Quantum Memory

Vedran Dunjko, Petros Wallden, Erika Andersson

Quantum digital signatures (QDSs) allow the sending of messages from one sender to multiple recipients, with the guarantee that messages cannot be forged or tampered with. Additionally, messages cannot be repudiated--if one recipient accepts a message, she is guaranteed that others will accept the same message as well. While messaging with these types of security guarantees are routinely performed in the modern digital world, current technologies only offer security under computational assumptions. QDSs, on the other hand, offer security guaranteed by quantum mechanics. All thus far proposed variants of QDSs require long-term, high quality quantum memory, making them unfeasible in the foreseeable future. Here, we present a QDS scheme where no quantum memory is required, which also needs just linear optics. This makes QDSs feasible with current technology.

arXiv:1309.1375•Physical Review Letters•Jan 31, 2014•169 citations

Multi-Partied Quantum Digital Signature Scheme Without Assumptions On Quantum Channel Security

Mustafa Şahin, İhsan Yılmaz

In this study, we generalized quantum digital signature scheme for three-partied[5] to the multi-partied. Also we analyzed this scheme for repudiation, forgery and colluding adversaries.

Journal of Physics Conference Series•Oct 1, 2016•3 citations

Simulated environment for multiparty quantum digital signature across the network

Daniel Gómez Aguado, Marta Irene García Cid, Laura Ortiz Martín +1 more

With the quantum computational paradigm rapidly developing across the world, new vulnerabilities on currently deployed cryptography protocols are to be taken in consideration. A possible answer to said vulnerabilities is using quantum technologies on cryptography. For a quantum-assisted cryptography protocol, key pairs can be generated via quantum state measurements. This protocol is known as quantum key distribution, of extended use for providing security against any algorithm-based attack to the keys. Ensured the key protection against eavesdroppers, a QKD-assisted protocol can focus its security analysis on party behaviour. Depending on the protocol rules and steps to follow, users can attempt attacks on it with the purpose of causing disagreement or misunderstanding between parties. In this work, we present a simulation environment for a hybrid, quantum-assisted digital signature (QDS) protocol. The configurations available for the simulated network as well as the digital signature protocol make it possible to design specific communication scenarios, such as attacks on the message integrity, forging and repudiation attempts or noisy communication across the quantum channels.

International Conference on Availability, Reliability and Security (ARES)•Aug 9, 2023•0 citations

Composable Device-Independent Quantum Digital Signatures

Jing-Wei Bian, Bing-Hong Li, Xu-Yang Lu +3 more

Extending device-independent (DI) quantum cryptography to composably support all fundamental information security objectives is crucial for secure quantum networks. Achieving this goal requires composable quantum digital signatures (QDSs), which support integrity, authenticity, and nonrepudiation when integrated into quantum networks. Yet existing QDS protocols generally rely on assumptions about the underlying quantum devices, while their security analyses remain largely restricted to stand-alone settings, leaving related-key attacks on the underlying linear feedback shift register (LFSR)-based Toeplitz authentication unaddressed. Here, we establish the first composable security framework for QDS within constructive cryptography, and realize the corresponding ideal QDS resource by developing a DI-QDS protocol employing one-time universal hashing and multi-channel multiplexing. We further derive a related-key security bound for the underlying LFSR-based Toeplitz authentication, thereby establishing unforgeability while extending the forgery boundary considered in previous QDS security analyses. We also demonstrate the practical feasibility of our DI-QDS protocol under realistic quantum network conditions in the finite-size regime, with numerical simulations showing that it enables efficient signing of multibit documents over metropolitan-scale distances. Our results establish QDS as a composable cryptographic primitive and extend DI quantum cryptography to support the full range of information security objectives with composable security guarantees in future quantum networks.

quant-pharXiv:2610.39360•Oct 30, 2026•0 citations

Multiparty quantum signature schemes

Juan Miguel Arrazola, Petros Wallden, Erika Andersson

Digital signatures are widely used in electronic communications to secure important tasks such as financial transactions, software updates, and legal contracts. The signature schemes that are in use today are based on public-key cryptography and derive their security from computational assumptions. However, it is possible to construct unconditionally secure signature protocols. In particular, using quantum communication, it is possible to construct signature schemes with security based on fundamental principles of quantum mechanics. Several quantum signature protocols have been proposed, but none of them has been explicitly generalised to more than three participants, and their security goals have not been formally defined. Here, we first extend the security definitions of Swanson and Stinson [1] so that they can apply also to the quantum case, and introduce a formal definition of transferability based on different verification levels. We then prove several properties that multiparty signature protocols with informationtheoretic security – quantum or classical – must satisfy in order to achieve their security goals. We also express two existing quantum signature protocols with three parties in the security framework we have introduced. Finally, we generalize a quantum signature protocol given in [2] to the multiparty case, proving its security against forging, repudiation and non-transferability. Notably, this protocol can be implemented using any pointto-point quantum key distribution network and therefore is ready to be experimentally demonstrated.

arXiv:1505.07509•Quantum Information and Computation•Apr 1, 2016•24 citations
Quantum digital signatures (QDSs), which are unforgeable, non-repudiable, and transferable, are widely used in quantum communication networks. Unfortunately, previous protocols have often relied on three-party models for security analysis and experimental verification. As the number of parties increases, the number of quantum links required increases exponentially, undoubtedly leading to high channel losses and cost for multi-party QDSs. This study proposes a multi-party ring QDS scheme that can effectively deal with the issue of redundant quantum links. Furthermore, compared with the previously proposed QDS protocols, our protocol can prevent repudiation attacks without symmetry operation or swap test. Hence, it also can reduce the possibility of forging attacks by eliminating the possibility of forgery using illegal strings.
Quantum digital signatures (QDSs) promise information-theoretic security against repudiation and forgery of messages. Compared with currently existing three-party QDS protocols, multiparty protocols have unique advantages in the practical case of more than two receivers when sending a mass message. However, complex security analysis, numerous quantum channels and low data utilization efficiency make it intractable to expand three-party to multiparty scenario. Here, based on six-state non-orthogonal encoding protocol, we propose an effective multiparty QDS framework to overcome these difficulties. The number of quantum channels in our protocol only linearly depends on the number of users. The post-matching method is introduced to enhance data utilization efficiency and make it linearly scale with the probability of detection events even for five-party scenario. Our work compensates for the absence of practical multiparty protocols, which paves the way for future QDS networks.
Quantum digital signatures (QDSs) allow the sending of messages from one sender to multiple recipients, with the guarantee that messages cannot be forged or tampered with. Additionally, messages cannot be repudiated--if one recipient accepts a message, she is guaranteed that others will accept the same message as well. While messaging with these types of security guarantees are routinely performed in the modern digital world, current technologies only offer security under computational assumptions. QDSs, on the other hand, offer security guaranteed by quantum mechanics. All thus far proposed variants of QDSs require long-term, high quality quantum memory, making them unfeasible in the foreseeable future. Here, we present a QDS scheme where no quantum memory is required, which also needs just linear optics. This makes QDSs feasible with current technology.
With the quantum computational paradigm rapidly developing across the world, new vulnerabilities on currently deployed cryptography protocols are to be taken in consideration. A possible answer to said vulnerabilities is using quantum technologies on cryptography. For a quantum-assisted cryptography protocol, key pairs can be generated via quantum state measurements. This protocol is known as quantum key distribution, of extended use for providing security against any algorithm-based attack to the keys. Ensured the key protection against eavesdroppers, a QKD-assisted protocol can focus its security analysis on party behaviour. Depending on the protocol rules and steps to follow, users can attempt attacks on it with the purpose of causing disagreement or misunderstanding between parties. In this work, we present a simulation environment for a hybrid, quantum-assisted digital signature (QDS) protocol. The configurations available for the simulated network as well as the digital signature protocol make it possible to design specific communication scenarios, such as attacks on the message integrity, forging and repudiation attempts or noisy communication across the quantum channels.
Extending device-independent (DI) quantum cryptography to composably support all fundamental information security objectives is crucial for secure quantum networks. Achieving this goal requires composable quantum digital signatures (QDSs), which support integrity, authenticity, and nonrepudiation when integrated into quantum networks. Yet existing QDS protocols generally rely on assumptions about the underlying quantum devices, while their security analyses remain largely restricted to stand-alone settings, leaving related-key attacks on the underlying linear feedback shift register (LFSR)-based Toeplitz authentication unaddressed. Here, we establish the first composable security framework for QDS within constructive cryptography, and realize the corresponding ideal QDS resource by developing a DI-QDS protocol employing one-time universal hashing and multi-channel multiplexing. We further derive a related-key security bound for the underlying LFSR-based Toeplitz authentication, thereby establishing unforgeability while extending the forgery boundary considered in previous QDS security analyses. We also demonstrate the practical feasibility of our DI-QDS protocol under realistic quantum network conditions in the finite-size regime, with numerical simulations showing that it enables efficient signing of multibit documents over metropolitan-scale distances. Our results establish QDS as a composable cryptographic primitive and extend DI quantum cryptography to support the full range of information security objectives with composable security guarantees in future quantum networks.
Digital signatures are widely used in electronic communications to secure important tasks such as financial transactions, software updates, and legal contracts. The signature schemes that are in use today are based on public-key cryptography and derive their security from computational assumptions. However, it is possible to construct unconditionally secure signature protocols. In particular, using quantum communication, it is possible to construct signature schemes with security based on fundamental principles of quantum mechanics. Several quantum signature protocols have been proposed, but none of them has been explicitly generalised to more than three participants, and their security goals have not been formally defined. Here, we first extend the security definitions of Swanson and Stinson [1] so that they can apply also to the quantum case, and introduce a formal definition of transferability based on different verification levels. We then prove several properties that multiparty signature protocols with informationtheoretic security – quantum or classical – must satisfy in order to achieve their security goals. We also express two existing quantum signature protocols with three parties in the security framework we have introduced. Finally, we generalize a quantum signature protocol given in [2] to the multiparty case, proving its security against forging, repudiation and non-transferability. Notably, this protocol can be implemented using any pointto-point quantum key distribution network and therefore is ready to be experimentally demonstrated.