{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T21:22:37Z","timestamp":1781904157107,"version":"3.54.5"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/infcom.2011.5934998","type":"proceedings-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T10:59:10Z","timestamp":1310036350000},"page":"1943-1951","source":"Crossref","is-referenced-by-count":71,"title":["Keep your friends close: Incorporating trust into social network-based Sybil defenses"],"prefix":"10.1109","author":[{"given":"Abedelaziz","family":"Mohaisen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicholas","family":"Hopper","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongdae","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300000390"},{"key":"ref31","article-title":"Incorporating trust into social network-based sybil defenses","author":"mohaisen","year":"2010","journal-title":"UMN Tech Rep"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75551-7_16"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718519"},{"key":"ref36","first-page":"481","article-title":"The DBLP computer science bibliography: Evolution, research issues, perspectives","author":"ley","year":"2009","journal-title":"String Processing and Information Retrieval"},{"key":"ref35","first-page":"351","article-title":"Trust management for the semantic web","author":"richardson","year":"2003","journal-title":"ISWC"},{"key":"ref34","article-title":"Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters","volume":"abs 810 1355","author":"leskovec","year":"2008","journal-title":"CoRR"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159945"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851226"},{"key":"ref12","article-title":"Sybilinfer: Detecting sybil nodes using social networks","author":"danezis","year":"2009","journal-title":"NDSS"},{"key":"ref13","first-page":"3","article-title":"WhÄnau: A sybil-proof distributed hash table","author":"lesniewski-lass","year":"2010","journal-title":"USENIX NSDI"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879191"},{"key":"ref15","first-page":"15","article-title":"Sybil-resilient online content voting","author":"tran","year":"2009","journal-title":"NSDI"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1288107.1288113"},{"key":"ref17","first-page":"100","article-title":"Dht routing using social links","author":"marti","year":"2004","journal-title":"IPTPS"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/AINAW.2007.365"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061938"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1594173.1594174"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1060289.1060291"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242685"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1060289.1060317"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2009.5284491"},{"key":"ref29","article-title":"Trust and privacy concern within social networking sites: A comparison of Facebook and MySpace","author":"dwyer","year":"2007","journal-title":"AMCIS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498366"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923723"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2006.10"},{"key":"ref2","article-title":"A survey of solutions to the sybil attack","author":"levine","year":"2006","journal-title":"University of Massachusetts Amherst Tech Rep"},{"key":"ref9","first-page":"3","article-title":"Sybillimit: A near-optimal social network defense against sybil attacks","author":"yu","year":"2008","journal-title":"IEEE Symposium on Security and Privacy"},{"key":"ref1","first-page":"251","article-title":"The sybil attack","author":"douceur","year":"2002","journal-title":"IPTPS"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592675"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772756"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1519065.1519089"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1578002.1578008"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401914"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"}],"event":{"name":"IEEE INFOCOM 2011 - IEEE Conference on Computer Communications","location":"Shanghai, China","start":{"date-parts":[[2011,4,10]]},"end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888673\/5934870\/05934998.pdf?arnumber=5934998","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T03:25:27Z","timestamp":1490066727000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5934998\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/infcom.2011.5934998","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}