Key-dependent message security: generic amplification and completeness
From MaRDI portal
Publication:744344
DOI10.1007/s00145-013-9149-6zbMath1302.94033OpenAlexW2082117735MaRDI QIDQ744344
Publication date: 25 September 2014
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-013-9149-6
Related Items (13)
Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Cryptographic primitives with hinting property ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ Cryptographic group actions and applications ⋮ Updatable public key encryption in the standard model ⋮ Completeness of Single-Bit Projection-KDM Security for Public Key Encryption ⋮ On the power of secure two-party computation ⋮ Naor-Yung Paradigm with Shared Randomness and Applications ⋮ Bounded KDM Security from iO and OWF ⋮ On the Power of Secure Two-Party Computation ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions
Cites Work
- Probabilistic encryption
- On arithmetic branching programs
- Computationally private randomizing polynomials and their applications
- Black-Box Circular-Secure Encryption beyond Affine Functions
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Cryptographic Agility and Its Relation to Circular Encryption
- Bounded Key-Dependent Message Security
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Circular-Secure Encryption from Decision Diffie-Hellman
- OAEP Is Secure under Key-Dependent Messages
- On the (Im)Possibility of Key Dependent Encryption
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Foundations of Cryptography
- Foundations of Cryptography
- Fully homomorphic encryption using ideal lattices
- Towards Key-Dependent Message Security in the Standard Model
- Computing Blindfolded: New Developments in Fully Homomorphic Encryption
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Cryptography in $NC^0$
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Key-dependent message security: generic amplification and completeness
