Write, autoreview, editor, reviewer
3,129
edits
Authentication of Quantum Messages: Difference between revisions
→Properties
No edit summary |
|||
| Line 16: | Line 16: | ||
*For non-interactive protocols, a QAS is secure with error <math>\epsilon</math> for a state <math>|\psi\rangle</math> if it satisfies: | *For non-interactive protocols, a QAS is secure with error <math>\epsilon</math> for a state <math>|\psi\rangle</math> if it satisfies: | ||
#Completeness: For all keys <math>k\epsilon K: A_k(S_k(|\psi\rangle \langle\psi|)=|\psi\rangle \langle\psi| \otimes |ACC\rangle \langle ACC|</math> | #Completeness: For all keys <math>k\epsilon K: A_k(S_k(|\psi\rangle \langle\psi|)=|\psi\rangle \langle\psi| \otimes |ACC\rangle \langle ACC|</math> | ||
==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> | ||