Completeness of single-bit projection-KDM security for public key encryption
From MaRDI portal
Recommendations
Cites work
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Bit Encryption Is Complete
- Black-box circular-secure encryption beyond affine functions
- Bounded key-dependent message security
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Circular chosen-ciphertext security with compact ciphertexts
- Circular-Secure Encryption from Decision Diffie-Hellman
- Detecting dangerous queries: a new approach for chosen ciphertext security
- Efficient circuit-size independent public key encryption with KDM security
- Efficient key dependent message security amplification against chosen ciphertext attacks
- Efficient noninteractive proof systems for bilinear groups
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- scientific article; zbMATH DE number 1302836 (Why is no real title available?)
- scientific article; zbMATH DE number 1951605 (Why is no real title available?)
- KDM security in the hybrid framework
- Key-dependent message security: generic amplification and completeness
- OAEP Is Secure under Key-Dependent Messages
Cited in
(5)
This page was built for publication: Completeness of single-bit projection-KDM security for public key encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2790040)