Key-Dependent Message Security for Division Function: Discouraging Anonymous Credential Sharing

DOI10.1007/978-3-642-24316-5_21zbMath1298.94096OpenAlexW178401393MaRDI QIDQ3092366

Haixia Xu, Bao Li, Qixiang Mei, Xianhui Lu

Publication date: 16 September 2011

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24316-5_21

zbMATH Keywords

Public-key encryptionkey-dependent message securitydecisional Diffie-Hellman assumption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Black-Box Circular-Secure Encryption beyond Affine Functions
• Efficient Circuit-Size Independent Public Key Encryption with KDM Security
• Key-Dependent Message Security: Generic Amplification and Completeness
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• 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
• The Notion of Security for Probabilistic Cryptosystems
• Authenticated and Misuse-Resistant Encryption of Key-Dependent Data
• 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