Toward fine-grained blackbox separations between semantic and circular-security notions
From MaRDI portal
Publication:5267418
DOI10.1007/978-3-319-56614-6_19zbMATH Open1415.94437OpenAlexW2604090549MaRDI QIDQ5267418FDOQ5267418
Authors: Mohammad Hajiabadi, Bruce M. Kapron
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
Recommendations
- Separations in circular security for arbitrary length key cycles
- On the circular security of bit-encryption
- Obfuscation \(\Rightarrow\) (IND-CPA security \(\nRightarrow\) circular security)
- Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
Cites Work
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Circular-Secure Encryption from Decision Diffie-Hellman
- Title not available (Why is that?)
- Theory of Cryptography
- On the (Im)Possibility of Key Dependent Encryption
- KDM-security via homomorphic smooth projective hashing
- Advances in Cryptology – CRYPTO 2004
- The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
- On the circular security of bit-encryption
- Towards a Separation of Semantic and CCA Security for Public Key Encryption
- Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Bit Encryption Is Complete
- Key-dependent message security: generic amplification and completeness
- Obfuscation of probabilistic circuits and applications
- Black-box constructions for secure computation
- Notions of black-box reductions, revisited
- Limits on the power of indistinguishability obfuscation and functional encryption
- Two is a crowd? A black-box separation of one-wayness and security under correlated inputs
- On the power of hierarchical identity-based encryption
- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- Efficient circuit-size independent public key encryption with KDM security
- Chosen-ciphertext security via correlated products
- New definitions and separations for circular security
- New circular security counterexamples from decision linear and learning with errors
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Reproducible circularly-secure bit encryption: applications and realizations
- Advances in cryptology -- CRYPTO 2016. 36th annual international cryptology conference, Santa Barbara, CA, USA, August 14--18, 2016. Proceedings. Part II
- On generic constructions of circularly-secure, leakage-resilient public-key encryption schemes
- Bounded KDM security from iO and OWF
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
Cited In (9)
- KDM security for identity-based encryption: constructions and separations
- On the circular security of bit-encryption
- Counterexamples to new circular security assumptions underlying iO
- Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
- Obfuscation \(\Rightarrow\) (IND-CPA security \(\nRightarrow\) circular security)
- Reproducible circularly-secure bit encryption: applications and realizations
- Separations in circular security for arbitrary length key cycles
- Reproducible circularly secure bit encryption: applications and realizations
- Circular security is complete for KDM security
This page was built for publication: Toward fine-grained blackbox separations between semantic and circular-security notions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267418)