Write, autoreview, editor, reviewer
3,129
edits
Gottesman and Chuang Quantum Digital Signature: Difference between revisions
Jump to navigation
Jump to search
Gottesman and Chuang Quantum Digital Signature (edit)
Revision as of 09:51, 28 May 2019
, 28 May 2019→Properties
| Line 17: | Line 17: | ||
A generalized scheme for more than three parties is given in the article. Also, for multi-bit messages, a scheme using error correcting codes has been suggested in brief. | A generalized scheme for more than three parties is given in the article. Also, for multi-bit messages, a scheme using error correcting codes has been suggested in brief. | ||
==Notations== | |||
==Properties== | ==Properties== | ||
*The public keys can be used only once. | *The public keys can be used only once. | ||
*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 | *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. | * 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 | * 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 Sender can successfully repudiate by probability, <math>p_{cheat}\sim O(d^{-M})</math>, for some <math>d>1</math>. | * The Sender can successfully repudiate by probability, <math>p_{cheat}\sim O(d^{-M})</math>, for some <math>d>1</math>. | ||