Advertisement

Anonymous Secure Communication in Wireless Mobile Ad-Hoc Networks

  • Sk. Md. Mizanur Rahman
  • Atsuo Inomata
  • Takeshi Okamoto
  • Masahiro Mambo
  • Eiji Okamoto
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4412)

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.

Keywords

Ad-hoc network Anonymity Routing Pairing-Based Cryptography Security 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    ISO99 ISO IS 15408 (1999), available at http://www.commoncriteria.org
  3. 3.
    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 Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Levine, B.N., Shields, C.: Hordes: a multicast based protocol for anonymity. Journal of Computer Security 10(3), 213–240 (2002)Google Scholar
  8. 8.
    Boneh, D., Franklin, M.: Identity Based Encryption from the Weil Pairing. SIAM Computing, Extended Abstract in Crypto 2001 32(1), 586–615 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    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)CrossRefGoogle Scholar
  12. 12.
    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)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Sk. Md. Mizanur Rahman
    • 1
  • Atsuo Inomata
    • 2
  • Takeshi Okamoto
    • 1
  • Masahiro Mambo
    • 1
  • Eiji Okamoto
    • 1
  1. 1.Graduate School of Systems and Information Engineering, University of TsukuibaJapan
  2. 2.Japan Science and Technology Agency, TokyoJapan

Personalised recommendations