{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T06:10:21Z","timestamp":1739167821663,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642026164"},{"type":"electronic","value":"9783642026171"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02617-1_37","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T14:22:04Z","timestamp":1245248524000},"page":"358-367","source":"Crossref","is-referenced-by-count":0,"title":["Combating Index Poisoning in P2P File Sharing"],"prefix":"10.1007","author":[{"given":"Lingli","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yeping","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyao","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Liang, J., Naoumov, N., Ross, K.W.: The index poisoning attack in P2P file sharing systems. In: Proc. of INFOCOM, pp. 1\u201312 (2006)","DOI":"10.1109\/INFOCOM.2006.232"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Garces-Erice, L., Felber, P.A., Biersack, E.W., et al.: Data indexing in peer-to-peer DHT networks. In: Proc. of ICDCS, pp. 200\u2013208 (2004)","DOI":"10.1109\/ICDCS.2004.1281584"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Skobeltsyn, G., Aberer, K.: Distributed cache table: efficient query-driven processing of multi-term queries in P2P networks. In: Proc. of IRP2P, pp. 33\u201340 (2006)","DOI":"10.1145\/1183579.1183586"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Deng, L., He, Y., Xu, Z.: Service Authenticity in P2P File-Sharing. In: Proc. of ICYCS, pp. 2246\u20132253 (2008)","DOI":"10.1109\/ICYCS.2008.132"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Liang, J., Kumar, R., Xi, Y., et al.: Pollution in P2P file sharing systems. In: Proc. of INFOCOM, pp. 1174\u20131185 (2005)","DOI":"10.1109\/INFCOM.2005.1498344"},{"issue":"12","key":"37_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/355112.355122","volume":"43","author":"P. Resnick","year":"2000","unstructured":"Resnick, P., Kuwabara, K., Zeckhauser, R., et al.: Reputation systems. Commun. ACM\u00a043(12), 45\u201348 (2000)","journal-title":"Commun. ACM"},{"key":"37_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36285-1_1","volume-title":"Database Theory - ICDT 2003","author":"N. Daswani","year":"2002","unstructured":"Daswani, N., Garcia-Molina, H., Yang, B.: Open problems in data-sharing peer-to-peer systems. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 1\u201315. Springer, Heidelberg (2002)"},{"key":"37_CR8","unstructured":"Daswani, N., Golle, P., Marti, S., et al.: Evaluating reputation systems for document authenticity. Technical report, Stanford University (2003)"},{"issue":"6","key":"37_CR9","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/MIC.2005.124","volume":"9","author":"X. Zhang","year":"2005","unstructured":"Zhang, X., Chen, S., Sandhu, R.: Enhancing data authenticity and integrity in P2P systems. IEEE Internet Computing\u00a09(6), 42\u201349 (2005)","journal-title":"IEEE Internet Computing"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Qiu, D., Srikant, R.: Modeling and performance analysis of BitTorrent-like peer-to-peer networks. In: Proc. of SIGCOMM, pp. 367\u2013378 (2004)","DOI":"10.1145\/1015467.1015508"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Ripeanu, M., Foster, I.: Peer-to-peer architecture case study: Gnutella network. In: Proc. of IPTPS, pp. 99\u2013100 (2001)","DOI":"10.1109\/P2P.2001.990433"},{"issue":"1","key":"37_CR12","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., et al.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE\/ACM Trans. Netw.\u00a011(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-45748-8_23","volume-title":"Peer-to-Peer Systems","author":"M. Harren","year":"2002","unstructured":"Harren, M., Hellerstein, J.M., Huebsch, R., et al.: Complex queries in DHT-based peer-to-peer networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 242\u2013250. Springer, Heidelberg (2002)"},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","first-page":"207","volume-title":"Proc. of IPTPS","author":"J. Li","year":"2003","unstructured":"Li, J., Loo, B.T., Hellerstein, J.M., et al.: On the feasibility of peer-to-peer web indexing and search. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, pp. 207\u2013215. Springer, Heidelberg (2003)"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Chen, H., Jin, H., Wang, J., et al.: Efficient multi-keyword search over P2P web. In: Proc. of WWW, pp. 989\u2013998 (2008)","DOI":"10.1145\/1367497.1367631"},{"issue":"4","key":"37_CR16","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A. Broder","year":"2004","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: a survey. J. Internet Mathematics\u00a01(4), 485\u2013509 (2004)","journal-title":"J. Internet Mathematics"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Kumar, A., Xu, J., Zegara, E.W.: Efficient and scalable query routing for unstructured peer-to-peer networks. In: Proc. of INFOCOM, pp. 1162\u20131173 (2005)","DOI":"10.1109\/INFCOM.2005.1498343"},{"issue":"5","key":"37_CR18","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1109\/TNET.2004.836103","volume":"12","author":"J.W. Byers","year":"2004","unstructured":"Byers, J.W., Considine, J., Mitzenmacher, M., et al.: Informed content delivery across adaptive overlay networks. IEEE\/ACM Trans. Netw.\u00a012(5), 767\u2013780 (2004)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Jin, X., Yiu, W.P.K., Chan, S.H.: Supporting multiple-keyword dearch in a hybrid structured peer-to-peer network. In: Proc. of ICC, pp. 42\u201347 (2006)","DOI":"10.1109\/ICC.2006.254702"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Security and Assurance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02617-1_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T05:39:52Z","timestamp":1739165992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02617-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642026164","9783642026171"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02617-1_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}