The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (2008 vol.19)
pp: 1009-1019
ABSTRACT
Mobile Peer-to-Peer Networks (MOPNETs) in Wireless Mobile Ad Hoc Networks (MANET) have become very popular applications due to their easy communication and resource sharing patterns in unfixed network infrastructures. As privacy and security is coming under increasingly attention, many MANENT protocols attempt to provide mutual anonymity for users. Most existing anonymous designs, however, are path-based, where the anonymous communications are achieved via pre-determined path. Such a design suffers from unreliable delivery and high processing overheads, and is not practical. We propose a scalable secret-sharing-based mutual anonymity protocol, termed PUZZLE, which enables anonymous query issuance and file delivery for MOPNETs in ad hoc environments by employing a Shamirs?? secret sharing scheme. We present the design of PUZZLE, analyze its degree of security and anonymity, and evaluate its performance by comprehensive trace driven simulations. Experimental results show that, compared with previous designs, PUZZLE achieves mutual anonymous communications with a low cryptography processing overhead and high degree of anonymity.
INDEX TERMS
Distributed Systems, Mobile Computing, Mobile Peer-to-Peer, Mutual Anonymity, Secret Sharing
CITATION
Jinsong Han, Yunhao Liu, "Mutual Anonymity for Mobile P2P Systems", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 8, pp. 1009-1019, August 2008, doi:10.1109/TPDS.2007.70805
REFERENCES
[1] JXTA, http:/www.jxta.org/, 2007.
[2] O. Wolfson, B. Xu, H. Yin, and H. Cao, “Search-and-Discover in Mobile P2P Network Databases,” Proc. 26th Int'l Conf. Distributed Computing Systems (ICDCS), 2006.
[3] O. Wolfson, B. Xu, H. Yin, and H. Cao, “Searching Local Information in Mobile Databases,” Proc. 22nd Int'l Conf. Data Eng. (ICDE), 2006.
[4] Anonymity, http://freehaven.net/anonbibtopic.html, 2007.
[5] M. Freedman and R. Morris, “Tarzan: A Peer-to-Peer Anonymizing Network Layer,” Proc. Ninth ACM Conf. Computer and Comm. Security (CCS), 2002.
[6] M. Gruteser and D. Grunwald, “Anonymous Usage of Location-Based Services through Spatial and Temporal Cloaking,” Proc.First ACM Int'l Conf. Mobile Systems, Applications, and Services (MobiSys), 2003.
[7] A.R. Beresford and F. Stajano, “Location Privacy in Pervasive Computing,” IEEE Pervasive Computing, vol. 2, pp. 46-55, 2003.
[8] J. Kong and X. Hong, “ANODR: Anonymous on Demand Routing with Untraceable Routes for Mobile Ad-Hoc Networks,” Proc. ACM MobiHoc, 2003.
[9] H. Choi, W. Enck, J. Shin, P. McDaniel, and T.F.L. Porta, “ASR:Anonymous and Secure Reporting of Traffic Forwarding Activity in Mobile Ad Hoc Networks,” Technical Report NAS-TR-0034-2006, Dept. Computer Science and Eng., Pennsylvania State Univ., 2006.
[10] Y. Zhang, W. Liu, and W. Lou, “Anonymous Communications in Mobile Ad Hoc Networks,” Proc. IEEE INFOCOM, 2005.
[11] D. Chaum, “Untraceable Electronic Mail Return Addresses, and Digital Pseudonyms,” Comm. ACM, vol. 24, pp. 84-90, 1981.
[12] D. Goldschlag, M. Reed, and P. Syverson, “Onion Routing,” Comm. ACM, vol. 42, pp. 39-41, 1999.
[13] M.K. Wright, M. Adler, B.N. Levine, and C. Shields, “The Predecessor Attack: An Analysis of a Threat to Anonymous Communications Systems,” ACM Trans. Information and System Security, vol. 7, pp. 489-522, 2004.
[14] A. Shamir, “How to Share a Secret,” Comm. ACM, vol. 22, pp.612-613, 1979.
[15] M.O. Rabin, “Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance,” J. ACM, vol. 36, pp. 335-348, 1989.
[16] A. Back, I. Goldberg, and A. Shostack, “Freedom Systems 2.1 Security Issues and Analysis,” white paper, Zero Knowledge Systems, Inc., 2001.
[17] R. Dingledine, N. Mathewson, and P. Syverson, “Tor: The Second-Generation Onion Router,” Proc. 13th Usenix Security Symp., 2004.
[18] M. Rennhard and B. Plattner, “Introducing MorphMix: Peer-to-Peer Based Anonymous Internet Usage with Collusion Detection,” Proc. ACM Workshop Privacy in the Electronic Soc., 2002.
[19] C. Shields and B.N. Levine, “A Protocol for Anonymous Communication over the Internet,” Proc. Seventh ACM Conf. Computer and Comm. Security (CCS), 2000.
[20] B. Zhu, S. Jajodia, M.S. Kankanhalli, F. Bao, and R.H. Deng, “AnAnonymous Routing Protocol with the Local-Repair Mechanism for Mobile Ad Hoc Networks,” Proc. Third Ann. IEEE Conf. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON), 2006.
[21] R. Sherwood, B. Bhattacharjee, and A. Srinivasan, “${\rm P}^{5}$ : A Protocol for Scalable Anonymous Communication,” Proc. IEEE Symp. Security and Privacy, 2002.
[22] V. Scarlata, B.N. Levine, and C. Shields, “Responder Anonymity and Anonymous Peer-to-Peer File Sharing,” Proc. IEEE Ninth Int'l Conf. Network Protocols (ICNP), 2001.
[23] M.K. Reiter and A.D. Rubin, “Crowds: Anonymity for Web Transactions,” ACM Trans. Information and System Security, vol. 1, pp. 66-92, 1998.
[24] J. Deng, R. Han, and S. Mishra, “Intrusion Tolerance and Anti-Traffic Analysis Strategies for Wireless Sensor Networks,” Proc. IEEE Int'l Conf. Dependable Systems and Networks (DSN), 2004.
[25] P. Kamat, Y. Zhang, W. Trappe, and C. Ozturk, “Enhancing Source-Location Privacy in Sensor Network Routing,” Proc. 25th Int'l Conf. Distributed Computing Systems (ICDCS), 2005.
[26] H. Krawczyk, “Secret Sharing Made Short,” Proc. 13th Ann. Int'l Cryptology Conf. Advances in Cryptology, 1994.
[27] C.E. Perkins, E.M. Royer, and S.R. Das, Ad Hoc On-Demand Distance Vector Routing, IETF RFC 3561, 2003.
[28] M. Wright, M. Adler, B.N. Levine, and C. Shields, “An Analysis of the Degradation of Anonymous Protocols,” Proc. Ninth Symp. Network and Distributed System Security (NDSS), 2002.
[29] H. Krawczyk, “Distributed Fingerprints and Secure Information Dispersal,” Proc. 12th Ann. ACM Symp. Principles of Distributed Computing (PODC), 1993.
[30] O. Goldreich, “A Note on Computational Indistinguishability,” Information Processing Letters, vol. 34, pp. 277-281, 1990.
[31] Y. Liu, L. Xiao, X. Liu, M. Ni, and X. Zhang, “Location Awareness in Unstructured Peer-to-Peer Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 16, pp. 163-174, Feb. 2005.
[32] W.W. Terpstra, J. Kangasharju, C. Leng, and A.P. Buchmann, “BubbleStorm: Resilient, Probabilistic, and Exhaustive Peer-to-Peer Search,” Proc. ACM SIGCOMM, 2007.
[33] M. Musolesi and C. Mascolo, “A Community Based Mobility Model for Ad Hoc Network Research,” Proc. ACM/SIGMOBILE Int'l Workshop Multi-Hop Ad-Hoc Networks: From Theory to Reality, 2006.
[34] DSS Clip2 Trace, http:/dss.clip2.com, 2005.
[35] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “WebCaching and Zipf-Like Distributions: Evidence and Implications,” Proc. IEEE INFOCOM, 1999.
[36] S. Sen and J. Wang, “Analyzing Peer-to-Peer Traffic across LargeNetworks,” ACM/IEEE Trans. Networking, vol. 12, pp.219-232, 2004.
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool