Unconditionally secure quantum signatures
From MaRDI portal
Abstract: Signature schemes, proposed in 1976 by Diffie and Hellman, have become ubiquitous across modern communications. They allow for the exchange of messages from one sender to multiple recipients, with the guarantees that messages cannot be forged or tampered with and that messages also can be forwarded from one recipient to another without compromising their validity. Signatures are different from, but no less important than encryption, which ensures the privacy of a message. Commonly used signature protocols - signatures based on the Rivest-Adleman-Shamir (RSA) algorithm, the digital signature algorithm (DSA), and the elliptic curve digital signature algorithm (ECDSA) - are only computationally secure, similar to public key encryption methods. In fact, since these rely on the difficulty of finding discrete logarithms or factoring large primes, it is known that they will become completely insecure with the emergence of quantum computers. We may therefore see a shift towards signature protocols that will remain secure even in a post-quantum world. Ideally, such schemes would provide unconditional or information-theoretic security. In this paper, we aim to provide an accessible and comprehensive review of existing unconditionally secure signature schemes for signing classical messages, with a focus on unconditionally secure quantum signature schemes.
Cites work
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- scientific article; zbMATH DE number 3497764 (Why is no real title available?)
- Arbitrated quantum signature scheme with message recovery
- Communication Theory of Secrecy Systems*
- Comparison of two unknown pure quantum states
- New directions in cryptography
- New hash functions and their use in authentication and set equality
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Post-quantum cryptography: lattice signatures
- Quantum cryptography
- Statistical zero knowledge and quantum one-way functions
- The Byzantine Generals Problem
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Understanding Cryptography
Cited in
(11)- A novel quantum broadcasting multiple blind signature scheme based on multi-particle partial entanglement
- Arbitrated quantum signature scheme with quantum walk-based teleportation
- Efficient branching programs for quantum hash functions generated by small-biased sets
- Universal quantum encryption for quantum signature using the swap test
- A QDS scheme based on superdense teleportation
- Quantum digital signature based on measurement-device-independent continuous-variable scheme
- Multiparty quantum English auction scheme using single photons as message carrier
- Theoretically extensible quantum digital signature with starlike cluster states
- Multiparty sealed-bid auction protocol based on the correlation of four-particle entangled state
- On quantum \((\delta,\varepsilon)\)-resistant hashing
- A new quantum multi-party signature protocol based on SNOP states without arbitrator
This page was built for publication: Unconditionally secure quantum signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296340)
