Authentication of Quantum Messages: Difference between revisions
| Line 3: | Line 3: | ||
'''Tags:''' [[:Category:Multi Party Protocols|Multi Party Protocol]][[Category:Multi Party Protocols]], [[Quantum Digital Signature]], [[:Category:Quantum Functionality|Quantum Functionality]][[Category:Quantum Functionality]], [[:Category:Specific Task|Specific Task]][[Category:Specific Task]], [[:Category:Building Blocks|Building Block]][[Category:Building Blocks]] | '''Tags:''' [[:Category:Multi Party Protocols|Multi Party Protocol]][[Category:Multi Party Protocols]], [[Quantum Digital Signature]], [[:Category:Quantum Functionality|Quantum Functionality]][[Category:Quantum Functionality]], [[:Category:Specific Task|Specific Task]][[Category:Specific Task]], [[:Category:Building Blocks|Building Block]][[Category:Building Blocks]] | ||
==Protocols== | |||
*[[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 | |||
==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> | ||
Revision as of 02:35, 18 June 2019
Functionality
If a person sends some information over an insecure channel (a dishonest/malicious party has access to the channel), what is the guarantee that the receiver on the other end will receive the same information as sent and not something which is modified or replaced by the dishonest party? Authentication of quantum channels/quantum states/quantum messages provides this guarantee to the users of the channel. Note that, it is different from the functionality of digital signatures which comes with additional properties (non-repudiation, unforgeability and transferability). Also, authenticating quantum states is possible but signing quantum states is impossible, a result first stated in (1)
Tags: Multi Party Protocol, Quantum Digital Signature, Quantum Functionality, Specific Task, Building Block
Protocols
- 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
Further Information
- 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