Secure and Reliable Data Transmission Over MANET Based On Principles of Computationally Secure Secret Sharing

Mobile Ad-Hoc Networks (MANET) require special approaches to the design and selection of data transmission and security algorithms Nodes mobility and dynamic topology give rise to two key problems of MANET – the difficulty of ensuring confidentiality when transmitting data through a network and the complexity of organizing reliable data transfer. This paper proposes a new approach to organizing data transfer through MANET, based on node disjoint multipath routing and modular coding of data. Distributed modular coding allows the use of secret-sharing schemes to ensure confidentiality on the one hand and reliable coding on the other hand. In this paper, a Computationally Secure Secret Sharing Scheme based on the Residue Number System is used, which ensures the confidentiality of data and the reliability of their transmission. Such an approach also allows for balancing the network loading.

1. Sen S., Clark J. A., Tapiador J. E. Security threats in mobile ad hoc networks. In Security of Self-Organizing Networks: MANET, WSN, WMN, VANET, CRC Press, 2010, pp. 127-147.

2. Li X., Cuthbert L. Stable node-disjoint multipath routing with low overhead in mobile ad hoc networks., In Proc. of the IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. pp. 184-191.

3. Shamir A. How to share a secret. Communications of the ACM, vol. 22, no. 11, 1979, pp. 612-613.

4. Krawczyk H. Secret sharing made short. In Proc. of the Annual International Cryptology Conference, 1993. pp. 136-146.

5. Deryabin M., Chervyakov N., Tchernykh A., Babenko M., Kucherov N., Miranda-López V., Avetisyan A. Secure Verifiable Secret Short Sharing Scheme for Multi-Cloud Storage. In Proc. of the 2018 International Conference on High Performance Computing & Simulation (HPCS), 2018. pp. 700-706.

6. Goh V.T., Siddiqi M.U. Multiple error detection and correction based on redundant residue number systems. IEEE Transactions on Communications, vol. 56, no 3, 2008, pp. 325-330.

7. Anantvalee T., Wu J. A survey on intrusion detection in mobile ad hoc networks. In Wireless Network Security. Springer, Boston, MA, 2007, pp. 159-180.

8. Ahmed T., Rahman R. Survey of anomaly detection algorithms: Towards self-learning networks. In Security of Self-Organizing Networks: MANET, WSN, WMN, VANET, CRC Press, 2010. pp. 65-89.

9. Zhou L., Haas Z.J. Securing ad hoc networks. IEEE network, vol. 13, №. 6, 1999, pp. 24-30.

10. Perkins C., Belding-Royer E., Das S. RFC 3561: Ad hoc on-demand distance vector (AODV) routing, 2003. Available at: http://www.ietf.org/rfc/rfc3561.txt, accessed 07.12.2018.

11. Johnson D.B., Maltz D.A., Broch J. DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks. Ad hoc networking, vol. 5, 2001, pp. 139-172.

12. Glass, S., Portmann, V., Muthukkumarasamy, V. Securing Route and Path Integrity In Multihop Wireless Networks. Security of Self-Organizing Networks. MANET, WSN, WMN, VANET, CRC Press, 2010, pp. 25-43.

13. Yih-Chun H., Perrig A. A survey of secure wireless ad hoc routing. IEEE Security & Privacy, vol. 2. no. 3, 2004, pp. 28-39.

14. Zapata M.G., Asokan N. Securing ad hoc routing protocols. In Proc. of the 1st ACM workshop on Wireless security, 2002, pp. 1-10.

15. Hu Y.C., Johnson D. B., Perrig A. SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks. Ad hoc networks, vol. 1, no. 1, 2003, pp. 175-192.

16. Raja R., Ganeshkumar P. QoSTRP: A Trusted Clustering Based Routing Protocol for Mobile Ad-Hoc Networks. Programming and Computer Software, vol. 44, no. 6, 2018, pp. 407–416.

17. Hu Y. C., Perrig A., Johnson D. B. ARIADNE: A secure on-demand routing protocol for ad hoc networks. Wireless networks, vol. 11, no. 1-2, 2005, pp. 21-38.

18. Zhu S., Xu S., Setia S., Jajodia S. LHAP: a lightweight hop-by-hop authentication protocol for ad-hoc networks. In Proc. of the 23rd International Conference on Distributed Computing Systems Workshops, 2003. pp. 749-755.

19. Liu X., Han J., Ni G., Zhang C., Liu Y. A Multipath Redundant Transmission Algorithm for MANET. In Proc. of the International Conference in Communications, Signal Processing, and Systems, 2017, pp. 518-524.

20. Yuan Y. H., Chen H. M., Jia M. An optimized ad-hoc on-demand multipath distance vector (AOMDV) routing protocol. In Proc. of the 2005 Asia-Pacific Conference on Communications, 2005. pp. 569-573.

