Seminar On

Fully Distrustful Quantum Cryptography

PRESENTED TO: MRS. NIRMALA SHARMA, A S S I S TA N T P R O F E S S O R , C O M P U T E R E N G I N E E R I N G D E P T. U . C . E . , K O TA

P R E S E N T E D B Y: SHASHANK KUMAR JAIN (08/181) COMPUTER ENGINEERING U . C . E . , K O TA

Based On Paper
2

This presentation is based on paper titled

Fully Distrustful Quantum Cryptography

published by

J. Silman, A. Chailloux, N. Aharon, I. Kerenidis, S. Pironio, and S. Massar

on 27th January, 2011

Outline
3

Classical Cryptography

Limitations
Quantum Cryptography Technique Device Independent Cryptography

Distrustful Cryptography
Fully Distrustful Cryptography Conclusion

Classical Cryptography: Secret Key Method

4

Sender and receiver first securely share a secret key,

which is then used for encrypting subsequent messages

LIMITATIONS
Sharing secret key securely is difficult in first place. Publically known encrypting algorithm makes it easier to

decrypt message

Classical Cryptography: Public Key Method

5

Sender and receiver need not share secret key

Sender encrypts message with his Private Key

Receiver decrypts message with Senders Public Key

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

Enables secure exchange of secret keys, with detection of

eavesdropping Based on proven properties of microscopic objects like photons Not threatened by Quantum Computing because not mathematical

Photon Polarization
7

There can be three chosen bases of polarization:

1. Rectilinear (horizontal or vertical)

2. Circular (left-circular or right-circular) 3. Diagonal (45o or 135o)

Any two bases can be used for given protocol

When photon passed through any of three types of

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

Quantum Cryptography Procedure

9

Assumptions: Alice is the sender, Bob is the receiver, and Trudy is the intruder

Device Independent and Distrustful Protocol

10

Device Independent Protocol: A protocol whose reliability

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 Commitment Protocol

11

Its a Distrustful Protocol

Works in two phases:

Commit Phase: Alice interacts with Bob to commit to a

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

Device Independent Protocol

13

Each party has devices which can be viewed as Black

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

Fully Distrustful Protocol

14

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

Thus, certain Input/Output Pairs do not exist, which ensures

non-zero probability of detection of cheating

The Protocol: Commit Phase

15

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

The Protocol: Reveal Phase

16

Alice sends Bob sA and rA

Bob first checks whether c = rA or c = sA rA

He then randomly chooses sB and sC such that:

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

Quantum Cryptography provides an efficient

cryptography technique that is future proof and reliable

It isnt threatened by Quantum Computing Fully Distrustful Quantum Cryptography technique can be

used for communication between parties that do not trust each other, and neither their apparatus.

Thank You!!!
18

ANY QUERIES, PLEASE ASK...