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

DOI10.1007/978-3-319-56614-6_19zbMATH Open1415.94437OpenAlexW2604090549MaRDI QIDQ5267418FDOQ5267418

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

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

Mathematics Subject Classification ID

Cryptography (94A60)

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 (3)

• KDM security for identity-based encryption: constructions and separations
• Counterexamples to new circular security assumptions underlying iO
• 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)