Affiliation:
1. School of Computer and Electronic Information, Guangxi University, Nanning 530004, China
Abstract
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.
Funder
National Natural Science Foundation of China
Guangxi Innovation-Driven Development Project
Subject
Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science
Reference23 articles.
1. Probabilistic encryption;Goldwasser;J. Comput. Syst. Sci.,1984
2. Alperin-Sheriff, J., and Peikert, C. (2012, January 21–23). Circular and KDM security for identity-based encryption. Proceedings of the Public Key Cryptography–PKC 2012: 15th International Conference on Practice and Theory in Public Key Cryptography, Darmstadt, Germany. Proceedings 15.
3. Black, J., Rogaway, P., and Shrimpton, T. (2002, January 15–16). Encryption-scheme security in the presence of key-dependent messages. Proceedings of the Selected Areas in Cryptography: 9th Annual International Workshop, SAC 2002, St. John’s, NL, Canada.
4. Camenisch, J., Chandran, N., and Shoup, V. (2009, January 26–30). A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks. Proceedings of the Advances in Cryptology-EUROCRYPT 2009: 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany. Proceedings 28.
5. Brakerski, Z., and Vaikuntanathan, V. (2011, January 14–18). Fully homomorphic encryption from ring-LWE and security for key dependent messages. Proceedings of the Advances in Cryptology–CRYPTO 2011: 31st Annual Cryptology Conference, Santa Barbara, CA, USA. Proceedings 31.