Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security

We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-malleability properties. We then show that the elegant encryption scheme of Naor and Yung [NY] can be made secure against the strongest form of chosen-ciphertext attack by using a non-malleable NIZK proof instead of a standard NIZK proof. Our encryption scheme is simple to describe and works in the standard cryptographic model under general assumptions. The encryption scheme can be realized assuming the existence of trapdoor permutations.

• Type: Conference
• Year: 1999
• Where: FOCS
• Authors: Amit Sahai
• Keywords: Encryption Scheme, FOCS 1999, NIZK Proof, Ordinary Nizk Proof, Theoretical Computer Science