Kakoli Banergee

Work place: Department of Computer Science and Engineering, JSS University, Noida, Uttar Pradesh, 201301, India

E-mail: kakoli.banerjee@jssaten.ac.in

Website: https://orcid.org/0000-0002-4306-2194

Research Interests:

Biography

Dr. Kakoli Banerjee is Associate Professor (Computer Science and Engineering Department), JSS Academy of Technical Education, Noida. She graduated from IET, Kanpur – B.Tech (CSE), did her Post Graduation from MNNIT, Allahabad – M.Tech (CSE) and Doctorate (Ph.D) from Shobhit University, Saharanpur. She has 22 years of experience in academics and in industry. She has published around 45 research papers in international journals of repute indexed in SCI, Scopus, ESCI, Google Scholar, and other eminent databases. Currently, she is working for a funded project, sanctioned by the Collaborative Research and Innovation Program (CRIP) under TEQIP- 3 by Dr. A. P. J. Abdul, Kalam Technical University Uttar Pradesh, Lucknow. She is a member of IEEE and other professional societies such as ISTE, CSI, etc. She has been a reviewer and guest editor of several reputed journals and books. She has also served in many conferences as session chair. She has two Granted Patent to my name and eight published. She has developed video content for Dr. A.P.J. Abdul Kalam Technical University, Lucknow and Swayam Prabha Chanel of Government of India for subjects like Operating System and Database Management System. She has published book - & quot; Industry 4.0: Research Trends, Challenges and Future of AI in Data Science & quot;, CRC Press, Taylor & Francis Group and & quot; Decision Analytics for Sustainable Development in Smart Society 5.0”, Springer Nature.

Author Articles
A Lattice-Enhanced Dynamic Threshold CRT-Based Secret Sharing for Mobile Agent Security in Decentralized Networks

By Pradeep Kumar Kakoli Banergee Bijendra Tyagi Anuradha Singh Priyank Sirohi

DOI: https://doi.org/10.5815/ijwmt.2026.05.09, Pub. Date: 8 Oct. 2026

A mobile agent is a small piece of program that migrates automatically among different platforms, on which it executes assigned tasks. Mobile agents migrate in malicious and unsecure networks. So, there will be chances of compromising mobile agent as well as host computer. So, during the mobile agent executing life cycle there will be chances of stealing of confidential information about host and agents. The application of mobile agents is increasing day by day in various domains such as distributed computing, cloud computing and Internet of Things. In this article, we propose a method based on lattice-based dynamic threshold Chinese Remainder Theorem for the security of mobile agents. The combination of dynamic threshold, lattice-based encryption-decryption and Chinese remainder theorem provides optimal security as compared to traditional approach. After the analysis of turnaround time of creation of share, distribution and recreation of secret is optimal as compared to traditional approach. Another comparison is also done on the basis of memory utilization, computational cost, communication overhead and scalability of proposed method. Proposed approaches provide effectiveness of security for mobile agents in a decentralized and malicious environment. The framework was implemented in Python and analyzed with 10 to 1000 mobile agents. With 1000 mobile agents, the framework gains a turnaround time of 12.4 ms, memory utilization of 18.7 MB, and CPU efficiency of 91.3%, demonstrating better scalability and computational cost compared with Shamir Secret Sharing, Integer CRT, Homomorphic Encryption, Vectorized Tree Parity Machine and Boneh Goh Nissim techniques. Performance evaluation based on computational cost, communication overhead and scalability further shows the effectiveness of the framework. These outcomes show that the proposed methods provide an efficient, scalable and post-quantum-secure method for securing mobile agents in cloud computing, Internet of Things (IoT), and other decentralized distributed computing environments.

[...] Read more.
Other Articles