Lower and Upper Bounds for Deniable Public-Key Encryption

DOI10.1007/978-3-642-25385-0_7zbMath1227.94029OpenAlexW131568003MaRDI QIDQ3102181

Jesper Buus Nielsen, Rikke Bendlin, Claudio Orlandi, Peter Sebastian Nordholt

Publication date: 2 December 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25385-0_7

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

Deniable fully homomorphic encryption from learning with errors ⋮ Deniable Attribute Based Encryption for Branching Programs from LWE ⋮ A counterexample to the chain rule for conditional HILL entropy ⋮ Incompressible cryptography ⋮ Explainable arguments ⋮ Disappearing cryptography in the bounded storage model ⋮ On selective-opening security of deterministic primitives ⋮ Fully deniable interactive encryption

This page was built for publication: Lower and Upper Bounds for Deniable Public-Key Encryption