{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:17:14Z","timestamp":1743110234112,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176524"},{"type":"electronic","value":"9783642176531"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17653-1_5","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T00:50:47Z","timestamp":1291596647000},"page":"64-78","source":"Crossref","is-referenced-by-count":12,"title":["Uniform and Ergodic Sampling in Unstructured Peer-to-Peer Systems with Malicious Nodes"],"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":"Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., van Steen, M.: Gossip-based Peer Sampling. ACM Transaction on Computer System 25(3) (2007)","DOI":"10.1145\/1275517.1275520"},{"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":"2009","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 (2009)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-540-30183-7_13","volume-title":"Peer-to-Peer Systems III","author":"D.R. Karger","year":"2004","unstructured":"Karger, D.R., Ruhl, M.: Simple Efficient Load Balancing Algorithms for Peer-to-Peer. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol.\u00a03279, pp. 131\u2013140. Springer, Heidelberg (2004)"},{"key":"5_CR4","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), pp. 84\u201395 (2002)","DOI":"10.1145\/514203.514206"},{"key":"5_CR5","first-page":"123","volume-title":"Proceedings of the 25th Annual Symposium on Principles of Distributed Computing (PODC)","author":"L. Massouli\u00e9","year":"2006","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, New York (2006)"},{"key":"5_CR6","first-page":"360","volume-title":"Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","author":"Y. Busnel","year":"2009","unstructured":"Busnel, Y., Beraldi, R., Baldoni, R.: A Formal Characterization of Uniform Peer Sampling Based on View Shuffling. In: Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), pp. 360\u2013365. IEEE Computer Society, Los Alamitos (2009)"},{"key":"5_CR7","volume-title":"Proceedings of the 28th Annual Symposium on Principles of Distributed Computing (PODC)","author":"M. Gurevich","year":"2009","unstructured":"Gurevich, M., Keidar, I.: Correcness of Gossip-Based Membership under Message Loss. In: Proceedings of the 28th Annual Symposium on Principles of Distributed Computing (PODC), Calgary, AL, Canada. ACM Press, New York (2009)"},{"issue":"13","key":"5_CR8","doi-asserted-by":"publisher","first-page":"2288","DOI":"10.1016\/j.comnet.2009.03.017","volume":"53","author":"R. Bakhshi","year":"2009","unstructured":"Bakhshi, R., Gavidia, D., Fokkink, W., van Steen, M.: An Analytical Model of Information Dissemination for a Gossip-based Protocol. Computer Networks\u00a053(13), 2288\u20132303 (2009)","journal-title":"Computer Networks"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1109\/SFCS.2000.892324","volume-title":"the 41st Annual Symposium on Foundations of Computer Science (FOCS)","author":"R. Karp","year":"2000","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, Los Alamitos (2000)"},{"issue":"2","key":"5_CR10","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"},{"issue":"02","key":"5_CR11","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(02), 377\u2013390 (2009)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"5_CR13","volume-title":"Proceedings of the 24th Annual Joint Conference of the Computer and Communications Societies (INFOCOM)","author":"M. Zhong","year":"2005","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, Los Alamitos (2005)"},{"key":"5_CR14","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_CR15","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":"5_CR16","doi-asserted-by":"publisher","first-page":"2340","DOI":"10.1016\/j.comnet.2009.03.008","volume":"53","author":"E. Bortnikov","year":"2009","unstructured":"Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G., Shraer, A.: Brahms: Byzantine Resilient Random Membership Sampling. Computer Networks\u00a053, 2340\u20132359 (2009); A former version appeared in the 27th ACM Symposium on Principles of Distributed Computing (PODC) (2008)","journal-title":"Computer Networks"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-27836-8_18","volume-title":"Automata, Languages and Programming","author":"B. Awerbuch","year":"2004","unstructured":"Awerbuch, B., Scheideler, C.: Group Spreading: A Protocol for Provably Secure Distributed Name Service. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 183\u2013195. Springer, Heidelberg (2004)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Jesi, G.P., Montresor, A., van Steen, M.: Secure Peer Sampling. Computer Networks (2010) (to appear)","DOI":"10.1016\/j.comnet.2010.03.020"},{"key":"5_CR19","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_CR20","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_CR21","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. Douceur","year":"2002","unstructured":"Douceur, J., Donath, J.S.: 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_CR22","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)"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Anceaume, E., Brasileiro, F.V., Ludinard, R., Sericola, B., Tronel, F.: Analytical Study of Adversarial Strategies in Cluster-based Overlays. In: Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), pp. 293\u2013298 (2009)","DOI":"10.1109\/PDCAT.2009.62"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/1060289.1060317","volume-title":"Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI)","author":"M. Castro","year":"2002","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), pp. 299\u2013314. ACM, New York (2002)"},{"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.: 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, pp. 15\u201324 (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","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), pp. 267\u2013278 (2006)","DOI":"10.1145\/1151659.1159945"},{"key":"5_CR30","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), pp. 3\u201317 (2008)","DOI":"10.1109\/SP.2008.13"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17653-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:24:02Z","timestamp":1558293842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17653-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176524","9783642176531"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17653-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}