Write, autoreview, editor, reviewer
3,129
edits
Authentication of Quantum Messages: Difference between revisions
→Properties
| Line 12: | Line 12: | ||
*Any scheme which authenticates quantum messages must also encrypt them. [[Authentication of Quantum Messages#References|(1)]] | *Any scheme which authenticates quantum messages must also encrypt them. [[Authentication of Quantum Messages#References|(1)]] | ||
*'''Definition 1:''' A quantum authentication scheme (QAS) is a pair of polynomial time quantum algorithms <math>\mathcal{S}</math> (suppliant) and <math>\mathcal{A}</math> (authenticator) together with a set of classical keys <math>K</math> such that: | *'''Definition 1:''' A quantum authentication scheme (QAS) is a pair of polynomial time quantum algorithms <math>\mathcal{S}</math> (suppliant) and <math>\mathcal{A}</math> (authenticator) together with a set of classical keys <math>K</math> such that: | ||
# <math>\mathcal{S}</math> takes as input an <math>m</math>-qubit message system <math>M</math> and a key <math>k\epsilon K</math> and outputs a transmitted system <math>T</math> of <math>m + t</math> qubits. | |||
==Further Information== | ==Further Information== | ||
#[https://arxiv.org/pdf/quant-ph/0205128.pdf Barnum et al (2002)] First protocol on authentication of quantum messages. It is also used later for verification of quantum computation in [[Interactive Proofs for Quantum Computation]]. Protocol file for this article is given as the [[Polynomial Code based Quantum Authentication]] | #[https://arxiv.org/pdf/quant-ph/0205128.pdf Barnum et al (2002)] First protocol on authentication of quantum messages. It is also used later for verification of quantum computation in [[Interactive Proofs for Quantum Computation]]. Protocol file for this article is given as the [[Polynomial Code based Quantum Authentication]] | ||
<div style='text-align: right;'>''contributed by Shraddha Singh''</div> | <div style='text-align: right;'>''contributed by Shraddha Singh''</div> | ||