WAR: Wireless Anonymous Routing

  • Matt Blaze
  • John Ioannidis
  • Angelos D. Keromytis
  • Tal Malkin
  • Avi Rubin
Conference paper

DOI: 10.1007/11542322_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3364)
Cite this paper as:
Blaze M., Ioannidis J., Keromytis A.D., Malkin T., Rubin A. (2005) WAR: Wireless Anonymous Routing. In: Christianson B., Crispo B., Malcolm J.A., Roe M. (eds) Security Protocols. Security Protocols 2003. Lecture Notes in Computer Science, vol 3364. Springer, Berlin, Heidelberg

Abstract

There have been many efforts to anonymize traffic in traditional point-to-point networks. However, these techniques do not map directly onto wireless systems because the two types of networks have different properties. For example, whereas in wired networks adjacent communication links must know each others’ addresses, wireless networks broadcast messages. Thus, an adversary may be able to obtain global information about network traffic. On the other hand, a wireless receiver’s identity may not need to be known to anyone.

We introduce Wireless Anonymous Routing (WAR).We describe a threat model for WAR and compare it to its wired counterpart. We show that traditional anonymity protocols are either insecure or perform poorly when applied to the wireless model, and we describe new protocols that preserve security with better performance.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Matt Blaze
    • 1
  • John Ioannidis
    • 1
  • Angelos D. Keromytis
    • 2
  • Tal Malkin
    • 2
  • Avi Rubin
    • 3
  1. 1.AT&T Labs – Research 
  2. 2.CS DepartmentColumbia University 
  3. 3.Johns Hopkins University 

Personalised recommendations