CAS CS 538: Cryptography, Fall 2011
Instructor: Ran Canetti
Problem Set 3
September 24, 2011
Due: Tuesday 10/4 in class
Recall the denitions: (Denition 1 is worded slightly dierently than in problem set 2 but the intention is
the same.)
Denition 1 A funct
CAS CS 538: Cryptography, Fall 2011
Instructor: Ran Canetti
Problem Set 5
October 19, 2011
Due: Thursday 10/27 in class
Recall the denitions of KPA and CPA secure encryption:
Denition 1 A pair of algorithms Enc, Dec, and ensembles K = cfw_Kn nN , M = cfw_
CAS CS 538: Cryptography, Fall 2011
Instructor:Ran Canetti
Problem Set 2
September 15, 2011
Due: Thursday 9/22 in class
Recall the denitions:
Denition 1 A function f : N R+ is negligible if for all large enough n we have f (n) < 1/nc . (By for al
large en
CAS CS 538: Cryptography, Fall 2011
Instructor: Ran Canetti
Problem Set 4
October 8, 2011
Due: Thursday 10/13 in class
Recall the denitions of psedudorandom generators and polynomially secure shared-key encryption. The
formulations below use the notation
CAS CS 538: Cryptography, Fall 2011
Instructor:Ran Canetti
Problem Set 1
September 8, 2011
Due: Thursday 9/15 in class
Consider the following denition:
Denition 1 Let D1 and D2 be two distributions over the same domain X . The statistical distance between