KDM Security IBE Based on LWE beyond Affine Functions

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