Write, autoreview, editor, reviewer
3,129
edits
Prepare and Measure Quantum Digital Signature: Difference between revisions
Prepare and Measure Quantum Digital Signature (edit)
Revision as of 20:32, 10 October 2018
, 10 October 2018→Pseudo Code
| Line 29: | Line 29: | ||
*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 == | ||
*Input: L | *Input: L | ||
*Output: Seller: Private keys ; Buyer: Eliminated Signatures B0,B1; Verifier:Eliminated Signatures C0,C1 | *Output: Seller: Private keys ; Buyer: Eliminated Signatures B0,B1; Verifier:Eliminated Signatures C0,C1 | ||