Covert Channels and Anonymous Communication in Ad-hoc Networks

作者: Song Li

DOI:

关键词:

摘要: Title of dissertation: COVERT CHANNELS AND ANONYMOUS COMMUNICATION IN AD HOC NETWORKS Song Li Doctor Philosophy, 2007 Dissertation directed by: Professor Anthony Ephremides Department Electrical and Computer Engineering Ad-hoc wireless networks distinguish themselves from their traditional wired counterparts by three unique characteristics: mobility, lack infrastructure, shared channel. These properties have gained popularity in various military civilian applications, but also introduced challenging problems terms ensuring satisfying network performance security. Ad hoc are a fertile ground for new threats security problems. We start demonstrating how covert attacks can be launched using the ad protocols. In particular, nodes ad-hoc to cooperate with each other order accomplish many networking functions such as routing channel access. observe that information conveyed during cooperation procedure. It is very difficult eliminate or even detect these channels. Simulation results show channels depends on characteristics. Anonymous communication has been considered one possible way fighting threats. fact, anonymity privacy attracted intensive attention important societal issues desirable features. One key components most anonymous protocols trapdoors, which we propose construction scheme based pairing-based cryptographies. More careful analysis shown could conflict secure mechanisms, accountability intrusion detection. solution flexibly trade off against according needs individual applications. The basic idea distribute real identity given user among set pseudonyms only sufficient number lead recovery identity. Users authenticate anonymously under pseudonyms. When times caught misbehaving exceeds threshold, user’s recovered had used. Thus, enforced. As conclusion, jointly investigate incorporate all different mechanisms across multiple protocol layers network.

参考文章(54)
John I. Capetanakis, The multiple access broadcast channel : protocol and capacity considerations. Massachusetts Institute of Technology. ,(1978) , 10.21236/ADA055275
Manel Guerrero Zapata, Secure Ad hoc On-Demand Distance Vector (SAODV) Routing draft-guerrero-manet-sadov-02. ,(2006)
Paulo SLM Barreto, Hae Y Kim, Ben Lynn, Michael Scott, None, Efficient Algorithms for Pairing-Based Cryptosystems Advances in Cryptology — CRYPTO 2002. pp. 354- 369 ,(2002) , 10.1007/3-540-45708-9_23
Dario Catalano, Rosario Gennaro, Shai Halevi, Computing inverses over a shared secret modulus theory and application of cryptographic techniques. pp. 190- 206 ,(2000) , 10.1007/3-540-45539-6_14
Mike Speciner, Radia Perlman, Charlie Kaufman, Network Security: Private Communication in a Public World ,(1995)
Yanchao Zhang, Wei Liu, Wenjing Lou, Anonymous communications in mobile ad hoc networks international conference on computer communications. ,vol. 3, pp. 1940- 1951 ,(2005) , 10.1109/INFCOM.2005.1498472
M. Scott Corson, Anthony Ephremides, A distributed routing algorithm for mobile wireless networks Wireless Networks. ,vol. 1, pp. 61- 81 ,(1995) , 10.1007/BF01196259
Levente Buttyán, Jean-Pierre Hubaux, Enforcing service availability in mobile ad-hoc WANs mobile ad hoc networking and computing. pp. 87- 96 ,(2000) , 10.5555/514151.514164
Marco Gruteser, Dirk Grunwald, Enhancing location privacy in wireless LAN through disposable interface identifiers: a quantitative analysis wireless mobile applications and services on wlan hotspots. pp. 46- 55 ,(2003) , 10.1145/941326.941334
Michael K. Reiter, Aviel D. Rubin, Anonymous Web transactions with Crowds Communications of The ACM. ,vol. 42, pp. 32- 48 ,(1999) , 10.1145/293411.293778