Mobile Agent Security Using Multilevel Secret Sharing with Changeable Threshold Based on Chinese Remainder Theorem
DOI:
https://doi.org/10.13052/jmm1550-4646.213411Keywords:
Mobile agents, secret share, threshold cryptography, modular arithmetic, chinese remainder theoremAbstract
A novel computational technique known as mobile agent technology, just a little piece of code travels from one place to another. This code can migrate to another computer on the network that has agent functionality enabled and carry out the assigned task there. It is necessary to shield these agents from several risks and weaknesses both during their execution and travel in order to ensure their security. Based on the Chinese remainder theorem, the suggested approach involves multilevel secret sharing with a threshold that may be changed to secure mobile agents. One important aspect of this technique is that shareholders are arranged in a hierarchical or multilayer framework, with each owner requiring only one hidden private share because it will enable us to have smaller share sizes, making the process of transferring them easier and the complexity of recovery lower. This is a sample input file. Comparing it with the output it generates can show you how to produce a simple document of your own.
Downloads
References
S. S. Srivastava and G. C. Nandi, “Self-reliant mobile code: A new direction of agent security,” J. Netw. Comput. Appl., vol. 37, no. 1, pp. 62–75, 2014, doi: 10.1016/j.jnca.2013.01.004.
V. Attasena, J. Darmont, and N. Harbi, “Secret sharing for cloud data security: a survey,” VLDB J., vol. 26, no. 5, pp. 657–681, 2017, doi: 10.1007/s00778-017-0470-9.
L. Harn and M. Fuyou, “Multilevel threshold secret sharing based on the Chinese Remainder Theorem,” Inf. Process. Lett., vol. 114, no. 9, pp. 504–509, 2014, doi: 10.1016/j.ipl.2014.04.006.
K. Meng, F. Miao, W. Huang, and Y. Xiong, “Tightly coupled multi-group threshold secret sharing based on Chinese Remainder Theorem,” Discret. Appl. Math., vol. 268, pp. 152–163, 2019, doi: 10.1016/j.dam.2019.05.011.
W. Jansen and T. Karygiannis, “NIST Special Publication 800-19 – Mobile Agent Security Computer,” Nist Spec. Publ., vol. 323, no. September, pp. 3–10, 1999.
J. Zhao, J. Zhang, and R. Zhao, “A practical verifiable multi-secret sharing scheme,” Comput. Stand. Interfaces, vol. 29, no. 1, pp. 138–141, 2007, doi: 10.1016/j.csi.2006.02.004.
O. P. Verma, N. Jain, and S. K. Pal, “A Hybrid-Based Verifiable Secret Sharing Scheme Using Chinese Remainder Theorem,” Arab. J. Sci. Eng., vol. 45, no. 4, pp. 2395–2406, 2020, doi: 10.1007/s13369-019-03992-7.
P. Bagga and R. Hans, “Mobile Agents System Security,” ACM Comput. Surv., vol. 50, no. 5, pp. 1–45, 2017, doi: 10.1145/3095797.
Kumar P, Banerjee K, Singhal N, Kumar A, Rani S, Kumar R, Lavinia CA. Verifiable, Secure Mobile Agent Migration in Healthcare Systems Using a Polynomial-Based Threshold Secret Sharing Scheme with a Blowfish Algorithm. Sensors. 2022; 22(22):8620. https://doi.org/10.3390/s22228620.
Samet, D., Ktata, F.B. and Ghedira, K. A security framework for mobile agent systems. Autom Softw Eng 31, 12 (2024). https://doi.org/10.1007/s10515-023-00408-7.
Chattopadhyay, T., Prasad, G. Mobile Agent Security Against Malicious Hosts: A Survey. SN COMPUT. SCI. 3, 160 (2022). https://doi.org/10.1007/s42979-021-01004-w.
Kumar, P., Singhal, N. “An Optimized Authentication Mechanism for Mobile Agents by Using Machine Learning” I. J. Computer Network and Information Security, 2023, 6, 30–39, Volume 15 (2023), Issue 6, doi: 10.5815/ijcnis.2023.06.03.
Kumar, P., Singhal, N. “An Enhanced Method Utilizing Hopfield Neural Model for Mobile Agent Protection”, Volume 13 (2023), Issue 5, doi: 10.5815/ijwmt.2023.05.03.
