28 April 2005 CS588 Spring 2005 David Evans Phun with Photons.

Slides:



Advertisements
Similar presentations
Quantum Cryptography Nick Papanikolaou Third Year CSE Student
Advertisements

Codes, Ciphers, and Cryptography Quantum Cryptography.
David Evans CS588: Cryptography University of Virginia Computer Science Lecture 17: Public-Key Protocols.
Alice and Bob in the Quantum Wonderland. Two Easy Sums 7873 x 6761 = ? 7873 x 6761 = ? ? x ? = ? x ? =
Computer Security Set of slides 5 Dr Alexei Vernitski.
CS 6262 Spring 02 - Lecture #7 (Tuesday, 1/29/2002) Introduction to Cryptography.
1 Introduction CSE 5351: Introduction to cryptography Reading assignment: Chapter 1 of Katz & Lindell.
15-1 Last time Internet Application Security and Privacy Public-key encryption Integrity.
David Evans CS150: Computer Science University of Virginia Computer Science Lecture 40: Computing with Glue and Photons.
Quantum Key Distribution (QKD) John A Clark Dept. of Computer Science University of York, UK
Quantum Cryptography Qingqing Yuan. Outline No-Cloning Theorem BB84 Cryptography Protocol Quantum Digital Signature.
QUANTUM CRYPTOGRAPHY Narayana D Kashyap Security through Uncertainty CS 265 Spring 2003.
Quantum Key Distribution Yet another method of generating a key.
Introduction to Quantum Cryptography Dr. Janusz Kowalik IEEE talk Seattle, February 9,2005.
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 7 Wenbing Zhao Department of Electrical and Computer Engineering.
Introduction to Modern Cryptography, Lecture 7/6/07 Zero Knowledge and Applications.
Quantum Key Establishment Wade Trappe. Talk Overview Quantum Demo Quantum Key Establishment.
Quantum Cryptography Prafulla Basavaraja CS 265 – Spring 2005.
Overview of Cryptography and Its Applications Dr. Monther Aldwairi New York Institute of Technology- Amman Campus INCS741: Cryptography.
Single Photon Quantum Encryption Rob Grove April 25, 2005.
CRYPTOGRAPHY Lecture 10 Quantum Cryptography. Quantum Computers for Cryptanalysis Nobody understands quantum theory. - Richard Feynman, Nobel prize-winning.
CS4600/5600 Biometrics and Cryptography UTC/CSE
Lecture 19 Page 1 CS 111 Online Security for Operating Systems: Cryptography, Authentication, and Protecting OS Resources CS 111 On-Line MS Program Operating.
Sorting Out Digital Certificates Bill blog.codingoutloud.com ··· Boston Azure ··· 13·Dec·2012 ···
Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.
Gagan Deep Singh GTBIT (IT) August 29,2009.
Lecture 19 Page 1 CS 111 Online Symmetric Cryptosystems C = E(K,P) P = D(K,C) E() and D() are not necessarily the same operations.
CS110: Computers and the Internet Encryption and Certificates.
13-1 Last time Security in Networks Network Security Controls Firewalls Honeypots Intrusion Detection Systems.
David Evans CS200: Computer Science University of Virginia Computer Science Class 35: Cookie Monsters and Semi-Secure.
Security in Computing Chapter 12, Cryptography Explained Part 7 Summary created by Kirk Scott 1.
Security Grant Hutchins CS Discussion Group Tuesday, October 22, 2002.
David Evans CS200: Computer Science University of Virginia Computer Science Class 36: Public-Key Cryptography If you want.
CS526: Information Security Prof. Sam Wagstaff September 16, 2003 Cryptography Basics.
Quantum Cryptography. Cryptography  Art of writing messages so that no one other than intended receiver can read it.  Encryption – Performing mathematical.
Quantum cryptography CS415 Biometrics and Cryptography UTC/CSE.
CSCI 172/283 Fall 2010 Hash Functions, HMACs, and Digital Signatures.
Quantum Cryptography Zelam Ngo, David McGrogan. Motivation Age of Information Information is valuable Protecting that Information.
David Evans CS150: Computer Science University of Virginia Computer Science Class 33: Computing with Photons From The.
Network Security – Special Topic on Skype Security.
Quantum Cryptography Physics 43, SRJC.Spring 11 May 9, 2011 Chris Wenrich Homer Van Grinsimpson aka Seth Van Grinsven James Anderson.
CS555Topic 251 Cryptography CS 555 Topic 25: Quantum Crpytography.
Introduction1-1 Data Communications and Computer Networks Chapter 6 CS 3830 Lecture 28 Omar Meqdadi Department of Computer Science and Software Engineering.
CPS 290 Computer Security Network Tools Cryptography Basics CPS 290Page 1.
Lecture 2: Introduction to Cryptography
Quantum Cryptography Slides based in part on “A talk on quantum cryptography or how Alice outwits Eve,” by Samuel Lomonaco Jr. and “Quantum Computing”
David Evans CS588: Security and Privacy University of Virginia Computer Science Lecture 16: Blocking and Catching Photons.
Quantum Mechanics1 Schrodinger’s Cat. Quantum Mechanics2 A particular quantum state, completely described by enough quantum numbers, is called a state.
Nawaf M Albadia
14-1 Last time Internet Application Security and Privacy Basics of cryptography Symmetric-key encryption.
Encryption CS110: Computer Science and the Internet.
Applications of Quantum Cryptography – QKD CS551/851CRyptographyApplicationsBistro Mike McNett 6 April 2004 Paper: Chip Elliott, David Pearson, and Gregory.
Chaos, Communication and Consciousness Module PH19510 Lecture 13 Encryption in the Computer Age.
Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” including Quantum Communication Quantum Computing.
A quantum leap: Researchers create super-secure computer network Seungjai Min Hansang Bae Hwanjo Heo.
Quantum Cryptography and Quantum Computing. Cryptography is about a)manipulating information b)transmitting information c)storing information.
Lecture 11: Quantum Cryptography Wayne Patterson SYCS 654 Spring 2009.
Presented By, Mohammad Anees SSE, Mukka. Contents Cryptography Photon Polarization Quantum Key Distribution BB84 Protocol Security of Quantum Cryptography.
INCS 741: Cryptography Overview and Basic Concepts.
Department of Computer Science Chapter 5 Introduction to Cryptography Semester 1.
15-853Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” Including Quantum Communication Quantum Computing.
Encryption and Integrity
COMPSCI 290.2: Computer Security
Quantum Cryptography Arjun Vinod S3 EC Roll No:17.
By Jeff Hinson CS691, Summer 2009
Quantum Cryptography Alok.T.J EC 11.
Lecture 14: Blocking and Catching Photons Background
Quantum Cryptography Scott Roberts CSE /01/2001.
Lecture 24: Metalinguistics CS200: Computer Science
Quantum Technology programme
Presentation transcript:

