Download pdf
A Multi-Authority RSA Broadcast Encryption Scheme Based on Modulus Ni
- 1 School of International Business, Chengdu Institute Sichuan International Studies University, Chengdu, China, 611844
* Author to whom correspondence should be addressed.
Abstract
With the development of network technology, multicast and broadcast communications have gradually replaced unicast communication. Traditional RSA encryption is no longer suitable for many network applications, such as scenarios where multiple users with different privilege levels access paid content. This paper demonstrates the limitations of the key management protocol proposed by Lin in 2004 under a multi-privilege user system and redefines the algorithm for generating the modulus N_i, achieving a hierarchical division of privilege levels. Based on this key management protocol, a new multi-privilege RSA broadcast encryption scheme is proposed, addressing the limitations of traditional RSA encryption in one-to-many communication scenarios and taking into account the different privilege levels of users. This scheme allows high-privilege users to decrypt more information, while low-privilege users decrypt less information, adapting to the needs of practical applications. By dynamically dividing user privilege levels and distributing private keys of different decryption levels accordingly, the system enables dynamic user addition and removal, enhancing the scalability and flexibility of the system. This expands the application scenarios of RSA encryption while increasing its security and practicality.
Keywords
Privilege level division, broadcast encryption, key management protocol
[1]. Sakai, R., & Furukawa, J. (2007). Identity-based broadcast encryption. Cryptology ePrint Archive.
[2]. Berkovits, S. (1991, April). How to broadcast a secret. In Workshop on the Theory and Application of of Cryptographic Techniques (pp. 535-541). Berlin, Heidelberg: Springer Berlin Heidelberg.
[3]. Eskeland, S. (2022). Collusion-resistant broadcast encryption based on hidden RSA subgroups. In Proceedings of the 19th International Conference on Security and Cryptography.
[4]. Baee, M. A. R., Simpson, L., Boyen, X., Foo, E., & Pieprzyk, J. (2022). ALI: Anonymous lightweight inter-vehicle broadcast authentication with encryption. IEEE Transactions on Dependable and Secure Computing, 20(3), 1799-1817.
[5]. Chinnala Balakrishna, D. T. H. (2020). CONTRIBUTORY BROADCAST ENCRYPTION WITH EFFICIENT ENCRYPTION AND SHORT CIPHER TEXTS.
[6]. Srivastava, V., Debnath, S. K., Stanica, P., & Pal, S. K. (2023). A multivariate identity-based broadcast encryption with applications to the internet of things. Adv. Math. Commun., 17(6), 1302-1313.
[7]. Rabaninejad, R., Ameri, M. H., Delavar, M., & Mohajeri, J. (2019). An attribute-based anonymous broadcast encryption scheme with adaptive security in the standard model. Scientia Iranica, 26(3), 1700-1713.
[8]. Dupin, A., & Abelard, S. (2024). Broadcast Encryption using Sum-Product decomposition of Boolean functions. Cryptology ePrint Archive.
[9]. Lin Guoqing, Li Ying & Wang Xinmei. (2008). RSA-based broadcast encryption scheme. Journal of Southeast University(Natural Science Edition) (S1), 86-89.
[10]. Li Xiaofeng, Lu Jianzhu & Wang Meng. (2006). A new scheme for broadcast encryption based on RSA. Microcomputer Information (09), 59-60.
Cite this article
Hu,L. (2024). A Multi-Authority RSA Broadcast Encryption Scheme Based on Modulus Ni. Applied and Computational Engineering,114,73-79.
Data availability
The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.
Disclaimer/Publisher's Note
The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
About volume
Volume title: Proceedings of the 2nd International Conference on Machine Learning and Automation
© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and
conditions of the Creative Commons Attribution (CC BY) license. Authors who
publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons
Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this
series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published
version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial
publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and
during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See
Open access policy for details).