Lower and upper bounds for deniable public-key encryption

DOI10.1007/978-3-642-25385-0_7MaRDI QIDQ3102181zbMATH OpenOpenAlexFDO

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

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)

Recommendations

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

Cited in

(18)

• Нижние оценки для практической секретности ключа
• Deniable Attribute Based Encryption for Branching Programs from LWE
• Subverting deniability
• Deniable fully homomorphic encryption from learning with errors
• Explainable arguments
• scientific article; zbMATH DE number 6862149 (Why is no real title available?)
• Practical method for bi-deniable public-key encryption
• A counterexample to the chain rule for conditional HILL entropy
• New Practical Public-Key Deniable Encryption
• Lower bounds on the degree of block ciphers
• Incompressible cryptography
• On selective-opening security of deterministic primitives
• Bi-deniable public-key encryption
• On minimal assumptions for sender-deniable public key encryption
• Deniable encryption with negligible detection probability: an interactive construction
• Disappearing cryptography in the bounded storage model
• Fully deniable interactive encryption
• Deniable cryptosystems: simpler constructions and achieving leakage resilience

This page was built for publication: Lower and upper bounds for deniable public-key encryption

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