Toward fine-grained blackbox separations between semantic and circular-security notions

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

scientific article; zbMATH DE number 1303133 (Why is no real title available?)
scientific article; zbMATH DE number 819814 (Why is no real title available?)
scientific article; zbMATH DE number 4185033 (Why is no real title available?)
Advances in Cryptology – CRYPTO 2004
Advances in cryptology -- CRYPTO 2016. 36th annual international cryptology conference, Santa Barbara, CA, USA, August 14--18, 2016. Proceedings. Part II
Bit Encryption Is Complete
Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
Black-box constructions for secure computation
Bounded KDM security from iO and OWF
Chosen-ciphertext security via correlated products
Circular Security Separations for Arbitrary Length Cycles from LWE
Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
Circular-Secure Encryption from Decision Diffie-Hellman
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
Efficient circuit-size independent public key encryption with KDM security
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Fully homomorphic encryption over the integers
Fully homomorphic encryption using ideal lattices
KDM-security via homomorphic smooth projective hashing
Key-dependent message security: generic amplification and completeness
Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
Limits on the power of indistinguishability obfuscation and functional encryption
New circular security counterexamples from decision linear and learning with errors
New definitions and separations for circular security
Notions of black-box reductions, revisited
Obfuscation of probabilistic circuits and applications
On generic constructions of circularly-secure, leakage-resilient public-key encryption schemes
On the (Im)Possibility of Key Dependent Encryption
On the circular security of bit-encryption
On the power of hierarchical identity-based encryption
Reproducible circularly-secure bit encryption: applications and realizations
The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
Theory of Cryptography
Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
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

(9)

Reproducible circularly-secure bit encryption: applications and realizations
Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
On the circular security of bit-encryption
Reproducible circularly secure bit encryption: applications and realizations
Separations in circular security for arbitrary length key cycles
Obfuscation \(\Rightarrow\) (IND-CPA security \(\nRightarrow\) circular security)
Counterexamples to new circular security assumptions underlying iO
KDM security for identity-based encryption: constructions and separations
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)