International Journal of Wireless and Microwave Technologies (IJWMT)
IJWMT Vol. 16, No. 5, 8 Oct. 2026
Cover page and Table of Contents: PDF (size: 796KB)
A Lattice-Enhanced Dynamic Threshold CRT-Based Secret Sharing for Mobile Agent Security in Decentralized Networks
PDF (796KB), PP.145-157
Views: 0 Downloads: 0
Author(s)
Pradeep Kumar
1,*
Kakoli Banergee
1
Bijendra Tyagi
1
Anuradha Singh
2
Priyank Sirohi
3
Index Terms
Mobile agent, Threats on mobile Agents, Encryption and decryption based on lattice, Dynamic threshold, Chinese remainder theorem CRT
Abstract
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.
Cite This Paper
Pradeep Kumar, Kakoli Banergee, Bijendra Tyagi, Anuradha Singh, Priyank Sirohi, "A Lattice-Enhanced Dynamic Threshold CRT-Based Secret Sharing for Mobile Agent Security in Decentralized Networks", International Journal of Wireless and Microwave Technologies(IJWMT), Vol.16, No.5, pp. 145-157, 2026. DOI:10.5815/ijwmt.2026.05.09
Reference
[1]Chen J, Deng H, Su H, Yuan M, Ren Y. Lattice-Based Threshold Secret Sharing Scheme and Its Applications: A Survey. Electronics. 2024; 13(2):287. https://doi.org/10.3390/electronics13020287.
[2]P. Kumar et al., “Verifiable, Secure Mobile Agent Migration in Healthcare Systems Using a Polynomial-Based Threshold Secret Sharing Scheme with a Blowfish Algorithm,” Sensors, vol. 22, no. 22, 2022, doi: 10.3390/s22228620.
[3]Damgård, I., Orlandi, C., Takahashi, A. et al. Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices. J Cryptol 35, 14 (2022). https://doi.org/10.1007/s00145-022-09425-3
[4]J. S. Kim, K. Lee, J. Hwan Park and H. Kim, "Dynamic Threshold Key Encapsulation With Transparent Setup," in IEEE Transactions on Information Forensics and Security, vol. 20, pp. 8433-8448, 2025, doi: 10.1109/TIFS.2025.3595667
[5]G. Li, H. Luo, J. Yu, A. Hu and J. Wang, "Information-Theoretic Secure Key Sharing for Wide-Area Mobile Applications," in IEEE Wireless Communications, vol. 31, no. 1, pp. 118-124, February 2024, doi: 10.1109/MWC.012.2200289.
[6]P. Kumar, N. Singhal, D. Pandey, and A. Vatsa, “Secure Mobile Agent Migration Using Lagrange Interpolation and Fast Fourier Transformation,” Int. J. Comput. Netw. Inf. Secur., vol. 15, no. 4, pp. 72–83, 2023, doi: 10.5815/ijcnis.2023.04.07.
[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.
[8]L. Li, Y. Lu, L. Liu, Y. Sun, and J. Wang, “Practical Secret Image Sharing Based on the Chinese Remainder Theorem,” Mathematics, vol. 10, no. 12, pp. 1–18, 2022, doi: 10.3390/math10121959.
[9]K. Meng, F. Miao, Y. Ning, W. Huang, Y. Xiong, and C. C. Chang, “A proactive secret sharing scheme based on Chinese remainder theorem,” Front. Comput. Sci., vol. 15, no. 2, 2021, doi: 10.1007/s11704-019-9123-z.
[10]D. Pande, A. S. Rawat, M. Deshmukh, and M. Singh, “Single Secret Sharing Scheme Using Chinese Remainder Theorem, Modified Shamir’s Scheme and XOR Operation,” Wirel. Pers. Commun., vol. 130, no. 2, pp. 957–985, 2023, doi: 10.1007/s11277-023-10315-5.
[11]J. Chen, K. Liu, X. Yan, L. Liu, X. Zhou, and L. Tan, “Chinese remainder theorem-based secret image sharing with small-sized shadow images,” Symmetry (Basel)., vol. 10, no. 8, 2018, doi: 10.3390/sym10080340.
[12]K. Shehata, H. Fangqi and S. A. Thyagarajan, "Verifiable Weighted Secret Sharing," 2025 Crypto Valley Conference (CVC), Rotkreuz, Switzerland, 2025, pp. 86-101, doi: 10.1109/CVC65719.2025.00017.
[13]Y. H. Liu and R. J. Chen, “An asymptotically perfect secret sharing scheme based on the Chinese Remainder Theorem,” Int. J. Comput. Math., vol. 94, no. 9, pp. 1890–1915, 2017, doi: 10.1080/00207160.2016.1274738.
[14]X. Jia, Y. Song, D. Wang, D. Nie, and J. Wu, “A collaborative secret sharing scheme based on the Chinese Remainder Theorem,” Math. Biosci. Eng., vol. 16, no. 3, pp. 1280–1299, 2019, doi: 10.3934/mbe.2019062.
[15]L. Harn, C. Hsu, and Z. Xia, “A novel threshold changeable secret sharing scheme,” Front. Comput. Sci., vol. 16, no. 1, pp. 1–7, 2022, doi: 10.1007/s11704-020-0300-x.
[16]R. Kumar and S. Padhye, “A Lattice-Based Single-Share Secret Sharing Scheme,” SN Comput. Sci., vol. 4, no. 6, 2023, doi: 10.1007/s42979-023-02274-2.
[17]B. Huang, J. Gao, and X. Li, “Efficient lattice-based revocable attribute-based encryption against decryption key exposure for cloud file sharing,” J. Cloud Comput., vol. 12, no. 1, 2023, doi: 10.1186/s13677-023-00414-w.
[18]Liu-Zhang, CD., Masserova, E., Ribeiro, J., Soni, P., Thyagarajan, S.A. (2025). Efficient Distributed Randomness Generation from Minimal Assumptions Where PArties Speak Sequentially Once. In: Fehr, S., Fouque, PA. (eds) Advances in Cryptology – EUROCRYPT 2025. EUROCRYPT 2025. Lecture Notes in Computer Science, vol 15605. Springer, Cham. https://doi.org/10.1007/978-3-031-91092-0_7.