Robust distributed name service

Authors:
Baruch Awerbuch;Christian Scheideler
Affiliations:
Department of Computer Science, Johns Hopkins University, Baltimore, MD;Department of Computer Science, Johns Hopkins University, Baltimore, MD
Venue:
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Year:
2004

Citing 16
Cited 7

How to withstand mobile virus attacks (extended abstract)

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Proactive public key and signature systems

Proceedings of the 4th ACM conference on Computer and communications security
Practical Byzantine fault tolerance

OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
The Weak Byzantine Generals Problem

Journal of the ACM (JACM)
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Censorship resistant peer-to-peer content addressable networks

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Revisiting the Paxos Algorithm

WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
The Sybil Attack

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Novel architectures for P2P applications: the continuous-discrete approach

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Optimal-resilience proactive public-key cryptosystems

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
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
Denial of service via algorithmic complexity attacks

SSYM'03 Proceedings of the 12th conference on USENIX Security Symposium - Volume 12
Robust distributed name service

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems

Online collaborative filtering with nearly optimal dynamic regret

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Active and passive techniques for group size estimation in large-scale and dynamic distributed systems

Journal of Systems and Software
Robust random number generation for peer-to-peer systems

Theoretical Computer Science
Load balanced scalable Byzantine agreement through quorum building, with full information

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Robust random number generation for peer-to-peer systems

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Making chord robust to byzantine attacks

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Robust distributed name service

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper suggests a method called Trust-but-Verify that, under certain simplifying assumptions, provides robust distributed name service even under massive adversarial attacks.