Princeton University COS 433 Cryptography Fall 2007 Boaz Barak COS 433: Cryptography Princeton University Fall 2007 Boaz Barak Lectures 1-6: Short Recap.

Slides:

Advertisements

Similar presentations

Princeton University COS 433 Cryptography Fall 2005 Boaz Barak COS 433: Cryptography Princeton University Fall 2005 Boaz Barak Lecture 1-7: Short Recap.

Advertisements

Course summary COS 433: Crptography -Spring 2010 Boaz Barak.

Foundations of Cryptography Lecture 10 Lecturer: Moni Naor.

Foundations of Cryptography Lecture 11 Lecturer: Moni Naor.

CMSC 414 Computer (and Network) Security Lecture 4 Jonathan Katz.

CS555Topic 191 Cryptography CS 555 Topic 19: Formalization of Public Key Encrpytion.

1 Cryptanalysis-tolerant CPA crypt. ● Suppose E, E’ are two encryption schemes which on of them is CPA - secure  E.g., a standard and a proprietary, a.

Princeton University COS 433 Cryptography Fall 2007 Boaz Barak COS 433: Cryptography Princeton University Spring 2010 Boaz Barak Lecture 7: Chosen Plaintext.

CIS 5371 Cryptography 3b. Pseudorandomness.

Cryptography: The Landscape, Fundamental Primitives, and Security David Brumley Carnegie Mellon University.

Foundations of Cryptography Lecture 13 Lecturer: Moni Naor.

Foundations of Cryptography Lecture 12 Lecturer: Moni Naor.

Princeton University COS 433 Cryptography Fall 2005 Boaz Barak COS 433: Cryptography Princeton University Fall 2005 Boaz Barak Lecture 7: Block Ciphers.

CMSC 456 Introduction to Cryptography

CMSC 414 Computer and Network Security Lecture 4 Jonathan Katz.

Overview of Cryptography Anupam Datta CMU Fall A: Foundations of Security and Privacy.

Princeton University COS 433 Cryptography Fall 2005 Boaz Barak COS 433: Cryptography Princeton University Fall 2005 Boaz Barak Lecture 2: Perfect Secrecy.

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

CRYPTOGRAPHY WHAT IS IT GOOD FOR? Andrej Bogdanov Chinese University of Hong Kong CMSC 5719 | 6 Feb 2012.

CS555Spring 2012/Topic 41 Cryptography CS 555 Topic 4: Computational Approach to Cryptography.

Princeton University COS 433 Cryptography Fall 2005 Boaz Barak COS 433: Cryptography Princeton University Fall 2005 Boaz Barak Lecture 2: Perfect Secrecy.

Foundations of Cryptography Lecture 10: Pseudo-Random Permutations and the Security of Encryption Schemes Lecturer: Moni Naor Announce home )deadline.

CMSC 414 Computer and Network Security Lecture 3 Jonathan Katz.

Cramer-Shoup is Plaintext Aware in the Standard Model Alexander W. Dent Information Security Group Royal Holloway, University of London.

Computer Security CS 426 Lecture 3

Foundations of Cryptography Lecture 9 Lecturer: Moni Naor.

Foundations of Cryptography Lecture 8 Lecturer: Moni Naor.

CMSC 414 Computer and Network Security Lecture 3 Jonathan Katz.

Cryptography Lecture 8 Stefan Dziembowski

Cryptography Lecture 3 Arpita Patra.

Cryptography Dec 29. This Lecture In this last lecture for number theory, we will see probably the most important application of number theory in computer.

CS555Spring 2012/Topic 51 Cryptography CS 555 Topic 5: Pseudorandomness and Stream Ciphers.

Ryan Henry I 538 /B 609 : Introduction to Cryptography.

Cryptography Lecture 7: RSA Primality Testing Piotr Faliszewski.

CS555Spring 2012/Topic 111 Cryptography CS 555 Topic 11: Encryption Modes and CCA Security.

Cryptography Lecture 2 Stefan Dziembowski

Cryptography Lecture 2 Arpita Patra. Summary of Last Class  Introduction  Secure Communication in Symmetric Key setting >> SKE is the required primitive.

1 CIS 5371 Cryptography 4. Message Authentication Codes B ased on: Jonathan Katz and Yehuda Lindell Introduction to Modern Cryptography.

CS555Spring 2012/Topic 31 Cryptography CS 555 Topic 3: One-time Pad and Perfect Secrecy.

CS555Spring 2012/Topic 71 Cryptography CS 555 Topic 7: Stream Ciphers and CPA Security.

Secure Computation (Lecture 9-10) Arpita Patra. Recap >> MPC with honest majority in i.t. settings > Protocol using (n,t)-sharing, proof of security---

Cryptography Lecture 6 Arpita Patra © Arpita Patra.

CS555Spring 2012/Topic 81 Cryptography CS 555 Topic 8: Pseudorandom Functions and CPA Security.

Cryptography Lecture 9 Arpita Patra © Arpita Patra.

Cryptography Lecture 10 Arpita Patra © Arpita Patra.

Cryptography Lecture 3 Arpita Patra © Arpita Patra.

Cryptography Lecture 5 Arpita Patra © Arpita Patra.

Authenticated encryption

Modern symmetric-key Encryption

Course summary COS 433: Crptography -Spring 2010 Boaz Barak.

Information Security CS 526

Cryptography Lecture 9.

Cryptography Lecture 12.

Topic 5: Constructing Secure Encryption Schemes

Topic 3: Perfect Secrecy

CMSC 414 Computer and Network Security Lecture 3

Cryptography Lecture 6.

Topic 7: Pseudorandom Functions and CPA-Security

B504/I538: Introduction to Cryptography

Cryptography Lecture 7.

Cryptography Lecture 11.

Cryptography Lecture 5 Arpita Patra © Arpita Patra.

Cryptography Lecture 8.

Cryptography Lecture 5 Arpita Patra © Arpita Patra.

Cryptography Lecture 12.

Cryptography Lecture 7.

Cryptography Lecture 11.

Cryptography Lecture 10.

Cryptography Lecture 6.

Presentation transcript:

Princeton University COS 433 Cryptography Fall 2007 Boaz Barak COS 433: Cryptography Princeton University Fall 2007 Boaz Barak Lectures 1-6: Short Recap

2 Perfectly Secure Encryption E x0x0 y x1x1 I can’t guess if it was x 0 or x 1 with prob better than ½ One time pad achieves this for unbounded adversary with |key| ¸ |message| Pseudorandom Generators G I can’t tell if I’m seeing G(s) or just lots of random coins! s y $$$$$$$$$$$$$$ We conjecture that they exist. (PRG Axiom) If we’re right, can get encryption with |key| < |message length|

3 Pseudorandom Functions (PRF) fkfk x y I don’t know what’s inside this box! Theorem: PRG Axiom ) 9 PRF

4 Ideal scheme using random function E Security of PRF-based Constructions E fkfk Encryption scheme using PRF. Can adversary succeed? 1) Prove that ideal scheme is secure. 2) Show this implies security for real scheme: Otherwise all system is one big adversary for the PRF.

5 CPA Secure Encryption E x0x0 y x1x1 E They gave me encryption box to play with and I still can’t guess if it’s x 0 or x 1 w/ prob > ½ + ² Theorem: 9 PRF ) 9 CPA-secure encryption Construction: E k (x) = choose r 2 R {0,1} n send (r, f k (r) © x)