{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:03:34Z","timestamp":1767337414030,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207976"},{"type":"electronic","value":"9783642207983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20798-3_3","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T07:01:07Z","timestamp":1303887667000},"page":"25-39","source":"Crossref","is-referenced-by-count":4,"title":["Defending against Sybil Nodes in BitTorrent"],"prefix":"10.1007","author":[{"given":"Jung Ki","family":"So","sequence":"first","affiliation":[]},{"given":"Douglas S.","family":"Reeves","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"The bittorrent protocol specification, http:\/\/wiki.theory.org\/BitTorrentSpecification"},{"key":"3_CR2","unstructured":"Schulze, H., Mochalski, K.: Ipoque. internet study (2008\/2009), http:\/\/www.ipoque.com\/study\/ipoque-Internet-Study-08-09.pdf"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Konrath, M.A., Barcellos, M.P., Mansilha, R.B.: Attacking a swarm with a band of liars: evaluating the impact of attacks on bittorrent. In: P2P Computing, pp. 37\u201344 (2007)","DOI":"10.1109\/P2P.2007.14"},{"issue":"17","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1016\/j.comcom.2009.07.006","volume":"32","author":"P. Dhungel","year":"2009","unstructured":"Dhungel, P., Wu, D., Ross, K.W.: Measurement and mitigation of bittorrent leecher attacks. Computer Communication\u00a032(17), 1852\u20131861 (2009)","journal-title":"Computer Communication"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Wang, Q., Vu, L., Nahrstedt, K., Khurana, H.: Mis: malicious nodes identification scheme in network-coding-based peer-to-peer streaming. In: INFOCOM 2010, pp. 296\u2013300 (2010)","DOI":"10.1109\/INFCOM.2010.5462226"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Levin, D., LaCurts, K., Spring, N., Bhattacharjee, B.: Bittorrent is an auction: analyzing and improving bittorrent\u2019s incentives. In: SIGCOMM 2008, vol.\u00a038(4), pp. 243\u2013254 (2008)","DOI":"10.1145\/1402958.1402987"},{"key":"3_CR7","volume-title":"P2P-TV 2007","author":"P. Dhungel","year":"2007","unstructured":"Dhungel, P., Hei, X., Ross, K.W., Saxena, N.: The pollution attack in p2p live video streaming: measurement results and defenses. In: P2P-TV 2007. ACM, New York (2007)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Shin, K., Reeves, D.S., Rhee, I.: Treat-before-trick: Free-riding prevention for bittorrent-like peer-to-peer networks. In: IPDPS 2009, pp. 1\u201312 (2009)","DOI":"10.1109\/IPDPS.2009.5161007"},{"key":"3_CR9","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":"3_CR10","doi-asserted-by":"crossref","unstructured":"Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in p2p networks. In: WWW 2003, pp. 640\u2013651 (2003)","DOI":"10.1145\/775152.775242"},{"key":"3_CR11","unstructured":"Cohen, B.: Incentives build robustness in bittorrent. In: P2PECON 2003, Berkeley (May 2003)"},{"key":"3_CR12","unstructured":"Piatek, M., Isdal, T., Krishnamurthy, A., Anderson, T.: One hop reputations for peer to peer file sharing workloads. In: NSDI 2008, pp. 1\u201314 (2008)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Newsome, J., Shi, E., Song, D.X., Perrig, A.: The sybil attack in sensor networks: analysis & defenses. In: IPSN, pp. 259\u2013268 (2004)","DOI":"10.1145\/984622.984660"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Rowaihy, H., Enck, W., McDaniel, P., La Porta, T.: Limiting sybil attacks in structured p2p networks. In: INFOCOM 2007, pp. 2596\u20132600 (2007)","DOI":"10.1109\/INFCOM.2007.328"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Yu, H., Kaminsky, M., Gibbons, P.B., Flaxman, A.: Sybilguard: defending against sybil attacks via social networks. In: SIGCOMM, pp. 267\u2013278 (2006)","DOI":"10.1145\/1159913.1159945"},{"key":"3_CR16","first-page":"15","volume-title":"NSDI 2009","author":"N. Tran","year":"2009","unstructured":"Tran, N., Min, B., Li, J., Subramanian, L.: Sybil-resilient online content voting. In: NSDI 2009, pp. 15\u201328. USENIX Association, Berkeley (2009)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Cheng, A., Friedman, E.: Sybilproof reputation mechanisms. In: P2PECON 2005 (2005)","DOI":"10.1145\/1080192.1080202"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Yu, H., Shi, C., Kaminsky, M., Gibbons, P.B., Xiao, F.: Dsybil: Optimal sybil-resistance for recommendation systems. In: IEEE Symposium on Security and Privacy, pp. 283\u2013298 (2009)","DOI":"10.1109\/SP.2009.26"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Lian, Q., Peng, Y., Yang, M., Zhang, Z., Dai, Y., Li, X.: Robust incentives via multi-level tit-for-tat: Research articles. In: Concurr. Comput.: Pract. Exper., pp. 167\u2013178 (2008)","DOI":"10.1002\/cpe.1190"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/978-3-540-72606-7_50","volume-title":"NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet","author":"J. Sun","year":"2007","unstructured":"Sun, J., Banerjee, A., Faloutsos, M.: Multiple identities in bitTorrent networks. In: Akyildiz, I.F., Sivakumar, R., Ekici, E., de Oliveira, J.C., McNair, J. (eds.) NETWORKING 2007. LNCS, vol.\u00a04479, pp. 582\u2013593. Springer, Heidelberg (2007)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11599593_1","volume-title":"Technologies for Advanced Heterogeneous Networks","author":"J. Liang","year":"2005","unstructured":"Liang, J., Naoumov, N., Ross, K.W.: Efficient blacklisting and pollution-level estimation in P2P file-sharing systems. In: Cho, K., Jacquet, P. (eds.) AINTEC 2005. LNCS, vol.\u00a03837, pp. 1\u201321. Springer, Heidelberg (2005)"},{"key":"3_CR22","unstructured":"Safepeer, http:\/\/wiki.vuze.com\/w\/SafePeer"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Mitzenmacher, M.: Survey: Network applications of bloom filters: A survey. Internet Mathematics\u00a01(4) (2003)","DOI":"10.1080\/15427951.2004.10129096"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/11841036_61","volume-title":"Algorithms \u2013 ESA 2006","author":"F. Bonomi","year":"2006","unstructured":"Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: An improved construction for counting bloom filters. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 684\u2013695. Springer, Heidelberg (2006)"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/1177080.1177106","volume-title":"IMC 2006","author":"A. Legout","year":"2006","unstructured":"Legout, A., Urvoy-Keller, G., Michiardi, P.: Rarest first and choke algorithms are enough. In: IMC 2006, pp. 203\u2013216. ACM, New York (2006)"},{"key":"3_CR26","unstructured":"Adsl, http:\/\/en.wikipedia.org\/wiki\/Asymmetric_digital_subscriber_line"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/1254882.1254919","volume-title":"SIGMETRICS 2007","author":"A. Legout","year":"2007","unstructured":"Legout, A., Liogkas, N., Kohler, E., Zhang, L.: Clustering and sharing incentives in bittorrent systems. In: SIGMETRICS 2007, pp. 301\u2013312. ACM, New York (2007)"},{"key":"3_CR28","unstructured":"Redhat 9 torrent tracker trace, http:\/\/mikel.tlm.unavarra.es\/~mikel\/bt_pam2004\/"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20798-3_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T08:27:57Z","timestamp":1741163277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20798-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207976","9783642207983"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20798-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}