Welcome to the resource topic for 2018/1244
Title:
Fully Deniable Interactive Encryption
Authors: Ran Canetti, Sunoo Park, Oxana Poburinnaya
Abstract:Deniable encryption (Canetti et al., Crypto 1996) enhances secret communication over public channels, providing the additional guarantee that the secrecy of communication is protected even if the parties are later coerced (or willingly bribed) to expose their entire internal states: plaintexts, keys and randomness. To date, constructions of deniable encryption — and more generally, interactive deniable communication — only address restricted cases where only one party is compromised (Sahai and Waters, STOC 2014). The main question — whether deniable communication is at all possible if both parties are coerced at once — has remained open. We resolve this question in the affirmative, presenting a communication protocol that is fully deniable under coercion of both parties. Our scheme has three rounds, assumes subexponentially secure indistinguishability obfuscation and one-way functions, and uses a short global reference string that is generated once at system set-up and suffices for an unbounded number of encryptions and decryptions. Of independent interest, we introduce a new notion called off-the-record deniability, which protects parties even when their claimed internal states are inconsistent (a case not covered by prior definitions). Our scheme satisfies both standard deniability and off-the-record deniability.
ePrint: https://eprint.iacr.org/2018/1244
Talk: https://www.youtube.com/watch?v=Z3DEkC6LSIQ
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .