Key-dependent message security: generic amplification and completeness
From MaRDI portal
Recommendations
- Key-dependent message security: generic amplification and completeness
- Efficient key dependent message security amplification against chosen ciphertext attacks
- Circular security is complete for KDM security
- Bounded key-dependent message security
- Towards Key-Dependent Message Security in the Standard Model
Cites work
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1951605 (Why is no real title available?)
- scientific article; zbMATH DE number 2009982 (Why is no real title available?)
- scientific article; zbMATH DE number 1759457 (Why is no real title available?)
- scientific article; zbMATH DE number 2086626 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Black-box circular-secure encryption beyond affine functions
- Bounded key-dependent message security
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Circular-Secure Encryption from Decision Diffie-Hellman
- Computationally private randomizing polynomials and their applications
- Computing Blindfolded: New Developments in Fully Homomorphic Encryption
- Cryptographic agility and its relation to circular encryption
- Cryptography in $NC^0$
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Foundations of Cryptography
- Foundations of Cryptography
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Fully homomorphic encryption using ideal lattices
- OAEP Is Secure under Key-Dependent Messages
- On arithmetic branching programs
- On the (Im)Possibility of Key Dependent Encryption
- Probabilistic encryption
- Towards Key-Dependent Message Security in the Standard Model
Cited in
(27)- Key-dependent message security: generic amplification and completeness
- Cryptographic primitives with hinting property
- Universal amplification of KDM security: from 1-key circular to multi-key KDM
- Efficient key dependent message security amplification against chosen ciphertext attacks
- Towards Key-Dependent Message Security in the Standard Model
- Toward fine-grained blackbox separations between semantic and circular-security notions
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Secret key amplification from uniformly leaked key exchange complete graph
- scientific article; zbMATH DE number 1951605 (Why is no real title available?)
- Randomness recoverable secret sharing schemes
- On the Power of Secure Two-Party Computation
- Completeness of single-bit projection-KDM security for public key encryption
- Impossibility of strong KDM security with auxiliary input
- Updatable public key encryption in the standard model
- Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks
- Amplifying the security of functional encryption, unconditionally
- Black-box circular-secure encryption beyond affine functions
- Naor-Yung paradigm with shared randomness and applications
- Cryptographic group actions and applications
- On the power of secure two-party computation
- Reproducible circularly secure bit encryption: applications and realizations
- Circular security is complete for KDM security
- Naor-Yung Paradigm with Shared Randomness and Applications
- Cryptographic primitives with hinting property
- Bounded KDM security from iO and OWF
- scientific article; zbMATH DE number 1302861 (Why is no real title available?)
This page was built for publication: Key-dependent message security: generic amplification and completeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744344)
