Sign inSign in

Indistinguishable under Chosen Plaintext attack

A gold-standard security notion for encryption schemes that allows encrypting polynomially many messages and allows an adversary to request encryptions of chosen plaintexts.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Polynomial-time adversaries1Single-message computational security1

Lecturers

1

    Connections

    1

    The lectures that define it or assume it, and the concepts next to it.

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.