O'Reilly logo

Modern Cryptography: Theory and Practice by Wenbo Mao

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 15. Provably Secure and Efficient Public-Key Cryptosystems

15.1 Introduction

In the preceding chapter we have seen that early solutions to IND-CCA2 (equivalently, NM-CCA2) secure public-key cryptosystems have generally rested on applications of non-interactive zero-knowledge (NIZK) proof techniques. Such a proof shows a receiver of a ciphertext that the creator of the ciphertext already knows the corresponding plaintext because what is proved is the following NP membershipa statement:

“The ciphertext c is in language L defined by encryption algorithm ε under public key pk, and the creator of c has in its possession an auxiliary ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required