Polynomial Code based Quantum Authentication: Difference between revisions
Jump to navigation
Jump to search
(Created page with "The [https://arxiv.org/pdf/quant-ph/0205128.pdf example protocol] provides a non-interactive scheme for the sender to encrypt as well as Authentication of Quantum Messages|a...") |
No edit summary |
||
| Line 1: | Line 1: | ||
The [https://arxiv.org/pdf/quant-ph/0205128.pdf example protocol] provides a non-interactive scheme for the sender to encrypt as well as [[Authentication of Quantum Messages|authenticate]] quantum messages. It was the first protocol designed to achieve the task of authentication for quantum states. | The [https://arxiv.org/pdf/quant-ph/0205128.pdf example protocol] provides a non-interactive scheme for the sender to encrypt as well as [[Authentication of Quantum Messages|authenticate]] quantum messages. It was the first protocol designed to achieve the task of authentication for quantum states, i.e. it gives the guarantee that the message sent by a party (sender) over a communication line is received by a party on the other end (receiver) as it is and, has not been tampered with or modified by the dishonest party (eavesdropper). | ||
==Assumptions== | ==Assumptions== | ||
*The sender and the receiver share a classical key drawn from a probability distribution. | *The sender and the receiver share a private (known to only the two of them), classical random key drawn from a probability distribution. | ||
==Outline== | ==Outline== | ||
==Notations== | ==Notations== | ||
*<math>s</math>: security parameter | |||
*<math>m</math>: number of qubits in the message. | |||
==Properties== | ==Properties== | ||
*For an <math>m</math> qubit message, the protocol requires <math>m+s</math> qubits encoded state, and a private key of <math>2m+O(s)</math>. | |||
==Pseudo Code== | ==Pseudo Code== | ||
==Further Information== | ==Further Information== | ||
==References== | ==References== | ||
<div style='text-align: right;'>''contributed by Shraddha Singh''</div> | <div style='text-align: right;'>''contributed by Shraddha Singh''</div> | ||
Revision as of 02:51, 18 June 2019
The example protocol provides a non-interactive scheme for the sender to encrypt as well as authenticate quantum messages. It was the first protocol designed to achieve the task of authentication for quantum states, i.e. it gives the guarantee that the message sent by a party (sender) over a communication line is received by a party on the other end (receiver) as it is and, has not been tampered with or modified by the dishonest party (eavesdropper).
Assumptions
- The sender and the receiver share a private (known to only the two of them), classical random key drawn from a probability distribution.
Outline
Notations
- : security parameter
- : number of qubits in the message.
Properties
- For an qubit message, the protocol requires qubits encoded state, and a private key of .
Pseudo Code
Further Information
References
contributed by Shraddha Singh