Bi-deniable public-key encryption

DOI10.1007/978-3-642-22792-9_30MaRDI QIDQ5199211zbMATH OpenOpenAlexFDO

Authors Adam O'Neill, Chris Peikert, Brent Waters

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

Cryptography (94A60)

Recommendations

• Lower and upper bounds for deniable public-key encryption
• Deniable encryption with negligible detection probability: an interactive construction
• New Practical Public-Key Deniable Encryption
• Fully deniable interactive encryption
• scientific article; zbMATH DE number 1088228

Cited in

(36)

• 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
• Bi-deniable public-key encryption protocol which is secure against active coercive adversary
• Deniable encryption with negligible detection probability: an interactive construction
• The geometry of lattice cryptography
• Lower and upper bounds for deniable public-key encryption
• Deniable Attribute Based Encryption for Branching Programs from LWE
• Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
• scientific article; zbMATH DE number 1088228 (Why is no real title available?)
• Deniability of symmetric encryption based on computational indistinguishability from probabilistic ciphering
• Practical method for bi-deniable public-key encryption
• On minimal assumptions for sender-deniable public key encryption
• 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
• New Practical Public-Key Deniable Encryption
• Deniable cryptosystems: simpler constructions and achieving leakage resilience
• Efficient updatable public-key encryption from lattices
• Ring/module learning with errors under linear leakage -- hardness and applications
• Snake-eye resistant PKE from LWE for oblivious message retrieval and robust encryption
• Deny whatever you want: dual-deniable public-key encryption

This page was built for publication: Bi-deniable public-key encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199211)