Bit Encryption Is Complete
From MaRDI portal
Publication:5171223
DOI10.1109/FOCS.2009.65zbMath1292.94119MaRDI QIDQ5171223
Publication date: 25 July 2014
Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (13)
Upgrading to functional encryption ⋮ Improved, black-box, non-malleable encryption from semantic security ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ A black-box construction of non-malleable encryption from semantically secure encryption ⋮ Sender-Equivocable Encryption Schemes Secure against Chosen-Ciphertext Attacks Revisited ⋮ Toward an Easy-to-Understand Structure for Achieving Chosen Ciphertext Security from the Decisional Diffie-Hellman Assumption ⋮ Completeness of Single-Bit Projection-KDM Security for Public Key Encryption ⋮ Non-Malleable Encryption: Simpler, Shorter, Stronger ⋮ Information-Theoretic Local Non-malleable Codes and Their Applications ⋮ Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited ⋮ How to Use Indistinguishability Obfuscation: Deniable Encryption, and More ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions
This page was built for publication: Bit Encryption Is Complete
