Abstract
Given current research initiatives advocating “clean slate” Internet designs, researchers have the opportunity to design an internetwork layer routing protocol that provides efficient anonymity by decoupling identity from network location. Prior work in anonymity for the next-generation Internet fully trusts the user’s ISP. We propose Dovetail, which provides anonymity against an active attacker located at any single point within the network, including the user’s ISP. A major design challenge is to provide this protection without including an applicationlayer proxy in data transmission. We address this in path construction by using a matchmaker node (an end host) to overlap two path segments at a dovetail node (a router). The dovetail then trims away part of the path so that data transmission bypasses the matchmaker. We develop a systematic mechanism to measure the topological anonymity of our designs, and we demonstrate their privacy and efficiency by Internet-scale simulations at the AS-level.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Reiter, M., Rubin, A.: Crowds: Anonymity for web transactions. ACM ToISS (1998)
Dingledine, R., Mathewson, N., Syverson, P.: Tor: The second-generation onion router. In: USENIX Security (2004)
The Tor Project, Inc.: Tor metrics portal: Users, https://metrics.torproject.org/users.html (accessed: February 11, 2014)
Paul, S., Pan, J., Jain, R.: Architectures for the future networks and the next generation internet: A survey. Computer Communications (2011)
The National Science Foundation: NSF NeTS FIND initiative, http://www.nets-find.net/index.php (accessed: February 11, 2014)
CORDIS: FIRE home page, http://cordis.europa.eu/fp7/ict/fire/home_en.html (accessed: February 11, 2014)
National Institute of Information and Communications Technology: “AKARI” architecture design project for new generation network, http://www.nict.go.jp/en/photonic_nw/archi/akari/akari-top_e.html (accessed: February 11, 2014)
Papadopoulos, F., Krioukov, D., Bogua, M., Vahdat, A.: Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces. In: IEEE INFOCOM (2010)
Bhattacharjee, B., Calvert, K., Griffioen, J., Spring, N., Sterbenz, J.P.: Postmodern internetwork architecture. NSF Nets FIND Initiative (2006)
Godfrey, P.B., Ganichev, I., Shenker, S., Stoica, I.: Pathlet routing. In: ACM SIGCOMM (2009)
Farinacci, D., Lewis, D., Meyer, D., Fuller, V.: The locator/ID separation protocol (LISP). RFC 6830 (2013)
Yang, X., Wetherall, D.: Source selectable path diversity via routing deflections. ACM SIGCOMM Computer Communication Review (2006)
Yang, X.: NIRA: A new internet routing architecture. In: ACM SIGCOMM FDNA (2003)
Zhang, X., Hsiao, H.C., Hasker, G., Chan, H., Perrig, A., Andersen, D.G.: SCION: Scalability, control, and isolation on next-generation networks. In: IEEE S&P (2011)
Falk, A.: GENI at a glance (2011), http://www.geni.net/wp-content/uploads/2011/06/GENI-at-a-Glance-1Jun2011.pdf
Hsiao, H.C., Kim, T.J., Perrig, A., Yamada, A., Nelson, S.C., Gruteser, M., Meng, W.: LAP: Lightweight anonymity and privacy. In: IEEE S&P (2012)
Pfitzmann, A., Hansen, M.: A terminology for talking about privacy by data minimization, v0.34 (2010), http://dud.inf.tu-dresden.de/literatur/Anon_Terminology_v0.34.pdf
Kaufman, C., Hoffman, P., Nir, Y., Eronen, P.: Internet Key Exchange Protocol Version 2 (IKEv2). RFC 5996 (Proposed Standard), Updated by RFCs 5998, 6989 (September 2010)
Eckersley, P.: How unique is your web browser? In: Atallah, M.J., Hopper, N.J. (eds.) PETS 2010. LNCS, vol. 6205, pp. 1–18. Springer, Heidelberg (2010)
Soltani, A., Canty, S., Mayo, Q., Thomas, L., Hoofnagle, C.J.: Flash cookies and privacy. In: SSRN eLibrary (2009)
Acquisti, A., Dingledine, R., Syverson, P.: On the economics of anonymity. In: Wright, R.N. (ed.) FC 2003. LNCS, vol. 2742, pp. 84–102. Springer, Heidelberg (2003)
Dingledine, R., Murdoch, S.J.: Performance improvements on Tor or, why Tor is slow and what we’re going to do about it (2009), http://www.torproject.org/press/presskit/2009-03-11-performance.pdf
Jansen, R., Johnson, A., Syverson, P.: LIRA: Lightweight Incentivized Routing for Anonymity. In: NDSS (2013)
Dischinger, M., Haeberlen, A., Gummadi, K.P., Saroiu, S.: Characterizing residential broadband networks. In: ACM SIGCOMM IMC (2007)
Levine, B.N., Reiter, M.K., Wang, C.-X., Wright, M.: Timing attacks in low-latency mix systems. In: Juels, A. (ed.) FC 2004. LNCS, vol. 3110, pp. 251–265. Springer, Heidelberg (2004)
Houmansadr, A., Kiyavash, N., Borisov, N.: RAINBOW: A robust and invisible non-blind watermark for network flows. In: NDSS (2009)
Chen, S., Wang, X., Jajodia, S.: On the anonymity and traceability of peer-to-peer voip calls. IEEE Network 20(5), 32–37 (2006)
Reimer, J.: Your ISP may be selling your web clicks (2007), http://arstechnica.com/tech-policy/2007/03/your-isp-may-be-selling-your-web-clicks/
Dampier, P.: ‘Cable ONE spied on customers’ alleges federal class action lawsuit (2012), http://stopthecap.com/2010/02/08/cable-one-spied-on-customers-alleges-federal-class-action-lawsuit
Syverson, P.: Why I’m not an entropist. In: Christianson, B., Malcolm, J.A., Matyáš, V., Roe, M. (eds.) Security Protocols 2009. LNCS, vol. 7028, pp. 213–230. Springer, Heidelberg (2013)
Murdoch, S.J., Zieliński, P.: Sampled traffic analysis by internet-exchange-level adversaries. In: Borisov, N., Golle, P. (eds.) PET 2007. LNCS, vol. 4776, pp. 167–183. Springer, Heidelberg (2007)
Boyan, J.: The anonymizer. Computer-Mediated Communication Magazine (1997)
Panchenko, A., Pimenidis, L., Renner, J.: Performance analysis of anonymous communication channels provided by Tor. In: ARES (2008)
DiBenedetto, S., Gasti, P., Tsudik, G., Uzun, E.: ANDaNA: Anonymous named data networking application. In: NDSS (2013)
Gao, L.: On inferring autonomous system relationships in the internet. In: IEEE/ACM ToN (2001)
Giotsas, V., Zhou, S.: Valley-free violation in internet routing-analysis based on BGP community data. In: IEEE ICC (2012)
Ryan, P.S., Gerson, J.: A primer on Internet exchange points for policymakers and non-engineers (August 2012), http://ssrn.com/abstract=2128103
Lodhi, A., Dhamdhere, A., Dovrolis, C.: Open peering by Internet transit providers: Peer preference or peer pressure? In: Proc. IEEE INFOCOM (2014)
Rekhter, Y., Li, T., Hares, S.: A border gateway protocol 4 (BGP-4). RFC 4271 (2006)
Sankey, J., Wright, M.: Dovetail: Stronger anonymity in next-generation internet routing (April 2014), http://www.jsankey.com/papers/Dovetail.pdf
Borisov, N., Danezis, G., Mittal, P., Tabriz, P.: Denial of service or denial of security? In: CCS (2007)
Wright, M.K., Adler, M., Levine, B.N., Shields, C.: Passive-logging attacks against anonymous communications systems. ACM Transactions on Information and System Security (TISSEC) 11(2) (2008)
Chen, S., Wang, R., Wang, X., Zhang, K.: Side-channel leaks in web applications: A reality today, a challenge tomorrow. In: IEEE S&P (2010)
Mittal, P., Khurshid, A., Juen, J., Caesar, M., Borisov, N.: Stealthy traffic analysis of low-latency anonymous communication using throughput fingerprinting. In: ACM CCS (2011)
Hopper, N., Vasserman, E.Y., Chan-Tin, E.: How much anonymity does network latency leak? In: ACM CCS (2007)
Murdoch, S.J., Danezis, G.: Low-cost traffic analysis of Tor. In: IEEE S&P (2005)
Evans, N., Dingledine, R., Grothoff, C.: A practical congestion attack on Tor using long paths. In: USENIX Security (2009)
CAIDA: The CAIDA UCSD inferred AS relationships - 20120601 (2012), http://www.caida.org/data/active/as-relationships/index.xml
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Sankey, J., Wright, M. (2014). Dovetail: Stronger Anonymity in Next-Generation Internet Routing. In: De Cristofaro, E., Murdoch, S.J. (eds) Privacy Enhancing Technologies. PETS 2014. Lecture Notes in Computer Science, vol 8555. Springer, Cham. https://doi.org/10.1007/978-3-319-08506-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-08506-7_15
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08505-0
Online ISBN: 978-3-319-08506-7
eBook Packages: Computer ScienceComputer Science (R0)