{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T23:28:10Z","timestamp":1791070090283,"version":"4.1.0"},"reference-count":34,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1109\/comsnets.2012.6151333","type":"proceedings-article","created":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T15:20:00Z","timestamp":1329319200000},"page":"1-8","source":"Crossref","is-referenced-by-count":30,"title":["Exploring the design space of social network-based Sybil defenses"],"prefix":"10.1109","author":[{"given":"Bimal","family":"Viswanath","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mainack","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Allen","family":"Clement","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Druschel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Krishna P.","family":"Gummadi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alan","family":"Mislove","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ansley","family":"Post","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"ref32","article-title":"Fully-dynamic cut tree construction","author":"hartmann","year":"2011","journal-title":"Tech Rep"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"ref30","article-title":"An algorithm for the solution of the max-flow problem with the polynomial estimation","volume":"194","author":"dinic","year":"1970","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718537"},{"key":"ref10","article-title":"Ostra: Leveraging Trust to Thwart Unwanted Communication","author":"mislove","year":"0","journal-title":"NSDI"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICECT.2005.98"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2034575.2034593"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851226"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref15","article-title":"Diaspora*","year":"0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242685"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772755"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879191"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"ref4","article-title":"SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks","author":"yu","year":"0","journal-title":"IEEE S&P"},{"key":"ref27","article-title":"On the Sybil-Proofness of accounting mechanisms","author":"seuken","year":"0","journal-title":"NetEcon"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159945"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935171"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12144"},{"key":"ref5","article-title":"SybilInfer: Detecting Sybil Nodes using Social Networks","author":"danezis","year":"0","journal-title":"NDSS"},{"key":"ref8","article-title":"Wh?nau: A Sybil-proof Distributed Hash Table","author":"lesniewski-laas","year":"0","journal-title":"NSDI"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462218"},{"key":"ref2","article-title":"Sybil-Resilient Online Content Voting","author":"tran","year":"0","journal-title":"NSDI"},{"key":"ref9","article-title":"Bazaar: Strengthening user reputations in online marketplaces","author":"post","year":"0","journal-title":"NSDI"},{"key":"ref1","article-title":"The Sybil Attack","author":"douceur","year":"0","journal-title":"IPTPS"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.98.2.404"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018487"},{"key":"ref21","article-title":"Advogato trust network","year":"0"},{"key":"ref24","article-title":"Liquidity in credit networks: A little trust goes a long way","author":"dandekar","year":"0","journal-title":"NetEcon"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462077"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242685"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77105-0_25"}],"event":{"name":"2012 Fourth International Conference on Communication Systems and Networks (COMSNETS)","location":"Bangalore, India","start":{"date-parts":[[2012,1,3]]},"end":{"date-parts":[[2012,1,7]]}},"container-title":["2012 Fourth International Conference on Communication Systems and Networks (COMSNETS 2012)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6145051\/6151271\/06151333.pdf?arnumber=6151333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T19:16:12Z","timestamp":1490123772000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6151333\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/comsnets.2012.6151333","relation":{},"subject":[],"published":{"date-parts":[[2012,1]]}}}