Write, autoreview, editor, reviewer
3,125
edits
Polynomial Code based Quantum Authentication: Difference between revisions
Jump to navigation
Jump to search
Polynomial Code based Quantum Authentication (edit)
Revision as of 17:02, 24 June 2019
, 24 June 2019→Outline
No edit summary |
|||
| Line 6: | Line 6: | ||
*The sender and the receiver share a private (known to only the two of them), classical random 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== | ||
# Preprocessing: A and B agree on some stabilizer purity testing code (<math>Q_k</math>) and some private and random | |||
binary strings <math>k</math>, <math>x</math>, and <math>y</math>. | |||
# A q-encrypts ρ as τ using key x. A encodes τ according to Qk for the code Qk with syndrome y to produce | |||
σ. A sends the result to B. | |||
#B receives the n qubits. Denote the received state by σ B measures the syndrome y′ of the code Qk on his qubits. B compares y to y′, and aborts if any error is detected. B decodes his n-qubit word according to | |||
Qk, obtaining τ′. B q-decrypts τ′ using x and obtains ρ′. | |||
'''Purity Testing Code:''' | |||
==Notations== | ==Notations== | ||
*<math>s</math>: security parameter | *<math>s</math>: security parameter | ||