Advertisement

Session Key Reuse Scheme to Improve Routing Efficiency in AnonDSR

  • Chunum Kong
  • Min Young Chung
  • Hyunseung Choo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4490)

Abstract

The importance of security in ad hoc network is increasing gradually to deliver information safely among nodes in hostile environment. The data is encrypted using various encryption techniques for the security reinforcement or for hiding the communication path. AnonDSR which offers anonymity to encrypt communication path, guarantees anonymity efficiently. The anonymity of source and destination nodes is guaranteed through 3 protocols. However, secret keys and route pseudonyms must be newly created for security, whenever an anonymous communication session occurs. It generates large overhead.Therefore, the proposed scheme reduces overhead of AnonDSR to reuse symmetric keys and route pseudonyms during a certain period which is defined by user. It is possible so that the data is encrypted by symmetric key which is shared between source and destination nodes, because intermediate nodes cannot decrypt the data. This scheme maintains security features of AnonDSR to perform anonymous communication, and only performs anonymous data transfer protocol when duplicate session is occurred. Then, the route setup time is improved a minimum of 47.1% due to the decrease of route setup procedure.

Keywords

Anonymous Ad Hoc Routing Key Reuse and Onion 

References

  1. 1.
    Kong, J., Hong, X.: ANODR: Anonymous on Demand Routing with Untraceable Routes for Mobile Ad-Hoc Networks. In: ACM Symposium, pp. 291–302 (2003)Google Scholar
  2. 2.
    Boukerche, A., El-Khatib, K., Korba, L., Xu, L.: A Secure Distributed Anonymous Routing Protocol for Ad Hoc Wireless Networks. Journal of Computer Communications (2004)Google Scholar
  3. 3.
    Song, R., Korba, L., Yee, G.: AnonDSR: Efficient Anonymous Dynamic Source Routing for Mobile Ad-Hoc Networks. SASN, 32–42 (2005)Google Scholar
  4. 4.
    Yao, A.: Theory and Applications of Trapdoor Functions (Extended Abstract). In: Symposium on Foundations of Computer Science, pp. 80–91 (1982)Google Scholar
  5. 5.
    Goldschlag, D., Reed, M., Syverson, P.: Onion Routing for Anonymous and Private Internet Connections. Communication of the ACM, 39–41 (1999)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Chunum Kong
    • 1
  • Min Young Chung
    • 1
  • Hyunseung Choo
    • 1
  1. 1.School of Information and Communication Engineering, Sungkyunkwan University, 440-746, SuwonKorea

Personalised recommendations