Deniable encryption ⇒ CPA-secure PKE

Fully-black-box reduction · standard model · folklore · security loss: none

Statement

If is sender-deniable, then is CPA-secure: for every admissible efficient there is an admissible efficient with — standard. Correctness and the two distinct equal-length messages carry over, since of a deniable encryption scheme is by definition a -correct PKE scheme.

Sketch

Given , runs to obtain with and submits . Then is an encryption of under uniform coins in both worlds, so ignores , runs on and outputs its guess.