Prepare and Measure Quantum Digital Signature: Difference between revisions

Jump to navigation Jump to search
Line 26: Line 26:
*<math>s_v: (s_a < s_v)</math> verification threshold per qubit.
*<math>s_v: (s_a < s_v)</math> verification threshold per qubit.


== Example: https://arxiv.org/abs/1403.5551 ==  
 
===Properties===
----
*L, <math>s_v, s_a</math>, authenticated quantum channels between all seller-receiver pairs, authenticated classical channels between all parties.
*This protocol requires no quantum memory.
*The protocol assumes maximum number of participating parties are honest. In the present case at least two parties are honest.
*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 <math>P(rep)\le e^{-(s_v-s_a)^2L}</math>.
*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, <math>P(forge)\le e^{-(c_{min}-2s_v)^2L}</math>, where <math>c_{min}</math> is the minimum possible rate at which buyer declares a single signature element which has been eliminated by the verifier.
 
===Pseudo Code===
----
*Notations
*Notations
**<math>|\psi^k\rangle</math>: Quantum Public key for message k
**<math>|\psi^k\rangle</math>: Quantum Public key for message k
Line 36: Line 46:
**<math>v^k_l</math>: Verifier’s random bit to determine the measurement basis of <math>l^{th}</math> qubit in <math>|\psi^k\rangle</math>
**<math>v^k_l</math>: Verifier’s random bit to determine the measurement basis of <math>l^{th}</math> qubit in <math>|\psi^k\rangle</math>
**<math>m_{b^k_l}</math>: measurement outcome of <math>b^k_l</math>
**<math>m_{b^k_l}</math>: measurement outcome of <math>b^k_l</math>
===Specific Requirements===
----
L, <math>s_v, s_a</math>, authenticated quantum channels between all seller-receiver pairs, authenticated classical channels between all parties.
===Properties===
----
*This protocol requires no quantum memory.
*The protocol assumes maximum number of participating parties are honest. In the present case at least two parties are honest.
*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 <math>P(rep)\le e^{-(s_v-s_a)^2L}</math>.
*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, <math>P(forge)\le e^{-(c_{min}-2s_v)^2L}</math>, where <math>c_{min}</math> is the minimum possible rate at which buyer declares a single signature element which has been eliminated by the verifier.


===Pseudo Code===
----
<u>'''Stage 1'''</u> Distribution
<u>'''Stage 1'''</u> Distribution
*'''Input''' L
*'''Input''' L
Write, autoreview, editor, reviewer
3,129

edits

Navigation menu