Authentication of Quantum Messages: Difference between revisions

Line 6: Line 6:
*[[Clifford Based Quantum Authentication Scheme]]: requires one side to be able to prepare and measure quantum states.
*[[Clifford Based Quantum Authentication Scheme]]: requires one side to be able to prepare and measure quantum states.
*[[Polynomial Based Quantum Authentication Scheme]]: requires one side to only prepare and send quantum states
*[[Polynomial Based Quantum Authentication Scheme]]: requires one side to only prepare and send quantum states
==Properties==


==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>
Write, autoreview, editor, reviewer
3,125

edits