Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Rodrigues, Petr Kouznetsov, Bobby Bhattacharjee (2007)
Large-scale byzantine fault tolerance: safe but not always live
Arjun Nambiar, M. Wright (2006)
Salsa: a structured approach to large-scale anonymity
(2006)
Scheideler . Towards a scalable and robust DHT
R. Rodrigues, B. Liskov (2003)
Rosebud: A Scalable Byzantine-Fault-Tolerant Storage Architecture
R. Rodrigues, B. Liskov, L. Shrira (2002)
The design of a robust peer-to-peer system
K. Kihlstrom, L. Moser, P. Melliar-Smith (1998)
The SecureRing protocols for securing group communicationProceedings of the Thirty-First Hawaii International Conference on System Sciences, 3
Maxwell Young, Aniket Kate, I. Goldberg, M. Karsten (2010)
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary2010 IEEE 30th International Conference on Distributed Computing Systems
Jian Yin, Jean-Philippe Martin, A. Venkataramani, L. Alvisi, M. Dahlin (2003)
Separating agreement from execution for byzantine fault tolerant services
V. Shoup (2000)
Practical Threshold Signatures
M. Castro (1999)
Practical Byzantine fault tolerance
(2011)
The price of equivocation: Characterizing Byzantine agreement via hypergraph coloring
Allen Clement, Manos Kapritsos, Sangmin Lee, Yang Wang, L. Alvisi, M. Dahlin, Taylor Riché (2009)
Upright cluster services
John Douceur (2002)
The Sybil Attack
M. Naor, Udi Wieder (2003)
Novel architectures for P2P applications: the continuous-discrete approach
Apu Kapadia, Nikos Triandopoulos (2008)
Halo: High-Assurance Locate for Distributed Hash Tables
A. Fiat, Jared Saia, Maxwell Young (2005)
Making Chord Robust to Byzantine Attacks
James Cowling, Dan Ports, B. Liskov, R. Popa, A. Gaikwad (2009)
Census: Location-Aware Membership Management for Large-Scale Distributed Systems
H. Johansen, A. Allavena, R. Renesse (2006)
Fireflies: scalable support for intrusion-tolerant network overlaysProceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Prateek Mittal, N. Borisov (2009)
ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies
David Karger, E. Lehman, F. Leighton, R. Panigrahy, Matthew Levine, D. Lewin (1994)
Randomness in Distributed Protocols
R. Rodrigues (2005)
Robust services in dynamic systems
(2006)
Myrmic: Provably secure and efficient DHT routing
C. Scheideler (2005)
How to spread adversarial nodes?: rotate!
Indranil Gupta, K. Birman, Prakash Linga, A. Demers, R. Renesse (2003)
Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead
Aniket Kate, I. Goldberg (2009)
Distributed Key Generation for the Internet2009 29th IEEE International Conference on Distributed Computing Systems
Atul Singh, T. Ngan, P. Druschel, D. Wallach (2006)
Eclipse Attacks on Overlay Networks: Threats and DefensesProceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
B. Awerbuch, C. Scheideler (2004)
Group Spreading: A Protocol for Provably Secure Distributed Name Service
R. Kotla, L. Alvisi, M. Dahlin, Allen Clement, Edmund Wong (2007)
Zyzzyva: speculative byzantine fault toleranceACM Trans. Comput. Syst., 27
Byung-Gon Chun, Petros Maniatis, S. Shenker, J. Kubiatowicz (2007)
Attested append-only memory: making adversaries stick to their word
T. Rabin, M. Ben-Or (1989)
Verifiable secret sharing and multiparty protocols with honest majority
B. Awerbuch, C. Scheideler (2006)
Robust random number generation for peer-to-peer systemsTheor. Comput. Sci., 410
Scott Wolchok, O. Hofmann, N. Heninger, E. Felten, J. Halderman, C. Rossbach, Brent Waters, E. Witchel (2010)
Defeating Vanish with Low-Cost Sybil Attacks Against Large DHTs
Scott Crosby, D. Wallach (2003)
Denial of Service via Algorithmic Complexity Attacks
M. Reiter (1994)
The Rampart Toolkit for Building High-Integrity Services
Kirsten Hildrum, J. Kubiatowicz (2003)
Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks
Jared Saia, Maxwell Young (2008)
Reducing communication costs in robust peer-to-peer networksInf. Process. Lett., 106
L. Lamport (2006)
Lower bounds for asynchronous consensusDistributed Computing, 19
M. Castro, P. Druschel, A. Ganesh, A. Rowstron, D. Wallach (2002)
Secure routing for structured peer-to-peer overlay networksACM SIGOPS Operating Systems Review, 36
M. Srivatsa, Ling Liu (2004)
Vulnerabilities and security threats in structured overlay networks: a quantitative analysis20th Annual Computer Security Applications Conference
J. Kubiatowicz, D. Bindel, Yan Chen, S. Czerwinski, Patrick Eaton, Dennis Geels, R. Gummadi, Sean Rhea, Hakim Weatherspoon, Westley Weimer, C. Wells, Ben Zhao (2000)
OceanStore: an architecture for global-scale persistent storage
A. Adya, W. Bolosky, M. Castro, Gerald Cermak, R. Chaiken, John Douceur, Jon Howell, Jacob Lorch, M. Theimer, Roger Wattenhofer
Proceedings of the 5th Symposium on Operating Systems Design and Implementation Farsite: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment
Harry Li, Allen Clement, Mirco Marchetti, Manos Kapritsos, L. Robison, L. Alvisi, M. Dahlin (2008)
FlightPath: Obedience vs. Choice in Cooperative Services
Dave Levin, John Douceur, Jacob Lorch, T. Moscibroda (2009)
TrInc: Small Trusted Hardware for Large Distributed Systems
F. Schneider (1990)
Implementing fault-tolerant services using the state machine approach: a tutorialACM Comput. Surv., 22
B. Awerbuch, C. Scheideler (2007)
Towards Scalable and Robust Overlay Networks
N/A
ACM SIGOPS Operating Systems Review – Association for Computing Machinery
Published: Feb 16, 2012
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.