Fully deniable interactive encryption
From MaRDI portal
Publication:2096511
DOI10.1007/978-3-030-56784-2_27zbMath1504.94113OpenAlexW2913060025MaRDI QIDQ2096511
Ran Canetti, Sunoo Park, Oxana Poburinnaya
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_27
Related Items (7)
Deniable fully homomorphic encryption from learning with errors ⋮ A new framework for deniable secure key exchange ⋮ Explainable arguments ⋮ Subverting deniability ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ Disappearing cryptography in the bounded storage model ⋮ Fully deniable interactive encryption
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- The edited truth
- Fully deniable interactive encryption
- Perfect Structure on the Edge of Chaos
- Deniable Functional Encryption
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Lower and Upper Bounds for Deniable Public-Key Encryption
- Deniable Attribute Based Encryption for Branching Programs from LWE
- Composability and On-Line Deniability of Authentication
- Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Bi-Deniable Public-Key Encryption
- How to use indistinguishability obfuscation
- On Minimal Assumptions for Sender-Deniable Public Key Encryption
This page was built for publication: Fully deniable interactive encryption
