On the (Im)Possibility of Key Dependent Encryption
From MaRDI portal
Publication:3611767
DOI10.1007/978-3-642-00457-5_13zbMath1213.94105OpenAlexW1493465382MaRDI QIDQ3611767
Iftach Haitner, Thomas Holenstein
Publication date: 3 March 2009
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00457-5_13
Related Items
The KDM-CCA Security of REACT ⋮ Memory lower bounds of reductions revisited ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ Cliptography: Clipping the Power of Kleptographic Attacks ⋮ Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model ⋮ Security of message authentication codes in the presence of key-dependent messages ⋮ Constructive post-quantum reductions ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Possibility and impossibility results for selective decommitments ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ Clever Arbiters Versus Malicious Adversaries ⋮ Constructing tree decompositions of graphs with bounded gonality ⋮ Key-dependent message security: generic amplification and completeness ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks ⋮ On strong simulation and composable point obfuscation ⋮ Key-Dependent Message Security for Division Function: Discouraging Anonymous Credential Sharing ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Bounded KDM Security from iO and OWF ⋮ On Symmetric Encryption and Point Obfuscation ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ Leakage-resilient key exchange and two-seed extractors ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions ⋮ Hardness of LWE on general entropic distributions
This page was built for publication: On the (Im)Possibility of Key Dependent Encryption
