Lecture 8: Coin Flipping by Telephone Wayne Patterson SYCS 654 Spring 2010.

Slides:

Advertisements

Similar presentations

Diffie-Hellman Diffie-Hellman is a public key distribution scheme First public-key type scheme, proposed in 1976.

Advertisements

1 Key Exchange Solutions Diffie-Hellman Protocol Needham Schroeder Protocol X.509 Certification.

David Evans CS588: Security and Privacy University of Virginia Computer Science Lecture 8: Hashing Note: only 3 people.

1 Chapter 7-2 Signature Schemes. 2 Outline [1] Introduction [2] Security Requirements for Signature Schemes [3] The ElGamal Signature Scheme [4] Variants.

Digital Signatures Good properties of hand-written signatures: 1. Signature is authentic. 2. Signature is unforgeable. 3. Signature is not reusable (it.

Digital Signatures and applications Math 7290CryptographySu07.

Short course on quantum computing Andris Ambainis University of Latvia.

Introduction to Modern Cryptography, Lecture 13 Money Related Issues ($$$) and Odds and Ends.

Announcements: See schedule for weeks 8 and 9 See schedule for weeks 8 and 9 Project workdays, due dates, exam Project workdays, due dates, exam Projects:

Announcements: Computer exam next class Computer exam next classQuestions? DTTF/NB479: DszquphsbqizDay 10.

Public-key Cryptography Montclair State University CMPT 109 J.W. Benham Spring, 1998.

Elliptic Curve Cryptography (ECC) Mustafa Demirhan Bhaskar Anepu Ajit Kunjal.

HW6 due tomorrow Teams T will get to pick their presentation day in the order Teams T will get to pick their presentation day in the orderQuestions? Review.

Proactive Secure Mobile Digital Signatures Work in progress. Ivan Damgård and Gert Læssøe Mikkelsen University of Aarhus.

Cryptography1 CPSC 3730 Cryptography Chapter 10 Key Management.

Pass in HW6 now Can use up to 2 late days Can use up to 2 late days But one incentive not to burn them all: teams will get to pick their presentation day.

EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 7 Wenbing Zhao Department of Electrical and Computer Engineering.

ITIS 6200/8200. time-stamping services Difficult to verify the creation date and accurate contents of a digital file Required properties of time-stamping.

EEC 688/788 Secure and Dependable Computing Lecture 7 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University

CSE331: Introduction to Networks and Security Lecture 20 Fall 2002.

Optimistic Synchronous Multi-Party Contract Signing N. Asokan, Baum-Waidner, M. Schunter, M. Waidner Presented By Uday Nayak Advisor: Chris Lynch.

Introduction to Modern Cryptography, Lecture 9 More about Digital Signatures and Identification.

Network Security – Part 2 V.T. Raja, Ph.D., Oregon State University.

Cryptography and Network Security Chapter 10. Chapter 10 – Key Management; Other Public Key Cryptosystems No Singhalese, whether man or woman, would venture.

Diffie-Hellman Key Exchange

Computer Science Public Key Management Lecture 5.

Public Key Model 8. Cryptography part 2.

13.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 13 Digital Signature.

Strong Password Protocols

Csci5233 Computer Security1 Bishop: Chapter 10 Key Management: Digital Signature.

Information Security and Management 13. Digital Signatures and Authentication Protocols Chih-Hung Wang Fall

Digital Signatures Good properties of hand-written signatures: 1. Signature is authentic. 2. Signature is unforgeable. 3. Signature is not reusable (it.

Lecture 7b: The Diffie-Hellman Secret Sharing Scheme Wayne Patterson SYCS 653 Fall 2009.

Protocols to do seemingly impossible 1 CHAPTER 11: Protocols to do seemingly impossible A protocol is an algorithm two (or more) parties have to follow.

Key Management and Diffie- Hellman Dr. Monther Aldwairi New York Institute of Technology- Amman Campus 12/3/2009 INCS 741: Cryptography 12/3/20091Dr. Monther.

HW6 due tomorrow Teams T will get to pick their presentation day in the order Teams T will get to pick their presentation day in the order Teams mostly.

Chapter 4: Intermediate Protocols

Lecture 10: Mental Poker Wayne Patterson SYCS 654 Spring 2010.

By Yernar.  Background  Key generation  Encryption  Decryption  Preset Bits  Example.

Introduction to Modern Cryptography Sharif University Spring 2015 Data and Network Security Lab Sharif University of Technology Department of Computer.

Remaining course content Remote, fair coin flipping Remote, fair coin flipping Presentations: Protocols, Elliptic curves, Info Theory, Quantum Crypto,

Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.

Flipping coins over the telephone and other games.

Quantum Cryptography Slides based in part on “A talk on quantum cryptography or how Alice outwits Eve,” by Samuel Lomonaco Jr. and “Quantum Computing”

1 Chapter 10: Key Management in Public key cryptosystems Fourth Edition by William Stallings Lecture slides by Lawrie Brown (Modified by Prof. M. Singhal,

Lecture 13 Secret Sharing Schemes and Game. Secret sharing schemes are multi-party protocols related to key establishment. The original motivation for.

Diffie-Hellman Key Exchange Color Mixing Example Rick Stroud 21 September 2015 CSCE 522.

Network Security Continued. Digital Signature You want to sign a document. Three conditions. – 1. The receiver can verify the identity of the sender.

Software Security Seminar - 1 Chapter 4. Intermediate Protocols 발표자 : 이장원 Applied Cryptography.

Key Management Network Systems Security Mort Anvari.

CSE 486/586, Spring 2013 CSE 486/586 Distributed Systems Byzantine Fault Tolerance Steve Ko Computer Sciences and Engineering University at Buffalo.

Lecture 9 Overview. Digital Signature Properties CS 450/650 Lecture 9: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.

Cryptography and Network Security Chapter 10 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.

1 Chapter 3-3 Key Distribution. 2 Key Management public-key encryption helps address key distribution problems have two aspects of this: –distribution.

Diffie-Hellman Key Exchange first public-key type scheme proposed by Diffie & Hellman in 1976 along with the exposition of public key concepts – note:

RSA Cryptosystem Great Theoretical Ideas In Computer Science S. Rudich V. Adamchik CS Spring 2006 Lecture 8Feb. 09, 2006Carnegie Mellon University.

Breaking Cryptosystems Joshua Langford University of Texas at Tyler Fall 2007 Advisor: Dr. Ramona Ranalli Alger.

Bit Commitment, Fair Coin Flips, and One-Way Accumulators Matt Ashoff 11/9/2004 Cryptographic Protocols.

CS480 Cryptography and Information Security Huiping Guo Department of Computer Science California State University, Los Angeles 14. Digital signature.

Information Security message M one-way hash fingerprint f = H(M)

Information Security message M one-way hash fingerprint f = H(M)

Coin Flipping Protocol

Diffie-Hellman Secure Key Exchange 1976.

Diffie-Hellman Key-Exchange Algorithm

Information Security message M one-way hash fingerprint f = H(M)

El Gamal and Diffie Hellman

Chapter 13 Digital Signature

12.5 Independent and Dependent Events

DHKE Example ABDULAZIZ A. HAMEDA.

Secure Diffie-Hellman Algorithm

Presentation transcript:

Lecture 8: Coin Flipping by Telephone Wayne Patterson SYCS 654 Spring 2010

Coin Flipping by Telephone Originally presented by Manuel Blum, then at UC Berkeley (now at Carnegie-Mellon): M. Blum. Coin flipping by telephone. In Proceedings of IEEE Spring Computer Conference, pages IEEE, Blum was Rene Peraltas thesis advisor Rene is a colleague who is now responsible for security in electronic voting at NIST

As Rene Posed the Problem Alice and Bob have decided to divorce. They are in different cities, want to decide who gets the (house, car, dog, …) They decide to flip a coin Naturally they dont trust each other …

Alice and Bob Agree on a Secure One-Way Function For example, the function could be a x (mod p), for an agreed- upon large prime number p and an agreed-upon primitive root a.

Alice Will Flip the Coin The act of flipping is the choice of a secret x, 1 < x < p-1. x is either odd or even (i.e. heads or tails) Alice chooses x (the flip) and announces to Bob the computation y = a x mod p.

What Does Bob Do? Bob receives y, and guesses that x is odd or even (heads or tails). Bob sends his guess to Alice. Alice verifies the result, whether Bob guessed right or wrong, and proves her decision by sending x to Bob. Bob can verify that Alice did not lie by performing the same computation y = a x mod p. If Alice lied about the value of x, Bob can prove the lie by the fact that the y he computes will not be the same y he had received.