Abstract
The main characteristic of a mobile ad-hoc network is its infrastructure-less, highly dynamic topology, which is subject to malicious traffic analysis. Malicious intermediate nodes in wireless mobile ad-hoc networks are a threat concerning security as well as anonymity of exchanged information. To protect anonymity and achieve security of nodes in mobile ad-hoc networks, an anonymous on-demand routing protocol, termed RIOMO, is proposed. For this purpose, pseudo IDs of the nodes are generated considering Pairing-based Cryptography. Nodes can generate their own pseudo IDs independently. As a result RIOMO reduces pseudo IDs maintenance costs. Only trust-worthy nodes are allowed to take part in routing to discover a route. To ensure trustiness each node has to make authentication to its neighbors through an anonymous authentication process. Thus RIOMO safely communicates between nodes without disclosing node identities; it also provides different desirable anonymous properties such as identity privacy, location privacy, route anonymity, and robustness against several attacks.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Guan, Y., et al.: NetCamo: Camouflaging Network Traffic for QoS-Guaranteed Mission Critical Applications. IEEE Transactions on Systems, Man, and Cybernetics 31(4), 253–265 (2001)
ISO99 ISO IS 15408 (1999), available at http://www.commoncriteria.org
Zhang, Y., Liu, W., Lou, W.: Anonymous Communications in Mobile Ad Hoc Networks. In: IEEE Infocom 2005, March 13-17, 2005, The 24th Annual Conference Sponsored by IEEE Communications Society. IEEE Computer Society Press, Los Alamitos (2005), http://ece.wpi.edu/~wjlou/publication/INFOCOM05_Zhang.pdf
El-Khatib, K., et al.: Secure dynamic distributed routing algorithm for ad hoc wireless networks. In: International Conference on Parallel Processing Workshops (ICPPW’03) (2003)
Reed, M.G., Syverson, P.F., Goldschlag, D.M.: Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communications, Special Issue on Copyright and Privacy Protection 16(4), 482–494 (1998)
Kong, J., Hong, X.: ANODR: ANonymous on demand routing with untraceable routes for mobile ad-hoc networks. In: Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’03), pp. 291–302. ACM Press, New York (2003)
Levine, B.N., Shields, C.: Hordes: a multicast based protocol for anonymity. Journal of Computer Security 10(3), 213–240 (2002)
Boneh, D., Franklin, M.: Identity Based Encryption from the Weil Pairing. SIAM Computing, Extended Abstract in Crypto 2001 32(1), 586–615 (2003)
Berreto, P.S.L.M., Kim, H.Y., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354–368. Springer, Heidelberg (2002)
Boneh, D., Lynn, B., Shachum, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)
Raymond, J.F.: Traffic Analysis: Protocols, Attacks, Design Issues and Open Problems. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 10–29. Springer, Heidelberg (2001)
Hu, Y.C., Perrig, A., Johnson, D.B.: Packet leashes: A defense against wormhole attacks in wireless ad hoc networks. In: Proceedings of the Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003), IEEE Computer Society Press, Los Alamitos (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Rahman, S.M.M., Inomata, A., Okamoto, T., Mambo, M., Okamoto, E. (2007). Anonymous Secure Communication in Wireless Mobile Ad-Hoc Networks. In: Stajano, F., Kim, H.J., Chae, JS., Kim, SD. (eds) Ubiquitous Convergence Technology. ICUCT 2006. Lecture Notes in Computer Science, vol 4412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71789-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-71789-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71788-1
Online ISBN: 978-3-540-71789-8
eBook Packages: Computer ScienceComputer Science (R0)