Scribd
Upload
16 views

2024 CS783 Quiz1

Uploaded by

Tinklus Pinklus
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views

2024 CS783 Quiz1

Uploaded by

Tinklus Pinklus
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CS783: Theoretical Foundations of Cryptography Fall 2024

Quiz 1
August 23, 2024
Full marks: 20, Time: 1 hour
Instructor: Chethan Kamath

Roll Number: Name:

1. Please enter your roll number and name in the answer booklet too.

2. There are five problems. Answer problems 1 and 2 in the same sheet of the answer
booklet and use separate sheets for problems 3-5.

3. Problems 1 and 2 are all or nothing: you get the 3 marks only if your answer is the
exact subset. If you think the correct answers are 1 and 3, just write “1, 3”

4. Answer using a pen. Pencils are not allowed.

Problem 1 (3 marks). Which of the following functions are negligible?


1. f (n) := 1/nlog n

2. f (n) := nlog n · ν(n), for any negligible function ν


(
1/2n if n is a prime
3. f (n) := 314159
1/n otherwise

4. f (n) := ν1 (n) + ν2 (n) for negligible functions ν1 and ν2


Problem 2 (3 marks). For a pseudo-random generator (PRG) G, consider the following
four constructions of G′ . Select the ones that are PRGs.
1. G′ (s) := G(s)∥G(s + 1)

2. G′ (s1 ∥s2 ) := s1 ∥G(s2 ), where |s1 | − |s2 | = 1


(
0|s|+1 if s of the form 0|s|
3. G′ (s) :=
G(s) otherwise

4. G′ (s) := G(s)∥1|s|
Problem 3 (4 marks). For a PRG G, consider the one-way function (OWF) f (x) :=
G(x). Formally prove that if G is a PRG then f is a OWF. First describe your reduction,
and then analyse why the reduction works.
Problem 4 (2+3=5 marks). For a OWF f , consider f ′ (x1 ∥x2 ) := x1 ∥f (x1 ∥x2 ), where
|x1 | − |x2 | = 1. Design an f such that

CS783 Page 1 of 2 Quiz 1


1. f ′ is a OWF, and briefly argue why.

2. f ′ is not a OWF: describe your inverter.

(Hint: in both cases, design f using another OWF f ′′ .)

Problem 5 (2+3=5 marks).

1. Let f1 and f2 be two functions such that only one of the two is one-way and we
don’t know which one. Using f1 and f2 , design a OWF f . Briefly argue why f
is one-way. (Hint: while designing, keep in mind that given an inverter for f , it
should be possible to construct inverters for both f1 and f2 .)

Such a construction f is called a “combiner”. In the question below, you have to


construct a combiner for shared-key encryption (SKE) secure against eavesdroppers.

2. Let Π1 = (Gen1 , Enc1 , Dec1 ) and Π2 = (Gen2 , Enc2 , Dec2 ) be two SKE schemes such
that only one of the two is secret against eavesdroppers, and we don’t know which
one. Using Π1 and Π2 , design a SKE Π that is secret against eavesdroppers, and
briefly argue why. (Hint: use the hint for the first part, and also recall that the
eavesdropper has flexibility to choose the challenge messages m0 and m1 .)

CS783 Page 2 of 2 Quiz 1

You might also like