21. Leung R., Liu J., Poon E., Chan A. L., Li B. MP-DSR: a QoS-aware multi-path dynamic source routing protocol for wireless ad-hoc networks. In Proc. of the 26th Annual IEEE Conference on Local Computer Networks, 2001. pp. 132-141.

22. Liang Y., Poor H. V., Ying L. Secrecy throughput of MANETs with malicious nodes. In Proc. of the IEEE International Symposium on Information Theory, 2009. pp. 1189-1193.

23. Mammeri A., Boukerche A., Fang Z. Video streaming over vehicular ad hoc networks using erasure coding. IEEE Systems Journal, vol. 10, no. 2, 2016, pp. 785-796.

24. Yang B., Chen Y., Chen G., Jiang X. Throughput Capacity Study for MANETs with Erasure Coding and Packet Replication. IEICE Transactions on Communications, vol. 98, no. 8, 2015, pp. 1537-1552.

25. Djukic P., Valaee S. Reliable packet transmissions in multipath routed wireless networks. IEEE Transactions on Mobile Computing, vol. 5, no. 5, 2006, pp. 548-559.

26. Lee S.J., Gerla M. Split multipath routing with maximally disjoint paths in ad hoc networks. In Proc. of the IEEE International Conference on Communications, vol. 1, 2001, pp. 3201-3205.

27. Ye Z., Krishnamurthy S. V., Tripathi S. K. A framework for reliable routing in mobile ad hoc networks. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications, vol. 1, 2003, pp. 270-280.

28. Mahfoudh S., Minet P. An energy efficient routing based on OLSR in wireless ad hoc and sensor networks. In Proc. of the 22nd International Conference on Advanced Information Networking and Applications-Workshops, 2008. pp. 1253-1259.

29. Tchernykh A., Babenko M., Miranda-López V., Drozdov A. Y., Avetisyan, A. WA-RRNS: Reliable Data Storage System Based on Multi-cloud. In Proc. of the 2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), 2018. pp. 666-673.

30. Tchernykh A., Schwiegelsohn U., Talbi E. G., Babenko M. Towards understanding uncertainty in cloud computing with risks of confidentiality, integrity, and availability. Journal of Computational Science, 2016. DOI: 10.1016/j.jocs.2016.11.011

31. Chervyakov N., Babenko M., Tchernykh A., Kucherov N., Miranda-López V., Cortés-Mendoza J. M. AR-RRNS: Configurable reliable distributed data storage systems for Internet of Things to ensure security. Future Generation Computer Systems, vol. 92, 2019, pp. 1080-1092.

32. Tormasov A.G., Khasin M.A., Pakhomov Y.I. Ensuring Fault-Tolerance in Distributed Media. Programming and Computer Software, vol. 27, no. 5, 2001, pp. 245–251.

33. Sarkar S. Kisku B., Misra S., Obaidat M.S. Chinese Remainder Theorem-based RSA-threshold cryptography in MANET using verifiable secret sharing scheme. In Proc. of the IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, 2009. pp. 258-262.

34. Chang C.H., Molahosseini A.S., Zarandi A.A. E., Tay T.F. Residue number systems: A new paradigm to datapath optimization for low-power and high-performance digital signal processing applications. IEEE circuits and systems magazine, vol. 15, no. 4, 2015, pp. 26-44.

35. Ding C., Pei D., Salomaa A. Chinese remainder theorem: applications in computing, coding, cryptography. World Scientific, 1996, 224 p.

36. Zima E. V., Stewart A.M. Cunningham numbers in modular arithmetic. Programming and Computer Software, vol. 33, no. 2, 2007, pp. 80–86.

37. Chervyakov N. I., Molahosseini A. S., Lyakhov P. A., Babenko M. G., Deryabin M. A. Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem. International Journal of Computer Mathematics, vol. 94, no. 9, 2017, pp. 1833-1849.

38. Asmuth C., Bloom J. A modular approach to key safeguarding. IEEE transactions on information theory, vol. 29, no. 2, 1983, pp. 208-210.

39. Quisquater M., Preneel B., Vandewalle J. On the security of the threshold scheme based on the Chinese remainder theorem. In Proc. of the International Workshop on Public Key Cryptography, 2002. pp. 199-210.

40. Rabin M. O. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM, vol. 36, no. 2, 1989, pp. 335-348.

41. Tchernykh A., Babenko M., Chervyakov N., Miranda-López V., Kuchukov V., Cortés-Mendoza J. M., Deryabin M., Kucherov N., Radchenko G., Avetisyan A. AC-RRNS: Anti-collusion secured data sharing scheme for cloud storage. International Journal of Approximate Reasoning, vol. 102, 2018, pp. 60-73.

42. Barzu M., Ţiplea F. L., Drăgan C. C. Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes. Information Sciences, vol. 240, 2013, pp. 161-172.

43. Morillo P., Padró C., Sáez G., Villar J. L. Weighted threshold secret sharing schemes. Information Processing Letters, vol. 70, no. 5, 1999, pp. 211-216.