Quantum Digital Signature: Difference between revisions

no edit summary
No edit summary
Line 28: Line 28:
*'''Unforgeability''' ensures that a dishonest recipient (buyer) can neither alter a DS nor sign a message with a fake DS (DS that has not come from a genuine sender) and forward it to other recipients (verifier) successfully.  
*'''Unforgeability''' ensures that a dishonest recipient (buyer) can neither alter a DS nor sign a message with a fake DS (DS that has not come from a genuine sender) and forward it to other recipients (verifier) successfully.  
*'''Non-Repudiation''' implies that at any point a dishonest sender (seller) cannot deny having signed the message sent to a genuine recipient (Buyer).
*'''Non-Repudiation''' implies that at any point a dishonest sender (seller) cannot deny having signed the message sent to a genuine recipient (Buyer).
==Further Information==
Quantum Digital Signatures provide unconditional security, not relying on any computational assumption which is its basic advantage over the classical schemes. However, over time classical unconditionally secure digital signature schemes have been realized. These classical protocols take some assumptions like trusted omnipotent (one who distributes everyone signatures) thus giving one party extra power, or authenticated message broadcast. QDS does not require any such assumption. Yet, the low key rate could render QDS impractical over classical digital signature schemes. At the same time, there exist post quantum secure Digital signature schemes based on hash-key cryptography which cannot be broken by quantum computers.  Still, if someone requires a lifetime security without the above mentioned assumptions, QDS is the answer. Areas to improve QDS could be addressing the key rate and scalability of key length with length of message.


===Review Papers===
===Review Papers===
#[https://www.semanticscholar.org/paper/Unconditionally-Secure-Quantum-Signatures-Amiri-Andersson/2c9a298c9e902c5162496cc13f5d560427873412 AA (2015)] Discusses various classical and quantum digital signature schemes
#[https://www.semanticscholar.org/paper/Unconditionally-Secure-Quantum-Signatures-Amiri-Andersson/2c9a298c9e902c5162496cc13f5d560427873412 AA (2015)] Discusses various classical and quantum digital signature schemes
#Wallden P. (2018) (In preparation): Discusses the development of Quantum Digital Signatures from the first protocol by Gottesman and Chuang, elaborating advancements in further protocols to turn it into a practical QDS scheme.
#Wallden P. (2018) (In preparation): Discusses the development of Quantum Digital Signatures from the first protocol by Gottesman and Chuang, elaborating advancements in further protocols to turn it into a practical QDS scheme.
==Further Information==
Quantum Digital Signatures provide unconditional security, not relying on any computational assumption which is its basic advantage over the classical schemes. However, over time classical unconditionally secure digital signature schemes have been realized. These classical protocols take some assumptions like trusted omnipotent (one who distributes everyone signatures) thus giving one party extra power, or authenticated message broadcast. QDS does not require any such assumption. Yet, the low key rate could render QDS impractical over classical digital signature schemes. At the same time, there exist post quantum secure Digital signature schemes based on hash-key cryptography which cannot be broken by quantum computers.  Still, if someone requires a lifetime security without the above mentioned assumptions, QDS is the answer. Areas to improve QDS could be addressing the key rate and scalability of key length with length of message.




<div style='text-align: right;'>''*contributed by Shraddha Singh''</div>
<div style='text-align: right;'>''*contributed by Shraddha Singh''</div>
Write, autoreview, editor, reviewer
3,129

edits