In chapter 3 of Katz Textbook, there is a theorem which states as follows:

"Any private key encryption scheme that is CPA-secure is also CPA-secure for multiple encryptions."

I can make sense of the theorem as CPA secure scheme requires randomized encryption and hence encrypting multiple messages will also be secure. How can I prove this formally?


1 Answer 1


As is stated in the book, the analogous theorem for public-key encryption is proven in Section 12.2.2. The reason why the proof is delayed until then is that it is more complex than all proofs until this point. In particular, it requires the use of a hybrid argument, and this is introduced only in Chapter 8.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.