Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes

Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny

Published Jan 1, 2018• 53 citations
Publisher
DOI
10.1007/978-3-319-76578-5_1

Related papers

Key Dependent Message Security for Revocable Identity-Based Encryption and Identity-Based Encryption

Rui Zhang, Yang Tao

Lecture notes in computer science•Jan 1, 2018•1 citation

Key Dependent Message Security and Receiver Selective Opening Security for Identity-Based Encryption

Fuyuki Kitagawa, Keisuke Tanaka

Lecture notes in computer science•Jan 1, 2018•16 citations

Identity-Based Encryption with Master Key-Dependent Message Security and Leakage-Resilience

David Galindo, Javier Herranz, Jorge Luis Villar

Lecture notes in computer science•Jan 1, 2012•40 citations

KDM and Selective Opening Secure IBE Based on the LWE Problem

Jingnan He, Bao Li, Xianhui Lu +2 more

Based on the learning with errors (LWE) problem, we construct an identity-based encryption (IBE) scheme in the standard-model which is secure against the key dependent message (KDM) attacks and the selective opening (SO) attacks. KDM security, which requires that the scheme can still obtain secrecy even if the messages depend on the secret key, is necessary for IBE when updating the identity secret keys with the old ones. SO security, which requires that when the adversary corrupts some fraction of senders, the uncorrupted senders' messages still maintain privacy, is useful for IBE since that one user receives messages from many senders is a natural scenario. Although there is a KDM secure IBE scheme based on LWE constructed by Alperin-Sheriff and Peikert (PKC'12), and a SO secure IBE scheme based on LWE constructed by He et al. (IWSEC'15), those two schemes cannot achieve both of the security requirements at the same time.

•Mar 31, 2017•3 citations

KDM Security IBE Based on LWE beyond Affine Functions

Yuchen Lian, Ruwei Huang

Key-dependent message (KDM) security identity-based encryption (IBE) schemes aim to solve the security risks caused by the dependency between plaintext and secret keys in traditional IBE schemes. However, current KDM-IBE schemes are only secure with respect to affine functions, which limits their security level when a message is derived from the evaluation of a polynomial function using the secret key. To address this issue, in this study, we propose a novel approach to construct a KDM-IBE scheme with respect to polynomial or even arbitrary functions that achieves maximum security based on the learning with errors (LWE) assumption. Our approach overcomes two major technical barriers to constructing KDM-IBE schemes with respect to polynomial functions. Compared to existing KDM-IBE schemes, our proposed scheme ensures the secrecy of the key-related plaintext, even when it is obtained using arbitrary functions, not just affine functions. Thus, our approach provides a more robust solution to the security risks inherent in traditional IBE schemes.

Applied Sciences•Jul 17, 2023•0 citations

Relations Among Notions of Security for Identity Based Encryption Schemes

Nuttapong Attrapadung, Yang Cui, David Galindo +6 more

Lecture notes in computer science•Jan 1, 2006•15 citations
Based on the learning with errors (LWE) problem, we construct an identity-based encryption (IBE) scheme in the standard-model which is secure against the key dependent message (KDM) attacks and the selective opening (SO) attacks. KDM security, which requires that the scheme can still obtain secrecy even if the messages depend on the secret key, is necessary for IBE when updating the identity secret keys with the old ones. SO security, which requires that when the adversary corrupts some fraction of senders, the uncorrupted senders' messages still maintain privacy, is useful for IBE since that one user receives messages from many senders is a natural scenario. Although there is a KDM secure IBE scheme based on LWE constructed by Alperin-Sheriff and Peikert (PKC'12), and a SO secure IBE scheme based on LWE constructed by He et al. (IWSEC'15), those two schemes cannot achieve both of the security requirements at the same time.
Key-dependent message (KDM) security identity-based encryption (IBE) schemes aim to solve the security risks caused by the dependency between plaintext and secret keys in traditional IBE schemes. However, current KDM-IBE schemes are only secure with respect to affine functions, which limits their security level when a message is derived from the evaluation of a polynomial function using the secret key. To address this issue, in this study, we propose a novel approach to construct a KDM-IBE scheme with respect to polynomial or even arbitrary functions that achieves maximum security based on the learning with errors (LWE) assumption. Our approach overcomes two major technical barriers to constructing KDM-IBE schemes with respect to polynomial functions. Compared to existing KDM-IBE schemes, our proposed scheme ensures the secrecy of the key-related plaintext, even when it is obtained using arbitrary functions, not just affine functions. Thus, our approach provides a more robust solution to the security risks inherent in traditional IBE schemes.