Universal amplification of KDM security: from 1-key circular to multi-key KDM

DOI10.1007/978-3-031-38545-2_22OpenAlexW4385654509MaRDI QIDQ6145929

Daniel Wichs, Brent Waters

Publication date: 2 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38545-2_22

zbMATH Keywords

public-key encryption schemekey dependent message encryption schemesymmetric-key bit-encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• One way functions and pseudorandom generators
• Anonymous IBE, leakage resilience and circular security from new assumptions
• Identity-based encryption from the Diffie-Hellman assumption
• Laconic oblivious transfer and its applications
• Key dependent message security and receiver selective opening security for identity-based encryption
• On perfect correctness in (lockable) obfuscation
• CPA-to-CCA transformation for KDM security
• New constructions of reusable designated-verifier NIZKs
• Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
• Circular security is complete for KDM security
• New Circular Security Counterexamples from Decision Linear and Learning with Errors
• Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
• Circular Security Separations for Arbitrary Length Cycles from LWE
• New Definitions and Separations for Circular Security
• Black-Box Circular-Secure Encryption beyond Affine Functions
• Key-Dependent Message Security: Generic Amplification and Completeness
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Reproducible Circularly-Secure Bit Encryption: Applications and Realizations
• Cryptographic Agility and Its Relation to Circular Encryption
• Bounded Key-Dependent Message Security
• Circular-Secure Encryption from Decision Diffie-Hellman
• On the Circular Security of Bit-Encryption
• Separations in Circular Security for Arbitrary Length Key Cycles
• 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
• CCA security and trapdoor functions via key-dependent-message security

This page was built for publication: Universal amplification of KDM security: from 1-key circular to multi-key KDM