Quantum authentication

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

. Quantum authentication is the sub-field of quantum cryptography that aims to apply quantum information theory for the purpose of authentication of quantum messages, users or devices. Counterintuitively, it refers to a different problem from the authentication of the classical channel assumed in QKD protocols, which doesn't natively require quantum resources. A number of authentication protocols have been proposed since the advent of quantum cryptography, often inspired by quantum key distribution counterparts. Ongoing research aims to both design new schemes and experimentally implement already proposed ones, as the technologies needed are mostly still under development.

. Quantum authentication is the sub-field of quantum cryptography that aims to apply quantum information theory for the purpose of authentication of quantum messages, users or devices. Counterintuitively, it refers to a different problem from the authentication of the classical channel assumed in QKD protocols, which doesn't natively require quantum resources. A number of authentication protocols have been proposed since the advent of quantum cryptography, often inspired by quantum key distribution counterparts.

How it works

Ongoing research aims to both design new schemes and experimentally implement already proposed ones, as the technologies needed are mostly still under development. A QDS scheme consists of three probabilistic polynomial-time quantum Turing machines ( G , S , V ), where G is a key-generation algorithm that, on input 1^n , outputs a pair (s, v) consisting of a secret signing key and a public verification key.

S is a signing algorithm, V is a verification algorithm such that for all messages m \in \{0,1\}^n and all sufficiently large n , \Pr\left[V(m, S(m, s), v) = 1\right] \ge 1 - \frac{1}{\mathrm{poly}(n)} , where the probability is taken over the internal randomness (classical and quantum) of ( G , S , V ).

Text derived from https://en.wikipedia.org/w/index.php?oldid=1369620183 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001369620183 · captured 1786840647.0 · version history

Cite this page as: encyclopegia.org, “Quantum authentication”, snapshot enwiki-001369620183. https://encyclopegia.org/a/quantum-authentication

Sources cited in this revision

13 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.