28 April 2005 CS588 Spring 2005 David Evans Phun with Photons

2 CS588 Lecture 22 Menu Visual Cryptography Quantum Cryptography Quantum Computing (very briefly) Cryptographic Hashing Attacks –Boyd and Isabelle

3 CS588 Lecture 22 Visual Cryptography Can we quickly do a lot of XORs without a computer? Yes: 0: 1: Key Ciphertext.5 probability

4 CS588 Lecture 22 Key + Ciphertext Key Ciphertext = 0 = 1

5 CS588 Lecture 22 Perfect Cipher? Key Ciphertext.5 probability Plaintext 0 1

6 CS588 Lecture 22 Perfect Cipher Key Ciphertext.5 probability Plaintext 0 1 P (C = | M = 0) =.5 P (C = | M = 1) =.5 P (C = | M = 0) =.5 P (C = | M = 1) =.5 Yes! = =

7 CS588 Lecture 22 Authentication for remote voting Remote voting offers convenience –69% votes cast by mail in 2001 in state of Washington Electronic voting is cheaper and faster –More secure? –New problems: virus, worm, spoofing, denial of service Mutual authentication –Voter authenticated to server –Server authenticated to voter Nathanael Paul, David Evans, Avi Rubin and Dan Wallach. Workshop on Human-Computer Interaction and Security Systems. 6 April

8 CS588 Lecture 22 Doing Encryption without Computers Can’t trust voters to have trustworthy computers –Viruses can tamper with their software Need to do authentication in a way that doesn’t depend on correctness of user’s software Lorenz cipher: use XOR to encrypt –Is there a way to do lots of XOR’s without a computer?

9 CS588 Lecture 22 Remote Voting System E k (k 1 ) E k (k n ) E k (k 2 ) … … STEP 1keys kiki S k i = “AQEGSDFASDF” S STEP 2 STEP 3 – if k i valid… STEP 4 Key: AQEGSDFASDF k i = client machine Each voter is sent a key, k i

10 CS588 Lecture 22 Authentication by Transparency

11 CS588 Lecture 22 Quantum Cryptography

12 CS588 Lecture 22 Quantum Physics for Dummies Light behaves like both a wave and a particle at the same time A single photon is in many states at once Can’t observe its state without forcing it into one state Schrödinger’s Cat –Put a live cat in a box with cyanide vial that opens depending on quantum state –Cat is both dead and alive at the same time until you open the box

13 CS588 Lecture 22 Heisenberg’s Uncertainty Principle “We cannot know, as a matter of principle, the present in all its details.” Werner Heisenberg, 1920s If you can’t know all the details about something you can’t copy it. Bits are easy to copy; photons are impossible to copy.

14 CS588 Lecture 22 Quantum Cash Stephen Wiesner, late 60s: “I didn’t get any support from my thesis advisor – he showed no interest in it at all. I showed it to several other people, and they all pulled a strange face, and went straight back to what they were already doing.” (Quoted in Singh, The Code Book)

