Beruflich Dokumente
Kultur Dokumente
Based On Paper
2
Outline
3
Classical Cryptography
Limitations
Quantum Cryptography Technique Device Independent Cryptography
Distrustful Cryptography
Fully Distrustful Cryptography Conclusion
decrypt message
LIMITATIONS
They are based on assumed (but not proven) difficulty of
some mathematical problems. Development of Quantum Computers may also threaten the technique
Quantum Cryptography
6
eavesdropping Based on proven properties of microscopic objects like photons Not threatened by Quantum Computing because not mathematical
Photon Polarization
7
polarizer, we get one of the two measurements with equal probability, and all previous polarizations are lost Hence measurement of correct polarization cannot be made without loss
Photon Polarization
8
Photon 1
Photon 2
+ + o o
L R
V V
Assumptions: Alice is the sender, Bob is the receiver, and Trudy is the intruder
is guaranteed without making any assumption on underlying apparatus. The protocol works even when apparatus is designed by an enemy.
Distrustful Protocol: A protocol in which two parties do
not trust each other. Anyone may try to cheat, so to ensure reliability, other party must be able to detect cheating
bit. Reveal Phase: Alice reveals value of the bit. Both then carry out some tests to ensure other has not cheated Each of them has a non zero probability of cheating the other
Boxes Each box has binary input s {0, 1} and binary output r {0, 1} The output r solely depends on input s So, we no assumption is made about box, and hence device independence
A protocol which is both Distrustful and Device Independent Based on Greenberger-Horne-Zeilinger (GHZ) paradox Consider three boxes A, B and C with inputs sA, sB and sC and
outputs rA, rB and rC If inputs satisfy condition: sA sB sC = 1 Then we can always have outputs satisfy: rA rB rC = sAsB sC 1
Alice has box A and Bob has boxes B and C. They satisfy GHZ
Paradox Commit Phase: Alice inputs bit she wishes to commit into box A Now, a bit a is selected randomly.
If a = 0, Alice sends c = rA as commitment If a = 1, Alice sends c = sA rA as commitment
sB s C = 1 sA He now checks if GHZ Paradox is satisfied If any of the above tests fails, Bob aborts, assuming Alice has cheated
Conclusion
17
used for communication between parties that do not trust each other, and neither their apparatus.
Thank You!!!
18