A Feasible Hybrid Quantum-Assisted Digital Signature for Arbitrary
Message Length
- URL: http://arxiv.org/abs/2303.00767v1
- Date: Wed, 1 Mar 2023 19:00:02 GMT
- Title: A Feasible Hybrid Quantum-Assisted Digital Signature for Arbitrary
Message Length
- Authors: Marta Irene Garc\'ia Cid, Laura Ortiz Mart\'in, David Domingo
Mart\'in, Rodrigo Mart\'in S\'anchez-Ledesma, Juan Pedro Brito M\'endez,
Vicente Mart\'in Ayuso
- Abstract summary: We propose a new quantum-assisted digital signature protocol based on symmetric keys generated by QKD.
The protocol is described for a three-user scenario composed of one sender and two receivers.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Currently used digital signatures based on asymmetric cryptography will be
vulnerable to quantum computers running Shor's algorithm. In this work, we
propose a new quantum-assisted digital signature protocol based on symmetric
keys generated by QKD, that allows signing and verifying messages in a simple
way implementing an integration of currently available classical and quantum
technologies. The protocol is described for a three-user scenario composed of
one sender and two receivers. In contrast to previous schemes, it is
independent of the message length. The security of the protocol has been
analyzed, as well as its integrity, authenticity and non-repudiation
properties.
Related papers
- Efficient Arbitrated Quantum Digital Signature with Multi-Receiver Verification [3.6788660756664773]
Quantum digital signature is used to authenticate the identity of the signer with theoretical security.
In traditional multi-receiver quantum digital signature schemes without an arbitrater, the transferability of one-to-one signature is always required to achieve unforgeability.
We propose an arbitrated quantum digital signature scheme, in which the signature can be verified by multiple receivers simultaneously.
arXiv Detail & Related papers (2024-06-12T02:46:54Z) - Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC)
We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
arXiv Detail & Related papers (2024-02-13T12:12:39Z) - Revocable Quantum Digital Signatures [57.25067425963082]
We define and construct digital signatures with revocable signing keys from the LWE assumption.
In this primitive, the signing key is a quantum state which enables a user to sign many messages.
Once the key is successfully revoked, we require that the initial recipient of the key loses the ability to sign.
arXiv Detail & Related papers (2023-12-21T04:10:07Z) - Protocols for counterfactual and twin-field quantum digital signature [0.0]
Quantum digital signature (QDS) is the quantum version of its classical counterpart.
We propose a QDS scheme based on quantum counterfactuality.
We show how this two-way protocol can be turned into an equivalent non-counterfactual, one-way protocol.
arXiv Detail & Related papers (2023-10-17T14:33:51Z) - Practical quantum secure direct communication with squeezed states [55.41644538483948]
We report the first table-top experimental demonstration of a CV-QSDC system and assess its security.
This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
arXiv Detail & Related papers (2023-06-25T19:23:42Z) - Reliable Quantum Communications based on Asymmetry in Distillation and Coding [35.693513369212646]
We address the problem of reliable provision of entangled qubits in quantum computing schemes.
We combine indirect transmission based on teleportation and distillation; (2) direct transmission, based on quantum error correction (QEC)
Our results show that ad-hoc asymmetric codes give, compared to conventional QEC, a performance boost and codeword size reduction both in a single link and in a quantum network scenario.
arXiv Detail & Related papers (2023-05-01T17:13:23Z) - One-Time Universal Hashing Quantum Digital Signatures without Perfect
Keys [24.240914319917053]
We show that imperfect quantum keys with limited information leakage can be used for digital signatures and authentication without compromising security.
This study significantly reduces the delay for data postprocessing and is compatible with any quantum key generation protocols.
arXiv Detail & Related papers (2023-01-03T14:54:27Z) - Succinct Classical Verification of Quantum Computation [30.91621630752802]
We construct a classically succinct interactive argument for quantum computation (BQP)
Our protocol is secure assuming the post-quantum security of indistinguishability obfuscation (iO) and Learning Errors (LWE)
arXiv Detail & Related papers (2022-06-29T22:19:12Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - Efficient Quantum Digital Signatures without Symmetrization Step [7.848038078036641]
Quantum digital signatures (QDS) exploit quantum laws to guarantee non-repudiation, unforgeability and transferability of messages.
Current QDS protocols face two major restrictions, including the requirement of the symmetrization step.
We present an efficient QDS protocol to overcome these issues by utilizing the classical post-processing operation called post-matching method.
arXiv Detail & Related papers (2021-04-08T01:54:50Z) - Twin-field quantum digital signatures [4.503555294002338]
Digital signature is a key technique in information security, especially for identity authentications.
Quantum digital signatures (QDSs) provide a considerably higher level of security, i.e., information-theoretic security.
arXiv Detail & Related papers (2020-03-25T08:04:59Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.