Summery

The initiator can select the number of the intermediate nodes in the path and the value of the error tolerant factor to control tradeoffs between churn resilience, anonymity and overhead.

49

Chapter 7 Conclusion

Our routing protocol, AFATOR, provides anonymity against adversaries without proxies. We use layered encryption and random intermediaries to achieve anonymity.

We also achieve unlinkability between initiator and responder without being identify from adversaries. Every node in the path knows only the previous hop and the next hop. It is easy to recover the routing path without request re-transmission. By using Fuzzy Identity-Based Encryption (Fuzzy IBE) [4], a user can decrypt a cipher-text encrypted with other's public key if and only if the two users are within a certain distance. Thus, any node can easily take over message forwarding if its neighbor node fails. At last, AFATOR uses smallest key storage and leaks less information about the responder.

50

Reference

[1] Eng Keong Lua, Jon Crowcroft, Marcelo Pias, Ravi Sharma and Steven Lim, “A Survey and Comparison of Peer-to-Peer Overlay Network Schemes,” IEEE Communications survey and tutorial, Mar. 2004.

[2] Yingwu Zhu and Yiming Hu, “SurePath: An Approach to Resilient Anonymous Routing,” International Journal of Network Security (IJNS) Mar.

2008.

[3] Paul F. Syverson, David M. Goldschlag, and Michael G. Reed, “Anonymous Connections and Onion Routing,” IEEE Journal on Selected Areas in Communication Special Issue, 1998.

[4] Sahai and B. Waters, “Fuzzy Identity-Based Encryption,” In Eurocrypt 2005, LNCS 3494, pp. 457-473, Springer-Verlag, 2005.

[5] Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, and Hari Balakrishnan, “Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications,” IEEE/ACM Transactions on Networking.

[6] Ben Y. Zhao, John Kubiatowicz, and Anthony D. Joseph, “Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing,” UC Berkeley, 2001.

[7] A. Rowstron and P. Druschel, “Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,” In Middleware, November 2001.

[8] Ben Y. Zhao, Ling Huang, Jeremy Stribling, Anthony D. Joseph, and John D.

Kubiatowicz, “Exploiting Routing Redundancy via Structured Peer-to-Peer

51

Overlays,” ICNP, 2003.

[9] Adi Shamir, “Identity-Based Cryptosystems and Signature Schemes,”

Advances in Cryptology, Lecture Notes in Computer Science, 1984

[10] Dan Boneh, and Matthew Franklin, “Identity-based Encryption from the Weil pairing,” In J. Kilian, editor, Advances in Cryptology, Springer-Verlag, Lecture Notes in Computer Science, pp. 213-229, 2001.

[11] Li Zhuang, Feng Zhou, Ben Y. Zhao, and Antony Rowstron, “Cashmere:

Resilient Anonymous Routing,” NSDI, 2005.

[12] Aameek Singh, Bugra Gedik, Ling Liu, “Agyaat: Mutual Anonymity over Structured P2P Networks,” In Emerald Internet Research Journal (Special Issue on Privacy and Anonymity in the Digital Era), Volume-16, Issue-2, 2006.

[13] Michael J. Freedman and Robert Morris, “Tarzan: a peer-to-peer anonymizing network layer,” ACM CCS, Nov. 2002.

[14] Michael K. Reiter and Aviel D. Rubin, “Crowds: anonymity for Web transactions,” ACM Transactions on Information and System Security, 1998.

[15] Nikita Borisov, and Jason Waddle, “Anonymity in Structured Peer-to-Peer Overlay Networks,” Technical report, UC Berkeley, May 2005.

[16] Michael Kinateder, Ralf Terdic, and Kurt Rothermel, “Strong pseudonymous communication for peer-to-peer reputation systems,” ACM symposium on Applied computing, Mar. 2005.

[17] Roger Dingledine, Nick Mathewson, and Paul Syverson, “Tor: The Second-Generation Onion Router,” USENIX Security Symposium, Aug. 2004.

[18] Giuseppe Ciaccio, “Recipient Anonymity in a Structured Overlay,”

AICT-ICIW, Feb. 2006.

[19] M. Caesar, M. Castro, E. Nightingale, G. O'Shea and A. Rowstron, “Virtual

52

Ring Routing: Network routing inspired by DHTs,” Sigcomm, Sep. 2006.

