Induced Churn as Shelter from Routing-Table Poisoning
暂无分享,去创建一个
Joseph M. Hellerstein | Petros Maniatis | Tyson Condie | Varun Kacholia | Sriram Sank | J. Hellerstein | Tyson Condie | Petros Maniatis | V. Kacholia | Sriram Sank
[1] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[2] Don Davis. Compliance Defects in Public Key Cryptography , 1996, USENIX Security Symposium.
[3] Miguel Castro,et al. Proactive recovery in a Byzantine-fault-tolerant system , 2000, OSDI.
[4] Jan Willemson,et al. Improving the Availability of Time-Stamping Services , 2001, ACISP.
[5] Peter Druschel,et al. Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .
[6] David R. Karger,et al. Wide-area cooperative storage with CFS , 2001, SOSP.
[7] Antony I. T. Rowstron,et al. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.
[8] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[9] Mary Baker,et al. Secure History Preservation Through Timeline Entanglement , 2002, USENIX Security Symposium.
[10] Dan S. Wallach,et al. A Survey of Peer-to-Peer Security Issues , 2002, ISSS.
[11] John R. Douceur,et al. The Sybil Attack , 2002, IPTPS.
[12] Hari Balakrishnan,et al. Resilient overlay networks , 2001, SOSP.
[13] Robert Tappan Morris,et al. Security Considerations for Peer-to-Peer Distributed Hash Tables , 2002, IPTPS.
[14] David R. Karger,et al. Observations on the Dynamic Evolution of Peer-to-Peer Networks , 2002, IPTPS.
[15] Krishna P. Gummadi,et al. King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.
[16] Miguel Castro,et al. Secure routing for structured peer-to-peer overlay networks , 2002, OSDI '02.
[17] Angelos D. Keromytis,et al. Countering code-injection attacks with instruction-set randomization , 2003, CCS '03.
[18] Krishna P. Gummadi,et al. The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.
[19] David R. Karger,et al. Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.
[20] David Mazières,et al. Democratizing Content Publication with Coral , 2004, NSDI.
[21] Srinivasan Seshan,et al. Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM '04.
[22] John Kubiatowicz,et al. Handling churn in a DHT , 2004 .
[23] Christian Scheideler,et al. Group Spreading: A Protocol for Provably Secure Distributed Name Service , 2004, ICALP.
[24] Scott Shenker,et al. Enhancing P2P File-Sharing with an Internet-Scale Query Processor , 2004, Very Large Data Bases Conference.
[25] George Candea,et al. Microreboot - A Technique for Cheap Recovery , 2004, OSDI.
[26] Miguel Castro,et al. Defending against eclipse attacks on overlay networks , 2004, EW 11.
[27] Victor Shoup,et al. Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography , 2000, Journal of Cryptology.
[28] Christian Scheideler,et al. How to spread adversarial nodes?: rotate! , 2005, STOC '05.
[29] Scott Shenker,et al. Fixing the Embarrassing Slowness of OpenDHT on PlanetLab , 2005, WORLDS.
[30] David R. Karger,et al. OverCite: A Cooperative Digital Research Library , 2005, IPTPS.
[31] Joseph M. Hellerstein,et al. Maelstrom: Churn as shelter , 2005 .
[32] Brighten Godfrey,et al. OpenDHT: a public DHT service and its uses , 2005, SIGCOMM '05.
[33] Bill N. Schilit,et al. Place Lab: Device Positioning Using Radio Beacons in the Wild , 2005, Pervasive.