Reproducible circularly secure bit encryption: applications and realizations
From MaRDI portal
Recommendations
- Reproducible circularly-secure bit encryption: applications and realizations
- On the circular security of bit-encryption
- Toward fine-grained blackbox separations between semantic and circular-security notions
- Circular-Secure Encryption from Decision Diffie-Hellman
- On generic constructions of circularly-secure, leakage-resilient public-key encryption schemes
Cites work
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 1951605 (Why is no real title available?)
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- Advances in cryptology -- CRYPTO 2008. 28th annual international cryptology conference, Santa Barbara, CA, USA, August 17--21, 2008. Proceedings
- Better security for deterministic public-key encryption: the auxiliary-input setting
- Bit Encryption Is Complete
- Black-box circular-secure encryption beyond affine functions
- Bounded key-dependent message security
- Building lossy trapdoor functions from lossy encryption
- Chosen-ciphertext security via correlated products
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Circular chosen-ciphertext security with compact ciphertexts
- Circular-Secure Encryption from Decision Diffie-Hellman
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Deterministic and Efficiently Searchable Encryption
- Dual projective hashing and its applications -- lossy trapdoor functions and more
- Efficient circuit-size independent public key encryption with KDM security
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Key-dependent message security: generic amplification and completeness
- Lossy Trapdoor Functions and Their Applications
- Lossy trapdoor functions from homomorphic reproducible encryption
- More constructions of lossy and correlation-secure trapdoor functions
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- On the circular security of bit-encryption
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Public-key cryptosystems resilient to key leakage
- Public-key encryption schemes with auxiliary inputs
- Randomness Re-use in Multi-recipient Encryption Schemeas
- Randomness is linear in space
- Randomness-dependent message security
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- Theory of Cryptography
- Theory of cryptography. 7th theory of cryptography conference, TCC 2010, Zurich, Switzerland, February 9--11, 2010. Proceedings
- Towards a Separation of Semantic and CCA Security for Public Key Encryption
- Two is a crowd? A black-box separation of one-wayness and security under correlated inputs
Cited in
(7)- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Circular-Secure Encryption from Decision Diffie-Hellman
- Cryptographic primitives with hinting property
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Reproducible circularly-secure bit encryption: applications and realizations
- Cryptographic primitives with hinting property
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
This page was built for publication: Reproducible circularly secure bit encryption: applications and realizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1698399)
