{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:30:25Z","timestamp":1725496225385},"publisher-location":"Boston, MA","reference-count":14,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387736549"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-73655-6_18","type":"book-chapter","created":{"date-parts":[[2007,11,23]],"date-time":"2007-11-23T06:41:46Z","timestamp":1195800106000},"page":"269-284","source":"Crossref","is-referenced-by-count":0,"title":["Resisting Sybils in Peer-to-peer Markets"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Traupman","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"K.S. Barber, K. Fullam, and J. Kim. Challenges for trust, fraud and deception research in multi-agent systems. Trust, Reputation, and Security: Theories and Practice, pages 8\u201314, 2003.","DOI":"10.1007\/3-540-36609-1_2"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"R. Bhattacharjee and A. Goel. Avoiding ballot stuffing in ebay-like reputation systems. In Proc. SIGCOMM\u2019 05 P2P-ECON Workshop, 2005.","DOI":"10.1145\/1080192.1080203"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"M. Bianchini, M. Gori, and F. Scarselli. Inside pagerank. ACM Transactions on Internet Technology, 5(1), February 2005.","DOI":"10.1145\/1052934.1052938"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"A. Cheng and E. Friedman. Sybilproof reputation mechanisms. In Proc. SIGCOMM\u2019 05 P2P-ECON Workshop, August 2005.","DOI":"10.1145\/1080192.1080202"},{"key":"18_CR5","unstructured":"A. Clausen. The cost of attack of pagerank. In Proc. International Conference on Agents, Web Technologies and Internet Commerce (IAWTIC), 2004."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"M. Feldman, K. Lai, I. Stoica, and J. Chuang. Robust incentives for peer-to-peer networks. In Proc. ACM E-Commerce Conference (EC\u201904), May 2004.","DOI":"10.1145\/988772.988788"},{"issue":"3","key":"18_CR7","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1080\/15427951.2005.10129104","volume":"2","author":"D. Fogaras","year":"2005","unstructured":"D. Fogaras, B. R\u00e1cz, K. Csalog\u00e1ny, and T. Sarl\u00f3s. Toward scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Mathematics, 2(3):333\u2013358, 2005.","journal-title":"Internet Mathematics"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/105864001300122476","volume":"10","author":"E. Friedman","year":"2001","unstructured":"E. Friedman and P. Resnick. The social cost of cheap pseudonyms. Journal of Economics and Management Strategy, 10:173\u2013199, 2001.","journal-title":"Journal of Economics and Management Strategy"},{"key":"18_CR9","unstructured":"A.V. Goldberg. Efficient Graph Algorithms for Sequential and Parallel Computers. PhD thesis, MIT, 1987."},{"issue":"4","key":"18_CR10","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"A.V. Goldberg and R.E. Tarjan. A new approach to the maximum-flow problem. J. ACM, 35(4):921\u2013940, 1988.","journal-title":"J. ACM"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"S.D. Kamvar, M.T. Scholosser, and H. Garcia-Molina. The eigentrust algorithm for reputation management in p2p networks. In Proc. WWW 2003, May 2003.","DOI":"10.1145\/775152.775242"},{"key":"18_CR12","unstructured":"L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: bringing order to the web. Technical Report 1999-66, Stanford University, 1999."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"J. Traupman and R. Wilensky. Robust reputations for peer-to-peer marketplaces. In Proc. 4th International Conference on Trust Management (iTrust), 2006.","DOI":"10.1007\/11755593_28"},{"key":"18_CR14","unstructured":"L. von Ahn, M. Blum, and J. Langford. Telling humans and computers apart (automatically). Technical Report CMU-CS-02-117, Carnegie Mellon University, School or Computer Science, 2002."}],"container-title":["IFIP International Federation for Information Processing","Trust Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-73655-6_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T04:12:40Z","timestamp":1619669560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-73655-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387736549"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-73655-6_18","relation":{},"subject":[]}}