15 CS588 Lecture 22 Photons have “spin”: V H +45º -45º Photon Polarity Vertical filter: 100% of V photons 50% of +45º photons (become V photons) 50% of -45º photons (become V photons) 0% of H photons Horizontal filter: 100% of H photons 50% of +45º photons (become H photons) 50% of -45º photons (become H photons) 0% of V photons

16 CS588 Lecture 22 Photon Stream Vertical filter: 100% of V photons 50% of +45º photons (become V photons) 50% of -45º photons (become V photons) 0% of H photons Can’t tell difference between V and +45º and –45º photons

17 CS588 Lecture 22 Quantum Cash Uncertainty Principal Bank $10000 $10000 $10000 $10000 In Dice We Trust Unique ID Spinning Photons Richard Feynman Safecracker, Father of Quantum Computing

18 CS588 Lecture 22 Bank Verifies Bill Unique ID Spinning Photons Uncertainty Principal IDAmountPhotons ……… $10000V-45H+45+45V ……… Bank aligns filters according to expected values. If photons on bill all pass through filters, the bill is valid.

19 CS588 Lecture 22 Counterfeiting Quantum Cash To copy a bill, need to know the photons. Counterfeiter can guess, but loses information. Physics says there is no way to measure the spins without knowing them!

20 CS588 Lecture 22 Perfect Security? Bill photons: V (¼), +45 (¼), -45 (¼), H (¼) Guess V-filter: passes 100% of V photons, ½ of +45 and ½ of -45 –p (M = V | passes V filter) =.25 / (.25 + (.5 *.25) + (.5 *.25)) =.25/.5 =.5 If photon passes, counterfeiter can guess it is a V photon, right ½ of the time. If photon doesn’t pass, guess it’s a H photon, right ½ of the time. –p (M = +45 | passes V filter) =.25 Actually a bit more complicated – can guess some photons wrong, and 50% chance bank won’t notice.

21 CS588 Lecture 22 Guessing One +45º Photon Passes through V-filter (.5) –Counterfeiter guesses V-photon –Passes through Banks +45 filter (.5) –.25 chance of getting it right Doesn’t passes through V-filter (.5) –Counterfeiter guesses H-photon –Passes through Banks +45 filter (.5) –.25 chance of getting it right Probability of not getting caught =.5 Forge bill with 6 photons = 1/2 6 ; use more photons for more valuable bills.

22 CS588 Lecture 22 Quantum Key Distribution

23 CS588 Lecture 22 Quantum Key Distribution Charles Bennett (1980s) Use quantum physics to transmit a key with perfect secrecy Alice sends a stream of random photons Bob selects random filters to try and guess photons After, they communicate over insecure channel to figure out which bits were transmitted correctly

24 CS588 Lecture 22 Quantum Key Distribution 1.Alice generates a random sequence. Transmits: 0: or (Randomly pick H or –45) 1: or (Randomly pick V or +45) 2.Bob randomly guesses filter: Rectilinear detector: recognizes H and V photons with 100% accuracy, randomly misrecognizes diagonal photons. Diagonal detector: recognizes -45 and +45 photons with 100% accuracy, randomly misrecognizes H and V photons.

25 CS588 Lecture 22 Detecting Photons Bob picks the right detector: –100% chance of correctly recognizing bit Bob picks the wrong detector: –50% chance of “guessing” bit Bob can’t tell the difference But, Alice can (since she picked the photon encoding)

26 CS588 Lecture 22 Finding Correct Guesses 3.Alice calls Bob over an insecure line, and tell him rectangular/diagonal for each bit. Bob tells Alice if he guessed right. They use the bits he guessed right on as the key. 4.Alice and Bob do some error checking (e.g., use a checksum) to make sure they have the same key.

27 CS588 Lecture 22 What about Eve? Eve can intercept the photon stream, and guess filters. If she guesses right, she can resend the same photon. If she guesses wrong, 50% chance she will send the wrong photon. 50% chance Bob will guess the right filter on this photon, so 25% chance of error

28 CS588 Lecture 22 Eve is Caught When Alice and Bob agree on which bits to use, Eve will have the wrong ones since she guesses different polarities. Eve cannot eavesdrop without Alice and Bob noticing an unusually high error rate!

29 CS588 Lecture 22 Is this practical?

30 CS588 Lecture 22 (Geneva, Switzerland)

Movie Teaser

32 CS588 Lecture 22 What’s in the “Sneakers” Black Box? A Quantum Computer

33 CS588 Lecture 22 Quantum Computing Feynman, 1982 Quantum particles are in all possible states Can try lots of possible computations at once with the same particles In theory, can test all possible factorizations/keys/paths/etc. and get the right one! In practice, major advances required before we can build it (unless the NSA knows something we don’t…): 7-qubit computer –Adding another qubit is more than twice as hard

34 CS588 Lecture 22 Cryptographic Hashing Attacks

35 CS588 Lecture 22 Charge Tuesday: –Project presentations Order will be determined pseudorandomly –Reports due Sneakers: send me before Monday if you are coming