Scribed by Manohar Jonnalagedda
Having introduced the notion of CPA security in the past lecture, we shall now see constructions that achieve it. Such constructions shall require either pseudorandom functions or pseudorandom permutations. We shall see later how to construct such objects.
1. Pseudorandom Functions
To understand the definition of a pseudorandom function, it’s good to think of it as a pseudorandom generator whose output is exponentially long, and such that each bit of the output is efficiently computable given the seed. The security is against efficient adversaries that are allowed to look at at any subset of the exponentially many output bits.
Definition 1 (Pseudorandom Function) A function is a -secure pseudorandom function if for every oracle algorithm that has complexity at most we have
Intuitively, this means that an adversary wouldn’t be able to distinguish outputs from a purely random function and a pseudorandom function (upto a certain additive error). Typical parameters are , in which case security as high as is conjectured to be possible.
As usual, it is possible to give an asymptotic definition, in which is required to be negligible, is allowed to be any polynomial, and is required to be computable in polynomial time.
2. Encryption Using Pseudorandom Functions
Suppose is a pseudorandom function. We define the following encryption scheme.
- : pick a random , output
This construction achieves CPA security.
The proof of Theorem 2 will introduce another key idea that will often reappear in this course: to first pretend that our pseudorandom object is truly random, and perform our analysis accordingly. Then extend the analysis from the pseudorandom case to the truly random case.
Let us therefore consider a modified scheme , where instead of performing , we do , where is a truly random function. We need to look at how secure this scheme is. In fact, we will actually prove that
Lemma 3 is CPA secure.
In the computation of algorithm given oracle and input the ciphertext , let us define REP to be the event where gets the messages from the oracle, such that equals one of the .
Then we have
Now the first difference is the difference between two numbers which are both between and , so it is at most , which is at most .
The second difference is zero, because with a purely random function there is a 1-1 mapping between every random choice (of ) which makes the first event happen and every random choice that makes the second event happen. ◻
We have shown that with a purely random function, the above encryption scheme is CPA-secure. We can now turn our eyes to the pseudorandom scheme , and prove Theorem 2.
Proof: Consider the following four probabilities, for messages , , and algorithm :
From the previous proof, we have . If we are able to show that , , then we have .
So, it remains to show that
Suppose, by contradiction, this is not the case. We will show that such a contradiction implies that is not secure, by constructing an oracle algorithm that distinguishes from a truly random function.
For an oracle , we define to be the following algorithm:
- pick a random and compute
- simulate ; every time makes an oracle query , pick a random and respond to the query with
Note that if is given the oracle , then the computation is exactly the same as the computation , and if is given the oracle , where is a random function, then the computation .
Thus, we have
which means that
The complexity of is at most the complexity of times (the time needed to translate between oracle queries of and oracle queries of ), and so if has complexity then has complexity . This means that (4) contradicts the assumption that is secure. ◻