Polynomial Code based Quantum Authentication: Difference between revisions
Jump to navigation
Jump to search
| Line 12: | Line 12: | ||
==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>. | *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>. | ||
== | ==Protocol Description== | ||
==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 11:08, 12 July 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 (suppliant) over a communication line is received by a party on the other end (authenticator) as it is and, has not been tampered with or modified by the dishonest party (eavesdropper).
Tags: Two Party Protocol, Quantum Functionality, Specific Task, Building Block
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
- Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle m} : number of qubits in the message.
Properties
- For an qubit message, the protocol requires qubits encoded state, and a private key of .
Protocol Description
Further Information
References
contributed by Shraddha Singh