[20] M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. Wallach, “Secure routing for structured peer-to-peer overlay networks,” In OSDI, December 2002.

[21] B. Ford, “Unmanaged Internet Protocol: Taming the edge network management crisis,” In HotNets II, November 2003.

[22] M. Choudary Gorantla, Raju Gangishetti, and Ashutosh Saxena, “A Survey on ID-Based Cryptographic Primitives,” Cryptology ePrint Archive: Report 2005/094. http://eprint.iacr.org/2005/094.

[23] J. Baek, W. Susilo and J. Zhou, “New Constructions of Fuzzy Identity-Based Encryption,” ASIACCS, Mar. 2007.

[24] Khanh V. Nguyen, “Simplifying Peer-to-Peer Device Authentication Using Identity-Based Cryptography,” ICNS 2006.

[25] Charles, “Information Leak in the Chord Lookup Protocol,” Peer-to-Peer Computing, 2004.

[26] Souvik Ray and Zhao Zhang, “An Information-Theoretic Framework for Analyzing Leak of Privacy in Distributed Hash Tables,” Peer-to-Peer Computing, Sept. 2007.

[27] Youn-Ho Lee, Heeyoul Kim, Byungchun Chung, Jaewon Lee and Hyunsoo Yoon,

“On-demand Secure Routing Protocol for Ad Hoc Network using ID based Cryptosystem,” PDCAT, 2003.

[28] Song Hong, Yang Luming, Wang Weiping, and Duan Guihua, “A Delay Demand-based Anonymous Communication Mechanism,” Communications and Networking in China, Oct. 2006.

[29] Wei Ren, Yoohwan Kim, Ju-Yeon Jo, Mei Yang and Yingtao Jiang, “IdSRF:

53

ID-based Secure Routing Framework for Wireless Ad-Hoc Networks,” ITNG, 2007.

[30] Gnutella (2002), available at: http://gnutella.wego.com/

[31] Paul Syverson, Gene Tsudik, Michael Reed, and Carl Landwehr, “Towards an analysis of onion routing security,” In Proc. of PET, July 2001.

[32] K. Bauer, D. McCoy, D. Grunwald, T. Kohno, and D. Sicker, “Low-resource routing attacks against anonymous systems,” Technical Report CU-CS-1025-07, University of Colorado at Boulder, Feb 2007.

[33] Geng Yang, Chunming Rong, Christian Veigner, Jiangtao Wang, Hongbing Cheng, “Identity-Based Key Agreement and Encryption for Wireless Sensor Networks,” IJCSNS, May 2006.

[34] Napster, available at http://www.napster.com/

[35] P. Maymounkov and D. Mazieres, “Kademlia: A Peer-to-Peer Information System Based on the XOR Metric,” Proc. IPTPS, Cambridge, MA, USA, Feb.

2002, pp. 53–65.

[36] I. Clarke et al., “Freenet: A Distributed Anonymous Information Storage and Retrieval System,” available at http://freenetproject.org/ freenet.pdf, 1999.

[37] FastTrack Peer-to-Peer Technology Company, available at http://www.fasttrack.nu/, 2001.

[38] The Overnet File-sharing Network, available at http://www.overnet.com/, 2002.

[39] G. Ciaccio. The NEBLO homepage, available at

http://www.disi.unige.it/project/neblo/.

[40] G. Ciaccio, “Improving sender anonymity in a structured overlay with imprecise routing,” In Proceedings of the Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability,

54

2006.

[41] Matthew Pirretti, Patrick Traynor, Patrick McDaniel and Brent Waters, “Secure attribute-based systems,” In Proc. of the ACM conference on Computer and communications security, 2006.

[42] Bartolini, S. and Branovic, I. and Giorgi, R. and Martinelli, E., “A Performance Evaluation of ARM ISA Extension for Elliptic Curve Cryptography over Binary Finite Fields,” Computer Architecture and High Performance Computing, 2004.

[43] Wright, M., Adler, M., Levine, B. N., and Shields, C. “An analysis of the degradation of anonymous protocols,” In Proc. of NDSS (Feb 2002).

[44] Eberle, H. and Gura, N. and Shantz, S.C. and Gupta, V. and Rarick, L. and Sundaram, S., “A public-key cryptographic processor for RSA and ECC,”

Application-Specific Systems, Architectures and Processors, 2004.