I am looking for a proof for the following two claims from "Serious Cryptography" by Aumasson.

NM-CPA implies IND-CPA. [...] IND-CCA and NM-CCA are equivalent notions that imply the presence of the other.

where IND-CPA/IND-CCA and NM-CPA/CCA are defined as indistinguishability and non-malleability under chosen plaintext/chiphertext respectively.

Where can I find those proofs?


This paper, AFAICT: https://www.cs.ucdavis.edu/~rogaway/papers/relations.pdf

It is about the security of public-key encryption, but the proofs about the relations between security definitions are applicable to symmetric encryption.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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