Bounded Key-Dependent Message Security

DOI10.1007/978-3-642-13190-5_22zbMath1280.94038OpenAlexW2101479224MaRDI QIDQ3563848

Iftach Haitner, Yuval Ishai, Dennis Hofheinz, Boaz Barak

Publication date: 1 June 2010

Published in: Advances in Cryptology – EUROCRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13190-5_22

zbMATH Keywords

fully homomorphic encryptionformal securityKDM/clique/circular security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (34)

Master-Key KDM-Secure IBE from Pairings ⋮ The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ The KDM-CCA Security of REACT ⋮ Reproducible Circularly-Secure Bit Encryption: Applications and Realizations ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ CPA-to-CCA transformation for KDM security ⋮ Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions ⋮ 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 ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ Circular security is complete for KDM security ⋮ Updatable public key encryption in the standard model ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ Candidate iO from homomorphic encryption schemes ⋮ Completeness of Single-Bit Projection-KDM Security for Public Key Encryption ⋮ Key-dependent message security: generic amplification and completeness ⋮ On the power of secure two-party computation ⋮ Candidate iO from homomorphic encryption schemes ⋮ The Geometry of Lattice Cryptography ⋮ 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 ⋮ Bounded KDM Security from iO and OWF ⋮ On the Power of Secure Two-Party Computation ⋮ 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: Bounded Key-Dependent Message Security