On the Power of the Adversary to Solve the Node Sampling Problem
暂无分享,去创建一个
[1] S. M. Ali,et al. A General Class of Coefficients of Divergence of One Distribution from Another , 1966 .
[2] Scott Shenker,et al. Epidemic algorithms for replicated database maintenance , 1988, OPSR.
[3] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[4] Richard M. Karp,et al. Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[5] Béla Bollobás,et al. Random Graphs: Notation , 2001 .
[6] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.
[7] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[8] Béla Bollobás,et al. Random Graphs: Preface to the Second Edition , 2001 .
[9] John R. Douceur,et al. The Sybil Attack , 2002, IPTPS.
[10] Robert Tappan Morris,et al. Security Considerations for Peer-to-Peer Distributed Hash Tables , 2002, IPTPS.
[11] Edith Cohen,et al. Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.
[12] Miguel Castro,et al. Secure routing for structured peer-to-peer overlay networks , 2002, OSDI '02.
[13] John Kubiatowicz,et al. Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks , 2003, DISC.
[14] Christian Scheideler,et al. Group Spreading: A Protocol for Provably Secure Distributed Name Service , 2004, ICALP.
[15] Stefano Leonardi,et al. Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, ESA.
[16] Donggang Liu,et al. Detecting Malicious Beacon Nodes for Secure Location Discovery in Wireless Sensor Networks , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).
[17] Ming Zhong,et al. Non-uniform random membership management in peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[18] Maarten van Steen,et al. CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays , 2005, Journal of Network and Systems Management.
[19] Amos Fiat,et al. Making Chord Robust to Byzantine Attacks , 2005, ESA.
[20] Suresh Jagannathan,et al. Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks , 2006, Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06).
[21] Scott Shenker,et al. Minimizing churn in distributed systems , 2006, SIGCOMM.
[22] Atul Singh,et al. Eclipse Attacks on Overlay Networks: Threats and Defenses , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[23] Joseph M. Hellerstein,et al. Induced Churn as Shelter from Routing-Table Poisoning , 2006, NDSS.
[24] Anne-Marie Kermarrec,et al. Peer counting and sampling in overlay networks: random walk methods , 2006, PODC '06.
[25] Michael Kaminsky,et al. SybilGuard: defending against sybil attacks via social networks , 2006, SIGCOMM.
[26] Anne-Marie Kermarrec,et al. Gossip-based peer sampling , 2007, TOCS.
[27] Christian Scheideler,et al. Towards Scalable and Robust Overlay Networks , 2007, IPTPS.
[28] Emmanuelle Anceaume,et al. PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn , 2008, 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems.
[29] Idit Keidar,et al. Brahms: byzantine resilient random membership sampling , 2008, PODC '08.
[30] Arthur Cayley,et al. The Collected Mathematical Papers: On Monge's “Mémoire sur la théorie des déblais et des remblais” , 2009 .
[31] Anne-Marie Kermarrec,et al. On Gossip and Populations , 2009, SIROCCO.
[32] Walter Willinger,et al. On unbiased sampling for unstructured peer-to-peer networks , 2009, TNET.
[33] Joan Jacobs. Correctness of Gossip-Based Membership under Message Loss , 2009 .
[34] Peter Druschel,et al. Peer-to-peer systems , 2010, Commun. ACM.
[35] Emmanuelle Anceaume,et al. Uniform and Ergodic Sampling in Unstructured Peer-to-Peer Systems with Malicious Nodes , 2010, OPODIS.
[36] Feng Xiao,et al. SybilLimit: A Near-Optimal Social Network Defense Against Sybil Attacks , 2010, IEEE/ACM Trans. Netw..
[37] Gian Paolo Jesi,et al. Secure peer sampling , 2010, Comput. Networks.
[38] Emmanuelle Anceaume,et al. Characterizing the adversarial power in uniform and ergodic node sampling , 2011, AlMoDEP '11.
[39] Alan M. Frieze,et al. The Cover Times of Random Walks on Hypergraphs , 2011, SIROCCO.
[40] Bruno Sericola,et al. Dependability Evaluation of Cluster-Based Distributed Systems , 2011, Int. J. Found. Comput. Sci..
[41] Roberto Beraldi,et al. On the uniformity of peer sampling based on view shuffling , 2011, J. Parallel Distributed Comput..
[42] Gade Krishna,et al. A scalable peer-to-peer lookup protocol for Internet applications , 2012 .
[43] Emmanuelle Anceaume,et al. An Information Divergence Estimation over Data Streams , 2012, 2012 IEEE 11th International Symposium on Network Computing and Applications.
[44] Bruno Sericola,et al. Performance evaluation of large-scale dynamic systems , 2012, PERV.
[45] Emmanuelle Anceaume,et al. A Distributed Information Divergence Estimation over Data Streams , 2014, IEEE Transactions on Parallel and Distributed Systems.