Write, autoreview, editor, reviewer
3,129
edits
(→Properties: TeX nitpicking by Fred) |
|||
Line 96: | Line 96: | ||
# If <math>S_v < s_vL/2</math>, Verifier accepts m else he aborts | # If <math>S_v < s_vL/2</math>, Verifier accepts m else he aborts | ||
== Relevant Papers == | ==Other Relevant Papers == | ||
# [https://arxiv.org/abs/quant-ph/0105032 GC-QDS] Uses [[quantum one way function|quantum one way function]] f(); Private keys: classical input x, Public keys: quantum output f(x). '''Requires''' quantum memory, quantum one way function, authenticated quantum channels, threshold values for message authentication <math>(s_a)</math> and verification<math>(s_v)</math> such that <math>s_a<s_v</math>, [[SWAP Test|SWAP Test]] (universal quantum computer). The protocol can be implemented at the [[Third Network Stage: Quantum Memory|Third Network Stage (Quantum Memory)]] | # [https://arxiv.org/abs/quant-ph/0105032 GC-QDS] Uses [[quantum one way function|quantum one way function]] f(); Private keys: classical input x, Public keys: quantum output f(x). '''Requires''' quantum memory, quantum one way function, authenticated quantum channels, threshold values for message authentication <math>(s_a)</math> and verification<math>(s_v)</math> such that <math>s_a<s_v</math>, [[SWAP Test|SWAP Test]] (universal quantum computer). The protocol can be implemented at the [[Third Network Stage: Quantum Memory|Third Network Stage (Quantum Memory)]] |