Fireflies
暂无分享,去创建一个
Robbert van Renesse | Håvard D. Johansen | Dag Johansen | Ymir Vigfusson | R. V. Renesse | H. Johansen | D. Johansen | Ymir Vigfusson
[1] Yishay Mansour,et al. On diffusing updates in a Byzantine environment , 1999, Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems.
[2] William M. Daley,et al. Digital Signature Standard (DSS) , 2000 .
[3] Ozalp Babaoglu,et al. ACM Transactions on Computer Systems , 2007 .
[4] Fan Chung Graham,et al. The Diameter of Sparse Random Graphs , 2001, Adv. Appl. Math..
[5] F. Chung,et al. The Diameter of Random Sparse Graphs , 2000 .
[6] Margo I. Seltzer,et al. Evaluating DHT-Based Service Placement for Stream-Based Overlays , 2005, IPTPS.
[7] Anne-Marie Kermarrec,et al. Peer-to-Peer Membership Management for Gossip-Based Protocols , 2003, IEEE Trans. Computers.
[8] Michael Dahlin,et al. BAR fault tolerance for cooperative services , 2005, SOSP '05.
[9] Robbert van Renesse,et al. Defense against Intrusion in a Live Streaming Multicast System , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).
[10] Paul Barford,et al. Comparing probe-and router-based packet-loss measurement , 2004, IEEE Internet Computing.
[11] Robert Tappan Morris,et al. Tarzan: a peer-to-peer anonymizing network layer , 2002, CCS '02.
[12] Krishna P. Gummadi,et al. Canal: scaling social network-based Sybil tolerance schemes , 2012, EuroSys '12.
[13] Vinay S. Pai,et al. Chainsaw: Eliminating Trees from Overlay Multicast , 2005, IPTPS.
[14] David R. Karger,et al. Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.
[15] Russ Housley,et al. Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile , 2002, RFC.
[16] Prashant Malik,et al. Cassandra: a decentralized structured storage system , 2010, OPSR.
[17] Robbert van Renesse,et al. Fireflies: scalable support for intrusion-tolerant network overlays , 2006, EuroSys.
[18] Prateek Mittal,et al. ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies , 2009, CCS.
[19] Robbert van Renesse,et al. Self-stabilizing and Byzantine-Tolerant Overlay Network , 2007, OPODIS.
[20] Fred B. Schneider,et al. Tolerating malicious gossip , 2003, Distributed Computing.
[21] Idit Keidar,et al. Exposing and eliminating vulnerabilities to denial of service attacks in secure gossip-based multicast , 2004, IEEE Transactions on Dependable and Secure Computing.
[22] Indranil Gupta,et al. Fighting fire with fire: using randomized gossip to combat stochastic scalability limits , 2002 .
[23] Johannes Behl,et al. CheapBFT: resource-efficient byzantine fault tolerance , 2012, EuroSys '12.
[24] Robbert van Renesse,et al. FirePatch: Secure and Time-Critical Dissemination of Software Patches , 2007, SEC.
[25] Werner Vogels,et al. Dynamo: amazon's highly available key-value store , 2007, SOSP.
[26] Gunnar Kreitz,et al. Spotify -- Large Scale, Low Latency, P2P Music-on-Demand Streaming , 2010, 2010 IEEE Tenth International Conference on Peer-to-Peer Computing (P2P).
[27] Larry L. Peterson,et al. The design principles of PlanetLab , 2006, OPSR.
[28] Miguel Castro,et al. SplitStream: high-bandwidth multicast in cooperative environments , 2003, SOSP '03.
[29] Alessio Pace. Gossiping in the wild -- Tackling practical problems faced by gossip protocols when deployed on the Internet ; Quelques défis posés par l'utilisation de protocoles de Gossip dans l'Internet , 2011 .
[30] Idit Keidar,et al. Brahms: byzantine resilient random membership sampling , 2008, PODC '08.
[31] Michael K. Reiter,et al. Efficient update diffusion in byzantine environments , 2001, Proceedings 20th IEEE Symposium on Reliable Distributed Systems.
[32] Rida A. Bazzi,et al. On the establishment of distinct identities in overlay networks , 2005, PODC '05.
[33] F. Harary. THE MAXIMUM CONNECTIVITY OF A GRAPH. , 1962, Proceedings of the National Academy of Sciences of the United States of America.
[34] Daniel Stutzbach,et al. Understanding churn in peer-to-peer networks , 2006, IMC '06.
[35] Rodrigo Rodrigues,et al. When Multi-hop Peer-to-Peer Lookup Matters , 2004, IPTPS.
[36] Michael Dahlin,et al. BAR gossip , 2006, OSDI '06.
[37] A. Trachtenberg,et al. Practical Set Reconciliation , 2002 .
[38] B. Bollobás. The evolution of random graphs , 1984 .
[39] Anjali Gupta,et al. One Hop Lookups for Peer-to-Peer Overlays , 2003, HotOS.
[40] Apu Kapadia,et al. Halo: High-Assurance Locate for Distributed Hash Tables , 2008, NDSS.
[41] Krishna P. Gummadi,et al. The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.
[42] Michael K. Reiter,et al. Secure agreement protocols: reliable and atomic group multicast in rampart , 1994, CCS '94.
[43] Mudhakar Srivatsa,et al. Vulnerabilities and security threats in structured overlay networks: a quantitative analysis , 2004, 20th Annual Computer Security Applications Conference.
[44] Mike Burmester,et al. Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks , 2007, Ad Hoc Networks.
[45] P. Erdos,et al. On the evolution of random graphs , 1984 .
[46] Guillaume Pierre,et al. A survey of DHT security techniques , 2011, CSUR.
[47] Ramakrishna Kotla,et al. Zyzzyva , 2007, SOSP.
[48] Nick Mathewson,et al. Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.
[49] Antony I. T. Rowstron,et al. PAST: a large-scale, persistent peer-to-peer storage utility , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.
[50] Abhinandan Das,et al. SWIM: scalable weakly-consistent infection-style process group membership protocol , 2002, Proceedings International Conference on Dependable Systems and Networks.
[51] Halvar Flake,et al. Structural Comparison of Executable Objects , 2004, DIMVA.
[52] Anne-Marie Kermarrec,et al. Probabilistic Reliable Dissemination in Large-Scale Systems , 2003, IEEE Trans. Parallel Distributed Syst..
[53] Jean-Chrysostome Bolot,et al. Characterizing End-to-End Packet Delay and Loss in the Internet , 1993, J. High Speed Networks.
[54] David Brumley,et al. Automatic Patch-Based Exploit Generation is Possible: Techniques and Implications , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).
[55] Robert Tappan Morris,et al. Security Considerations for Peer-to-Peer Distributed Hash Tables , 2002, IPTPS.
[56] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.
[57] Ben Y. Zhao,et al. OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.
[58] Matthew K. Wright,et al. Salsa: a structured approach to large-scale anonymity , 2006, CCS '06.
[59] David Cooper,et al. Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile , 2008, RFC.
[60] Marko Vukolic,et al. The Next 700 BFT Protocols , 2015, ACM Trans. Comput. Syst..
[61] Miguel Castro,et al. Defending against eclipse attacks on overlay networks , 2004, EW 11.
[62] J. Alex Halderman,et al. Crawling BitTorrent DHTs for Fun and Profit , 2010, WOOT.
[63] John R. Douceur,et al. The Sybil Attack , 2002, IPTPS.
[64] Dirk Fox,et al. Digital Signature Standard (DSS) , 2001, Datenschutz und Datensicherheit.
[65] Joni da Silva Fraga,et al. A lightweight intrusion-tolerant overlay network , 2006, Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06).
[66] Ari Juels,et al. $evwu Dfw , 1998 .
[67] Nicholas Hopper,et al. Scalable onion routing with torsk , 2009, CCS.
[68] Taoufik En-Najjary,et al. Long Term Study of Peer Behavior in the kad DHT , 2009, IEEE/ACM Transactions on Networking.
[69] Louise E. Moser,et al. The SecureRing group communication system , 2001, TSEC.
[70] Anne-Marie Kermarrec,et al. Decentralized polling with respectable participants , 2009, J. Parallel Distributed Comput..