Reproducible Circularly-Secure Bit Encryption: Applications and Realizations
From MaRDI portal
Publication:3457112
DOI10.1007/978-3-662-47989-6_11zbMath1375.94132OpenAlexW1467237292MaRDI QIDQ3457112
Mohammad Hajiabadi, Bruce M. Kapron
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-47989-6_11
trapdoor functionsdeterministic encryption(non-)shielding CCA constructioncircular securitycorrelated-input security
Related Items (5)
CPA-to-CCA transformation for KDM security ⋮ Universal amplification of KDM security: from 1-key circular to multi-key KDM ⋮ Circular security is complete for KDM security ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions
Cites Work
- Lossy trapdoor functions from homomorphic reproducible encryption
- Advances in cryptology -- CRYPTO 2008. 28th annual international cryptology conference, Santa Barbara, CA, USA, August 17--21, 2008. Proceedings
- Randomness is linear in space
- More constructions of lossy and correlation-secure trapdoor functions
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
- Black-Box Circular-Secure Encryption beyond Affine Functions
- Efficient Circuit-Size Independent Public Key Encryption with KDM Security
- Key-Dependent Message Security: Generic Amplification and Completeness
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
- Bounded Key-Dependent Message Security
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Towards a Separation of Semantic and CCA Security for Public Key Encryption
- Deterministic and Efficiently Searchable Encryption
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Randomness Re-use in Multi-recipient Encryption Schemeas
- On the Circular Security of Bit-Encryption
- Randomness-Dependent Message Security
- Chosen-Ciphertext Security via Correlated Products
- Chosen‐Ciphertext Security from Identity‐Based Encryption
This page was built for publication: Reproducible Circularly-Secure Bit Encryption: Applications and Realizations
