Key-dependent message security for division function: discouraging anonymous credential sharing
From MaRDI portal
Recommendations
- Key-dependent message chosen-ciphertext security of the Cramer-Shoup cryptosystem
- scientific article; zbMATH DE number 1951605
- Bounded key-dependent message security
- Efficient circuit-size independent public key encryption with KDM security
- KDM security for identity-based encryption: constructions and separations
Cites work
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Authenticated and misuse-resistant encryption of key-dependent data
- 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
- Efficient circuit-size independent public key encryption with KDM security
- 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 1951605 (Why is no real title available?)
- Key-dependent message security: generic amplification and completeness
- OAEP Is Secure under Key-Dependent Messages
- On the (Im)Possibility of Key Dependent Encryption
- The Notion of Security for Probabilistic Cryptosystems
- Towards Key-Dependent Message Security in the Standard Model
This page was built for publication: Key-dependent message security for division function: discouraging anonymous credential sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092366)