A Novel Multipath Approach to Security in Mobile Ad Hoc Networks (MANETs)

In this paper, we present a novel encryption-less algorithm to enhance security in transmission of data packets across mobile ad hoc networks. The paper hinges on the paradigm of multipath routing and exploits the properties of polynomials. The first step in the algorithm is to transform the data such that it is impossible to obtain any information without possessing the entire transformed data. The algorithm then uses an intuitively simple idea of a jigsaw puzzle to break the transformed data into multiple packets where these packets form the pieces of the puzzle. Then these packets are sent along disjoint paths to reach the receiver. A secure and efficient mechanism is provided to convey the information that is necessary for obtaining the original data at the receiver-end from its fragments in the packets, that is, for solving the jigsaw puzzle. The algorithm is designed to be secure so that no intermediate or unintended node can obtain the entire data. An authentication code is also used to ensure authenticity of every packet.

[1]  Yuguang Fang,et al.  A multipath routing approach for secure data delivery , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

[2]  Ratan K. Guha,et al.  Effective intrusion detection using multiple sensors in wireless ad hoc networks , 2003, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the.

[3]  Mahesh K. Marina,et al.  Ad hoc on-demand multipath distance vector routing , 2006, Wirel. Commun. Mob. Comput..

[4]  G. V. S. Raju,et al.  Quality of service routing in ad hoc networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[5]  Ronald L. Rivest,et al.  Chaffing and Winnowing: Confidentiality without Encryption , 2012 .

[6]  Hugo Krawczyk,et al.  HMAC: Keyed-Hashing for Message Authentication , 1997, RFC.

[7]  Ronald L. Rivest,et al.  All-or-Nothing Encryption and the Package Transform , 1997, FSE.

[8]  Klara Nahrstedt,et al.  Distributed quality-of-service routing in ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[9]  Zygmunt J. Haas,et al.  Securing ad hoc networks , 1999, IEEE Netw..

[10]  S. Chakrabarti,et al.  QoS issues in ad hoc wireless networks , 2001, IEEE Commun. Mag..

[11]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[12]  Douglas R. Stinson,et al.  Something About All or Nothing (Transforms) , 2001, Des. Codes Cryptogr..

[13]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[14]  Ranga S. Ramanujan,et al.  Techniques for intrusion-resistant ad hoc routing algorithms (TIARA) , 2003, Proceedings DARPA Information Survivability Conference and Exposition.

[15]  Hugo Krawczyk,et al.  Secret Sharing Made Short , 1994, CRYPTO.

[16]  J. Redi,et al.  A brief overview of ad hoc networks: challenges and directions , 2002, IEEE Communications Magazine.