Xiaoxin Wu
Ninghui Li
ABSTRACT
Mesh network is vulnerable to privacy attacks because of the open medium property of wireless channel, the fixed topology, and the limited network size. Traditional anonymous routing algorithm cannot be directly applied to Mesh network, because they do not defend global attackers. In this paper we design private routing algorithm that used "Onion", i.e., layered encryption, to hide routing information. In addition, we explore special ring topology that fits the investigated network scenario, to preserve a certain level of privacy against a global adversary.
- R. Draves, J. Padhye, and B. Zill, Routing in multi-radio, multi-hop wireless mesh networks, In Proceedings of the 10th annual international conference on Mobile computing and networking, 2004. Google Scholar
Digital Library
- J. Jangeun and M.L. Sichitiu, The nominal capacity of wireless mesh networks, In IEEE Wireless Communications, volume 10 of 5, pages 8--14, Oct. 2003. Google ScholarDigital Library
- A. Raniwala, K. Gopalan, and T. Chiueh, Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks, SIGMOBILE Mobile Comput. Commun. Rev., 8(2), 2004. Google ScholarDigital Library
- K. Rayner, Mesh wireless networking, Communications Engineer, 1(5):44 47, Oct.-Nov. 2003.Google ScholarCross Ref
- Daniel Aguayo, John Bicket, Sanjit Biswas, Glenn Judd, and Robert Morris Link-level Measurements from an 802.11b Mesh Network, in SIGCOMM 2004. Google ScholarDigital Library
- IEEE Std 802.11b-1999, url = http://standards.ieee.org/getieee802/802.11.html.Google Scholar
- D. L. Chaum, Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, Communications of the ACM, 24(2):84--88, 1981. Google ScholarDigital Library
- M. Reed, P. Syverson, and D. Goldschlag, Anonymous Connections and Onion Routing, IEEE Journal on Selected Areas in Communication Special Issue on Copyright and Privacy Protection, 1998.Google ScholarCross Ref
- R. Dingledine, N. Mathewson and P. Syverson, Tor: The Second-Generation Onion Router, in 13th USENIX Security Symposium, 2004. Google ScholarDigital Library
- J. Camenisch and A. Lysyanskaya, A Formal Treatment of Onion Routing, in Proceedings of CRYPTO, 2005. Google ScholarDigital Library
- M. K. Reiter and A. D. Rubin, Crowds: Anonymity ForWeb Transactions, ACM Transactions on Information and System Security, 1(1):6--92, 1998. Google ScholarDigital Library
- V. Scarlata, B. Levine, and C. Shields, Responder Anonymity and Anonymous Peer-to-Peer File Sharing, IEEE International Conference on Network Protocols (ICNP), Riverside, CA, 2001. Google ScholarDigital Library
- R. Sherwood, B. Bhattacharjee, and A. Srinivasan, p5: A Protocol for Scalable Anonymous Communication, IEEE Symposium on Security and Privacy, pages 53--65, Oakland, CA, May 2002. Google ScholarDigital Library
- Routing Information Protocol, RFC, url=http://www.faqs.org/rfcs/rfc1058.html.Google Scholar
- OPSF Version 2, RFC, url = http://www.faqs.org/rfcs/rfc2328.html.Google Scholar
- C.E. Perkins and E.M. Royer, Ad-hoc On-Demand Distance Vector Routing, in Proc. of the 2nd IEEE WMCSA, pp.90--100, 1999. Google ScholarDigital Library
- D. Johnson and D. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks, in Proc. of ACM SIGCOMM, 1996.Google ScholarCross Ref
- Y.-C. Hu, D. B. Johnson, and A. Perrig, SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks, in Proc. of the 4th IEEE WMCSA 2002, June 2002, pp. 3--13. Submitted for publication. Google ScholarDigital Library
- Y.-C. Hu, D. B. Johnson, and A. Perrig, Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks, in Proc. of MOBICOM'02, 2002. Google ScholarDigital Library
- B. Awerbuch, D. Holmer, C. Nita-Rotaru, and H. Rubens, An On-Demand Secure Routing Protocol Resilient to Byzantine Failures, In ACM Workshop on Wireless Security (WiSe), 2002. Google ScholarDigital Library
- L. Sweeney, K-Anonymity: A Model for Protecting Privacy, International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10(5):557--570, 2002. Google ScholarDigital Library
- A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam, l-Diversity: Privacy Beyond k-Anonymity,Google Scholar
- Michael J. Freedman, Robert Morris, A Peer-to-Peer Anonymizing Network Layer, in Proceedings of ACM Conference on Computer and Communication Security, 2002. Google ScholarDigital Library
- S. J. Murdoch and G. Danezis, Low-Cost Traffic Analysis of Tor, in IEEE Symposium on Security and Privacy, 2005. Google ScholarDigital Library
- J. Kong and X. Hong, ANODR: Anonymous on Demand Routing with Untraceable Routes for Mobile Ad-hoc Networks, in Proceedings of ACM international symposium on Mobile ad hoc networking and computing, June 2003. Google ScholarDigital Library
- Y. Zhang, W. Liu, and W. Luo, Anonymous Communications in Mobile Ad Hoc Networks, in Proceedings of INFOCOM, 2005.Google Scholar
- X. Wu and E. Bertino, Achieving K-Anonymity in Mobile Ad Hoc Networks, accepted in workshop on Secure Network Protocols, 2005. Google ScholarDigital Library
- X. Wu and B. Bhargava, AO2P: Ad hoc On-demand Position-based Private Routing Protocol, IEEE Transactions on Mobile Computing, Vol. 4, No. 4, Pages 335--348, 2005. Google ScholarDigital Library
- D. Chaum, The Dining Cryptographers Problem: Unconditional Sender and Receipient Untraceability, Journal of Cryptography, Vol. 24, No. 2, Pages 65--75, 1988. Google ScholarDigital Library
- P. Golle and A. Juels, Dining cryptographers revisited Advances in Cryptology - Eurocrypt 2004.Google Scholar
Index Terms
- Achieving privacy in mesh networks
Recommendations
Achieving Privacy in a Federated Identity Management System
Financial Cryptography and Data SecurityFederated identity management allows a user to efficiently authenticate and use identity information from data distributed across multiple domains. The sharing of data across domains blurs security boundaries and potentially creates privacy risks. We ...
Achieving k-anonymity privacy protection using generalization and suppression
Often a data holder, such as a hospital or bank, needs to share person-specific records in such a way that the identities of the individuals who are the subjects of the data cannot be determined. One way to achieve this is to have the released records ...
Freedom of Privacy: Anonymous Data Collection with Respondent-Defined Privacy Protection
The massive amount of sensitive survey data about individuals that agencies collect and share through the Internet is causing a great deal of privacy concerns. These concerns may discourage individuals from revealing their sensitive information. ...
Comments