Looking up data in P2P systems
Communications of the ACM
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
PIC: Practical Internet Coordinates for Distance Estimation
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Network-Aware Overlays with Network Coordinates
ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
Real attacks on virtual networks: Vivaldi out of tune
Proceedings of the 2006 SIGCOMM workshop on Large-scale attack defense
A network positioning system for the internet
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
On the accuracy of embeddings for internet coordinate systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Designing a DHT for low latency and high throughput
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Securing internet coordinate embedding systems
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Towards application-aware anonymous routing
HOTSEC'07 Proceedings of the 2nd USENIX workshop on Hot topics in security
A reputation-based approach for securing vivaldi embedding system
EUNICE'07 Proceedings of the 13th open European summer school and IFIP TC6.6 conference on Dependable and adaptable networks and services
Distributed algorithms for stable and secure network coordinates
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Prestige-based peer sampling service: interdisciplinary approach to secure gossip
Proceedings of the 2009 ACM symposium on Applied Computing
Scalable Link-Based Relay Selection for Anonymous Routing
PETS '09 Proceedings of the 9th International Symposium on Privacy Enhancing Technologies
SLINCS: a social link based evaluation system for network coordinate systems
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Sniper: social-link defense for network coordinate systems
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Computer Networks: The International Journal of Computer and Telecommunications Networking
EigenSpeed: secure peer-to-peer bandwidth evaluation
IPTPS'09 Proceedings of the 8th international conference on Peer-to-peer systems
Census: location-aware membership management for large-scale distributed systems
USENIX'09 Proceedings of the 2009 conference on USENIX Annual technical conference
Veracity: practical secure network coordinates via vote-based agreements
USENIX'09 Proceedings of the 2009 conference on USENIX Annual technical conference
Robust Decentralized Virtual Coordinate Systems in Adversarial Environments
ACM Transactions on Information and System Security (TISSEC)
| Hi-index | 0.00 |
Decentralized logical coordinate systems have been proposed as a means of estimating network distances. These systems have widespread usage in p2p networks, ranging from neighbor selection to replica placement. Unfortunately, these systems are vulnerable to even a small number of malicious nodes lying about their coordinates or measurements. In this paper, we introduce Veracity, a fully decentralized service for securing network coordinate systems. Unlike prior proposals, Veracity requires neither the presence of a large number of a priori trusted nodes nor the use of network triangle inequality testing. Veracity utilizes a vote-based approach, where all advertised coordinates are independently verified by a minimal set of nodes before being used. Via detailed simulations in p2psim, we demonstrate that Veracity mitigates a variety of known attacks against Vivaldi for moderate sizes of malicious nodes, incurring acceptable communication overhead, and in some cases, even reducing the convergence time of the coordinate system.