{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T20:54:23Z","timestamp":1761252863634},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452680"},{"type":"electronic","value":"9783642452697"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45269-7_5","type":"book-chapter","created":{"date-parts":[[2013,11,20]],"date-time":"2013-11-20T01:33:47Z","timestamp":1384911227000},"page":"102-126","source":"Crossref","is-referenced-by-count":6,"title":["On the Power of the Adversary to Solve the Node Sampling Problem"],"prefix":"10.1007","author":[{"given":"Emmanuelle","family":"Anceaume","sequence":"first","affiliation":[]},{"given":"Yann","family":"Busnel","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Gambs","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proceedings of the International Conference on Supercomputing (ICS) (2002)","DOI":"10.1145\/514203.514206"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-11476-2_7","volume-title":"Structural Information and Communication Complexity","author":"M. Bertier","year":"2010","unstructured":"Bertier, M., Busnel, Y., Kermarrec, A.-M.: On Gossip and Populations. In: Kutten, S., \u017derovnik, J. (eds.) SIROCCO 2009. LNCS, vol.\u00a05869, pp. 72\u201386. Springer, Heidelberg (2010)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511814068"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database management. In: Proceedings of the 6th ACM Symposium on Principles of Distributed Computing (PODC) (1987)","DOI":"10.1145\/41840.41841"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Massouli\u00e9, L., Merrer, E.L., Kermarrec, A.M., Ganesh, A.: Peer Counting and Sampling in Overlay Networks: Random Walk Methods. In: Proceedings of the 25th Annual Symposium on Principles of Distributed Computing (PODC), pp. 123\u2013132. ACM Press (2006)","DOI":"10.1145\/1146381.1146402"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/TNET.2008.2001730","volume":"17","author":"D. Stutzbach","year":"2009","unstructured":"Stutzbach, D., Rejaie, R., Duffield, N., Sen, S., Willinger, W.: On Unbiased Sampling for Unstructured Peer-to-Peer Networks. IEEE\/ACM Transactions on Networking\u00a017(2), 377\u2013390 (2009)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-45748-8_25","volume-title":"Peer-to-Peer Systems","author":"E. Sit","year":"2002","unstructured":"Sit, E., Morris, R.: Security Considerations for Peer-to-Peer Distributed Hash Tables. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 261\u2013269. Springer, Heidelberg (2002)"},{"key":"#cr-split#-5_CR8.1","doi-asserted-by":"crossref","unstructured":"Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G., Shraer, A.: Brahms: Byzantine Resilient Random Membership Sampling. Computer Networks\u00a053, 2340-2359 (2009)","DOI":"10.1016\/j.comnet.2009.03.008"},{"key":"#cr-split#-5_CR8.2","unstructured":"A former version appeared in the 27th ACM Symposium on Principles of Distributed Computing (PODC) (2008)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Scheideler, C.: Group Spreading: A Protocol for Provably Secure Distributed Name Service. In: Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP) (2004)","DOI":"10.1007\/978-3-540-27836-8_18"},{"issue":"12","key":"5_CR10","doi-asserted-by":"publisher","first-page":"2086","DOI":"10.1016\/j.comnet.2010.03.020","volume":"54","author":"G.P. Jesi","year":"2010","unstructured":"Jesi, G.P., Montresor, A., van Steen, M.: Secure Peer Sampling. Computer Networks\u00a054(12), 2086\u20132098 (2010)","journal-title":"Computer Networks"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Singh, A., Ngan, T.W., Druschel, P., Wallach, D.S.: Eclipse Attacks on Overlay Networks: Threats and Defenses. In: Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM) (2006)","DOI":"10.1109\/INFOCOM.2006.231"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","volume-title":"Peer-to-Peer Systems","author":"J.R. Douceur","year":"2002","unstructured":"Douceur, J.R.: The Sybil Attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 251\u2013260. Springer, Heidelberg (2002)"},{"key":"5_CR13","unstructured":"Awerbuch, B., Scheideler, C.: Towards a Scalable and Robust Overlay Network. In: Proceedings of the 6th International Workshop on Peer-to-Peer Systems (IPTPS) (2007)"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/2185395.2185447","volume":"39","author":"E. Anceaume","year":"2012","unstructured":"Anceaume, E., Ludinard, R., Sericola, B.: Performance evaluation of large-scale dynamic systems. SIGMETRICS Performance Evaluation Review\u00a039(4), 108\u2013117 (2012)","journal-title":"SIGMETRICS Performance Evaluation Review"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Anceaume, E., Brasileiro, F., Ludinard, R., Sericola, B., Tronel, F.: Dependability Evaluation of Cluster-based Distributed Systems. International Journal of Foundations of Computer Science (IJFCS)\u00a05(22) (2011)","DOI":"10.1142\/S0129054111008593"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., van Steen, M.: Gossip-based Peer Sampling. ACM Transaction on Computer System\u00a025(3) (2007)","DOI":"10.1145\/1275517.1275520"},{"key":"5_CR17","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized Rumor Spreading. In: The 41st Annual Symposium on Foundations of Computer Science (FOCS), p. 565. IEEE Computer Society (2000)"},{"issue":"2","key":"5_CR18","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10922-005-4441-x","volume":"13","author":"S. Voulgaris","year":"2005","unstructured":"Voulgaris, S., Gavidia, D., van Steen, M.: CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays. Journal of Network System Management\u00a013(2), 197\u2013217 (2005)","journal-title":"Journal of Network System Management"},{"key":"5_CR19","unstructured":"Zhong, M., Shen, K., Seiferas, J.: Non-uniform Random Membership Management in Peer-to-Peer Networks. In: Proceedings of the 24th Annual Joint Conference of the Computer and Communications Societies (INFOCOM). IEEE Press (2005)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Awan, A., Ferreira, R.A., Jagannathan, S., Grama, A.: Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks. In: Proceedings of the 39th Annual Hawaii International Conference on System Sciences, HICSS (2006)","DOI":"10.1109\/HICSS.2006.126"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.S.: Secure Routing for Structured Peer-to-peer Overlay Networks. In: Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI). ACM (2002)","DOI":"10.1145\/1060289.1060317"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R.M., Shenker, S.: A scalable content-addressable network. In: Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) (2001)","DOI":"10.1145\/383059.383072"},{"issue":"1","key":"5_CR23","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a Scalable Peer-to-Peer Lookup Protocol for Internet Applications. IEEE\/ACM Transaction on Networks\u00a011(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Transaction on Networks"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-540-39989-6_23","volume-title":"Distributed Computing","author":"K. Hildrum","year":"2003","unstructured":"Hildrum, K., Kubiatowicz, J.D.: Asymptotically Efficient Approaches to Fault-tolerance in Peer-to-Peer Networks. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 321\u2013336. Springer, Heidelberg (2003)"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11561071_71","volume-title":"Algorithms \u2013 ESA 2005","author":"A. Fiat","year":"2005","unstructured":"Fiat, A., Saia, J., Young, M.: Making Chord Robust to Byzantine Attacks. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 803\u2013814. Springer, Heidelberg (2005)"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Anceaume, E., Brasileiro, F., Ludinard, R., Ravoaja, A.: PeerCube: an Hypercube-based P2P Overlay Robust against Collusion and Churn. In: Proceedings of the IEEE International Conference on Self-Adaptive and Self-Organizing Systems (2008)","DOI":"10.1109\/SASO.2008.44"},{"key":"5_CR28","unstructured":"Condie, T., Kacholia, V., Sank, S., Hellerstein, J.M., Maniatis, P.: Induced Churn as Shelter from Routing-Table Poisoning. In: Proceedings of the International Network and Distributed System Security Symposium (NDSS) (2006)"},{"key":"5_CR29","unstructured":"Liu, D., Ning, P., Du, W.: Detecting Malicious Beacon Nodes for Secure Location Discovery in Wireless Sensor Networks. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS) (2005)"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-642-17653-1_5","volume-title":"Principles of Distributed Systems","author":"E. Anceaume","year":"2010","unstructured":"Anceaume, E., Busnel, Y., Gambs, S.: Uniform and Ergodic Sampling in Unstructured Peer-to-Peer Systems with Malicious Nodes. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol.\u00a06490, pp. 64\u201378. Springer, Heidelberg (2010)"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Anceaume, E., Busnel, Y., Gambs, S.: Characterizing the adversarial power in uniform and ergodic node sampling. In: Proceedings of the 1st International Workshop on Algorithms and Models for Distributed Event Processing (AlMoDEP). ACM Press (2011)","DOI":"10.1145\/2031792.2031795"},{"issue":"8","key":"5_CR32","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1016\/j.jpdc.2011.01.009","volume":"71","author":"Y. Busnel","year":"2011","unstructured":"Busnel, Y., Beraldi, R., Baldoni, R.: On the Uniformity of Peer Sampling based on View Shuffling. Elsevier Journal of Parallel and Distributed Computing\u00a071(8), 1165\u20131176 (2011)","journal-title":"Elsevier Journal of Parallel and Distributed Computing"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Gurevich, M., Keidar, I.: Correctness of Gossip-Based Membership under Message Loss. In: Proceedings of the 28th Annual Symposium on Principles of Distributed Computing (PODC). ACM Press, Calgary (2009)","DOI":"10.1145\/1582716.1582743"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Yu, H., Gibbons, P.B., Kaminsky, M., Xiao, F.: SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks. In: Proceedings of the IEEE Symposium on Security and Privacy (SP) (2008)","DOI":"10.1109\/SP.2008.13"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Yu, H., Kaminsky, M., Gibbons, P.B., Flaxman, A.: SybilGuard: Defending against Sybil Attacks via Social Networks. In: Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) (2006)","DOI":"10.1145\/1159913.1159945"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Godfrey, P.B., Shenker, S., Stoica, I.: Minimizing churn in distributed systems. In: Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) (2006)","DOI":"10.1145\/1159913.1159931"},{"key":"5_CR37","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of information theory","author":"T. Cover","year":"1991","unstructured":"Cover, T., Thomas, J.: Elements of information theory. Wiley, New York (1991)"},{"issue":"1","key":"5_CR38","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1111\/j.2517-6161.1966.tb00626.x","volume":"28","author":"S.M. Ali","year":"1966","unstructured":"Ali, S.M., Silvey, S.D.: General Class of Coefficients of Divergence of One Distribution from Another. Journal of the Royal Statistical Society. Series B (Methodological)\u00a028(1), 131\u2013142 (1966)","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Anceaume, E., Busnel, Y.: A distributed information divergence estimation over data streams. IEEE Transactions on Parallel and Distributed Systems\u00a099 (2013) (PrePrints)","DOI":"10.1109\/NCA.2012.16"},{"key":"5_CR40","unstructured":"Monge, G.: M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. Histoire de l\u2019Academie royale des sciences, avec les M\u00e9moires de Math\u00e9matique et de Physique, 666\u2013704 (1781)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Large-Scale Data- and Knowledge-Centered Systems XI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45269-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T12:04:41Z","timestamp":1558699481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45269-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452680","9783642452697"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45269-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}