Deniable Encryption with Negligible Detection Probability: An Interactive Construction

Source: Ruhr-University Bochum

Favorite

Free registration required

Deniable encryption, introduced in 1997 by Canetti, Dwork, Naor, and Ostrovsky, guarantees that the sender or the receiver of a secret message is able to "Fake" the message encrypted in a specific ciphertext in the presence of a coercing adversary, without the adversary detecting that he was not given the real message. To date, constructions are only known either for weakened variants with separate "Honest" and "Dishonest" encryption algorithms, or for single-algorithm schemes with non-negligible detection probability.
Format:PDF Size:182.80
Date:Apr 2011