Bounded KDM Security from iO and OWF

DOI10.1007/978-3-319-44618-9_30zbMath1482.94054OpenAlexW2513029270MaRDI QIDQ2827740

Antonio Marcedone, Abhi Shelat, Rafael Pass

Publication date: 21 October 2016

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-44618-9_30

zbMATH Keywords

bounded key-dependent message encryption schemescircularly-secure encryption schemes

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Naor-Yung paradigm with shared randomness and applications ⋮ Generic constructions of master-key KDM secure attribute-based encryption ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Constructing tree decompositions of graphs with bounded gonality ⋮ Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions

Cites Work

• Unnamed Item
• Unnamed Item
• Key-dependent message security: generic amplification and completeness
• Perfect Structure on the Edge of Chaos
• KDM-Security via Homomorphic Smooth Projective Hashing
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
• Circular Security Separations for Arbitrary Length Cycles from LWE
• Obfuscation ⇒ (IND-CPA Security $\not\Rightarrow$ Circular Security)
• Black-Box Circular-Secure Encryption beyond Affine Functions
• 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
• Bounded Key-Dependent Message Security
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Circular-Secure Encryption from Decision Diffie-Hellman
• On the (Im)Possibility of Key Dependent Encryption
• A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
• How to use indistinguishability obfuscation
• Separations in Circular Security for Arbitrary Length Key Cycles
• On Extractability Obfuscation

This page was built for publication: Bounded KDM Security from iO and OWF