Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
C. Rackoff,Daniel R. Simon
1991 · DOI: 10.1007/3-540-46766-1_35
Annual International Cryptology Conference · 1,150 Citations
TLDR
A formalization of chosen ciphertext attack is given in the model which is stronger than the "lunchtime attack" considered by Naor and Yung, and it is proved a non-interactive public-key cryptosystem based on non-Interactive zero-knowledge proof of knowledge to be secure against it.