Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions
From MaRDI portal
Publication:5267418
DOI10.1007/978-3-319-56614-6_19zbMath1415.94437OpenAlexW2604090549MaRDI QIDQ5267418
Bruce M. Kapron, Mohammad Hajiabadi
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_19
Related Items
Circular security is complete for KDM security, KDM security for identity-based encryption: constructions and separations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Key-dependent message security: generic amplification and completeness
- Advances in cryptology -- CRYPTO 2016. 36th annual international cryptology conference, Santa Barbara, CA, USA, August 14--18, 2016. Proceedings. Part II
- New Circular Security Counterexamples from Decision Linear and Learning with Errors
- On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes
- KDM-Security via Homomorphic Smooth Projective Hashing
- Bounded KDM Security from iO and OWF
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Notions of Black-Box Reductions, Revisited
- New Definitions and Separations for Circular Security
- The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives
- Black-box constructions for secure computation
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- Efficient Circuit-Size Independent Public Key Encryption with KDM Security
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
- 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
- Reproducible Circularly-Secure Bit Encryption: Applications and Realizations
- Fully Homomorphic Encryption over the Integers
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Towards a Separation of Semantic and CCA Security for Public Key Encryption
- Circular-Secure Encryption from Decision Diffie-Hellman
- On the (Im)Possibility of Key Dependent Encryption
- On the Circular Security of Bit-Encryption
- Bit Encryption Is Complete
- Fully homomorphic encryption using ideal lattices
- Obfuscation of Probabilistic Circuits and Applications
- Advances in Cryptology – CRYPTO 2004
- Chosen-Ciphertext Security via Correlated Products
- Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- On the Power of Hierarchical Identity-Based Encryption
- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Theory of Cryptography
