Write, autoreview, editor, reviewer
3,125
edits
Prepare and Measure Quantum Digital Signature: Difference between revisions
Prepare and Measure Quantum Digital Signature (edit)
Revision as of 21:31, 10 October 2018
, 10 October 2018→Properties
| Line 21: | Line 21: | ||
== Properties== | == Properties== | ||
*L : length of quantum public keys. | |||
* L : length of quantum public keys. | *<math>s_a:</math> authentication threshold per qubit. | ||
* | *<math>s_v: (sa < sv)</math> verification threshold per qubit. | ||
* | *The protocol assumes authenticated quantum channels between all seller-receiver pairs. | ||
*The protocol assumes authenticated classical channels between all parties. | |||
* The protocol provides security against repudiation, i.e. the probability that seller succeeds in making buyer and seller disagree on the validity of her sent quantum signature decays exponentially with L, as stated by the formula P(rep)≤ e−(sv−sa)2L. | *The protocol provides security against repudiation, i.e. the probability that seller succeeds in making buyer and seller disagree on the validity of her sent quantum signature decays exponentially with L, as stated by the formula P(rep)≤ e−(sv−sa)2L. | ||
* The protocol provides security against forgery, i.e. any recipient(verifier) with high probability rejects any message which was not originally sent by the seller herself. Forging probability is given by the formula, P(forge)≤ e−(cmin−2sv)2L, where cmin is the minimum possible rate at which buyer declares a single signature element which has been eliminated by the verifier. | *The protocol provides security against forgery, i.e. any recipient (verifier) with high probability rejects any message which was not originally sent by the seller herself. Forging probability is given by the formula, P(forge)≤ e−(cmin−2sv)2L, where cmin is the minimum possible rate at which buyer declares a single signature element which has been eliminated by the verifier. | ||
== Pseudo Code == | == Pseudo Code == | ||