Bit Encryption Is Complete
From MaRDI portal
Recommendations
- A Complete Public-Key Cryptosystem
- Fully Secure Hidden Vector Encryption
- Perfectly Secure Encryption of Individual Sequences
- On the circular security of bit-encryption
- scientific article; zbMATH DE number 549857
- Completely Non-malleable Encryption Revisited
- Completeness of single-bit projection-KDM security for public key encryption
Cited in
(18)- A black-box construction of non-malleable encryption from semantically secure encryption
- Non-malleable encryption: simpler, shorter, stronger
- Bounded CCA2-Secure Encryption
- Toward fine-grained blackbox separations between semantic and circular-security notions
- Upgrading to functional encryption
- Public-key encryption with quantum keys
- Non-malleable encryption: simpler, shorter, stronger
- Improved, black-box, non-malleable encryption from semantic security
- Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited
- Completeness of single-bit projection-KDM security for public key encryption
- On security notions for encryption in a quantum world
- Information-Theoretic Local Non-malleable Codes and Their Applications
- Quantum CCA-secure PKE, revisited
- Quantum CCA-secure PKE, revisited
- Toward an easy-to-understand structure for achieving chosen ciphertext security from the decisional Diffie-Hellman assumption
- Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited
- How to use indistinguishability obfuscation: deniable encryption, and more
- Reproducible circularly secure bit encryption: applications and realizations
This page was built for publication: Bit Encryption Is Complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5171223)
