Fully deniable interactive encryption
type: Item
instance of: scholarly article
title: Fully deniable interactive encryption
zbMATH Open document ID: 1504.94113
DOI: 10.1007/978-3-030-56784-2_27
author: Ran Canetti
author: Sunoo Park
author: Oxana Poburinnaya
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614559
zbMATH Keywords: deniable communication
MaRDI profile type: Publication
full work available at URL: 978-3-030-56784-2 27
OpenAlex ID: W2913060025
cites work: Deniable Attribute Based Encryption for Branching Programs from LWE
cites work: Lower and Upper Bounds for Deniable Public-Key Encryption
cites work: Perfect Structure on the Edge of Chaos
cites work: Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
cites work: Q4228521
cites work: Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
cites work: Deniable Functional Encryption
cites work: On Minimal Assumptions for Sender-Deniable Public Key Encryption
cites work: New directions in cryptography
cites work: Composability and On-Line Deniability of Authentication
cites work: The edited truth
cites work: Probabilistic encryption
cites work: Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
cites work: Q4409113
cites work: Bi-Deniable Public-Key Encryption
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: How to use indistinguishability obfuscation
description: scientific article; zbMATH DE number 7614559