A key is generated by running .
Adversary is given input and oracle access to and .
Adversary outputs a pair of messages of the same length.
A uniform bit is chosen, the challenge ciphertext is computed and given to .
Adversary continues to have oracle access to and , but is not allowed to query on the challenge ciphertext itself. Adversary then outputs a bit .
Adversary succeeds and the output of the experiment is defined to be if and otherwise.
Definition. A private-key encryption scheme has indistinguishable encryptions under a chosen-ciphertext attack, or is CCA-secure, if for all probabilistic polynomial-time adversaries , there is a negligible function such that:
where the probability is taken over all randomness used in the experiment (to choose , and any randomness in ).
— Feb 17, 2023
Made with ❤ at Earth.