Gottesman and Chuang Quantum Digital Signature: Difference between revisions

Gottesman and Chuang Quantum Digital Signature (edit)

183 bytes added , 28 May 2019

Write, autoreview, editor, reviewer

3,129

edits

@@ Line 22: / Line 22: @@
 *Only limited (T) distribution of public keys should be allowed, such that <math>T < L/n</math>, where quantum public key is an 'n' qubit state.
 * Unlike some classical information-theoretic (unconditional security) schemes which require secure anonymous broadcast channel or noisy channel, which are hard to achieve resources, the quantum scheme provides information-theoretic security by only demanding plausible quantum channels and modest interaction between parties involved.
-* The scheme is secure against forgery if <math>(1-\delta^2)(M-G)>c_2M</math>, where <math>\delta</math> depends on public keys and hence, on quantum one way functions; <math>G=2^{-(L-Tn)}2M</math>.
+* The scheme is secure against forgery if <math>(1-\delta^2)(M-G)>c_2M</math>, where <math>G=2^{-(L-Tn)}2M</math> and <math>\delta</math> depends on public keys and hence, on quantum one way functions.</br>
+<math>\delta\sim 0.9</math> for quantum fingerprint states and for the method where one classical bit is represented by one qubit, such that , <math>\delta=cos(\theta)</math>
 * The Sender can successfully repudiate by probability, <math>p_{cheat}\sim O(d^{-M})</math>, for some <math>d>1</math>.