Bi-Deniable Public-Key Encryption

DOI10.1007/978-3-642-22792-9_30zbMath1290.94113MaRDI QIDQ5199211

Chris Peikert, Brent Waters, Adam O'Neill

Publication date: 12 August 2011

Published in: Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22792-9_30

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Deniability of Symmetric Encryption Based on Computational Indistinguishability from Probabilistic Ciphering, Constraining Pseudorandom Functions Privately, Adaptively secure MPC with sublinear communication complexity, Explainable arguments, Efficient laconic cryptography from learning with errors, Simulation-based bi-selective opening security for public key encryption, A new approach to efficient non-malleable zero-knowledge, Toward practical lattice-based proof of knowledge from Hint-MLWE, Hardness of \(k\)-LWE and applications in traitor tracing, An improved algorithm for learning sparse parities in the presence of noise, Unbounded multi-party computation from learning with errors, Shorter lattice-based zero-knowledge proofs via one-time commitments, On selective-opening security of deterministic primitives, Fully deniable interactive encryption, Deniable fully homomorphic encryption from learning with errors, Deniable searchable symmetric encryption, A new Gaussian sampling for trapdoor lattices with arbitrary modulus, Worst-case to average-case reductions for module lattices, A new framework for deniable secure key exchange, On the Hardness of Learning with Rounding over Small Modulus, Fully Secure Functional Encryption for Inner Products, from Standard Assumptions, The Geometry of Lattice Cryptography, Deniable Attribute Based Encryption for Branching Programs from LWE