Key-Dependent Message Security: Generic Amplification and Completeness
From MaRDI portal
Publication:3003401
DOI10.1007/978-3-642-20465-4_29zbMath1291.94048OpenAlexW1557092587MaRDI QIDQ3003401
Publication date: 27 May 2011
Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_29
Related Items (23)
The key-dependent message security of key-alternating Feistel ciphers ⋮ Master-Key KDM-Secure IBE from Pairings ⋮ The KDM-CCA Security of REACT ⋮ Reproducible Circularly-Secure Bit Encryption: Applications and Realizations ⋮ Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ CPA-to-CCA transformation for KDM security ⋮ Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Universal amplification of KDM security: from 1-key circular to multi-key KDM ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ Circular security is complete for KDM security ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ Key-Dependent Message Security for Division Function: Discouraging Anonymous Credential Sharing ⋮ Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks ⋮ Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE ⋮ Circular Security Separations for Arbitrary Length Cycles from LWE ⋮ Adaptively Secure Garbled Circuits from One-Way Functions ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption
This page was built for publication: Key-Dependent Message Security: Generic Amplification and Completeness
