Newton: Securing Virtual Coordinates by Enforcing Physical Laws

Virtual coordinate systems (VCSs) provide accurate estimations of latency between arbitrary hosts on a network, while conducting a small amount of actual measurements and relying on node cooperation. While these systems have good accuracy under benign settings, they suffer a severe decrease of their effectiveness when under attack by compromised nodes acting as insider attackers. Previous defenses mitigate such attacks by using machine learning techniques to differentiate good behavior (learned over time) from bad behavior. However, these defense schemes have been shown to be vulnerable to advanced attacks that make the schemes learn malicious behavior as good behavior. We present Newton, a decentralized VCS that is robust to a wide class of insider attacks. Newton uses an abstraction of a real-life physical system, similar to that of Vivaldi, but in addition uses safety invariants derived from Newton's laws of motion. As a result, Newton does not need to learn good behavior and can tolerate a significantly higher percentage of malicious nodes. We show through simulations and real-world experiments on the PlanetLab testbed that Newton is able to mitigate all known attacks against VCSs while providing better accuracy than Vivaldi, even in benign settings. Finally, we show how to design a VCS that better matches a real physical system, thus allowing for more intuitive and tighter system parameters that are even more difficult to exploit by attackers.

[1]  Miguel Castro,et al.  PIC: practical Internet coordinates for distance estimation , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[2]  Olivier Bonaventure,et al.  A Reputation-Based Approach for Securing Vivaldi Embedding System , 2007, EUNICE.

[3]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[4]  Hui Zhang,et al.  A Network Positioning System for the Internet , 2004, USENIX Annual Technical Conference, General Track.

[5]  T. S. Eugene Ng,et al.  Distributed algorithms for stable and secure network coordinates , 2008, IMC '08.

[6]  Yuval Shavitt,et al.  Big-bang simulation for embedding network distances in Euclidean space , 2004, IEEE/ACM Transactions on Networking.

[7]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[8]  B. Karp,et al.  Reduced State Routing in the Internet ∗ , 2004 .

[9]  Jon Crowcroft,et al.  Lighthouses for Scalable Distributed Location , 2003, IPTPS.

[10]  Radu State,et al.  Securing Application-Level Topology Estimation Networks: Facing the Frog-Boiling Attack , 2011, RAID.

[11]  Neil Spring,et al.  Measurement Manipulation and Space Selection in Network Coordinates , 2008, 2008 The 28th International Conference on Distributed Computing Systems.

[12]  Hui Zhang,et al.  A case for end system multicast (keynote address) , 2000, SIGMETRICS '00.

[13]  Yuval Shavitt,et al.  On the curvature of the Internet and its usage for overlay construction and distance estimation , 2004, IEEE INFOCOM 2004.

[14]  Nicholas Hopper,et al.  Accurate and Provably Secure Latency Estimation with Treeple , 2011, NDSS.

[15]  Robert Tappan Morris,et al.  Greedy Virtual Coordinates for Geographic Routing , 2007, 2007 IEEE International Conference on Network Protocols.

[16]  Margo I. Seltzer,et al.  Wired Geometric Routing , 2007, IPTPS.

[17]  Mark Crovella,et al.  Virtual landmarks for the internet , 2003, IMC '03.

[18]  Paul Francis,et al.  IDMaps: a global internet host distance estimation service , 2001, TNET.

[19]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[20]  Dan R. K. Ports,et al.  Census: Location-Aware Membership Management for Large-Scale Distributed Systems , 2009, USENIX Annual Technical Conference.

[21]  Ling Huang,et al.  ANTIDOTE: understanding and defending against poisoning of anomaly detectors , 2009, IMC '09.

[22]  Cristina Nita-Rotaru,et al.  On the accuracy of decentralized virtual coordinate systems in adversarial networks , 2007, CCS '07.

[23]  Margo I. Seltzer,et al.  Network Coordinates in the Wild , 2007, NSDI.

[24]  Walid Dabbous,et al.  Securing internet coordinate embedding systems , 2007, SIGCOMM '07.

[25]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[26]  Andreas Haeberlen,et al.  PeerReview: practical accountability for distributed systems , 2007, SOSP.

[27]  Micah Sherr,et al.  Veracity: Practical Secure Network Coordinates via Vote-based Agreements , 2009, USENIX Annual Technical Conference.

[28]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[29]  Yijie Wang,et al.  HyperSpring: Accurate and Stable Latency Estimation in the Hyperbolic Space , 2009, 2009 15th International Conference on Parallel and Distributed Systems.

[30]  Steven Lerman,et al.  PCoord: network position estimation using peer-to-peer measurements , 2004, Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings..

[31]  Walid Dabbous,et al.  Virtual networks under attack: disrupting internet coordinate systems , 2006, CoNEXT '06.

[32]  Ramesh Govindan,et al.  RSR: Reduced-State Routing in the Internet , 2004, SIGCOMM 2004.

[33]  Yongdae Kim,et al.  The Frog-Boiling Attack: Limitations of Anomaly Detection for Secure Network Coordinate Systems , 2009, SecureComm.

[34]  Steven Lerman,et al.  A Decentralized Network Coordinate System for Robust Internet Distance , 2006, Third International Conference on Information Technology: New Generations (ITNG'06).

[35]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..