{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:55:25Z","timestamp":1773510925514,"version":"3.50.1"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/tnet.2009.2034047","type":"journal-article","created":{"date-parts":[[2009,11,13]],"date-time":"2009-11-13T17:58:32Z","timestamp":1258135112000},"page":"885-898","source":"Crossref","is-referenced-by-count":107,"title":["SybilLimit: A Near-Optimal Social Network Defense Against Sybil Attacks"],"prefix":"10.1109","volume":"18","author":[{"given":"Haifeng","family":"Yu","sequence":"first","affiliation":[]},{"given":"Phillip B.","family":"Gibbons","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaminsky","sequence":"additional","affiliation":[]},{"given":"Feng","family":"Xiao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"3","article-title":"sybillimit: a near-optimal social network defense against sybil attacks","author":"yu","year":"2008","journal-title":"Proc IEEE Symp Security Privacy"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1047915.1047917"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1080192.1080202"},{"key":"ref32","first-page":"1","article-title":"experience with an object reputation system for peer-to-peer filesharing","author":"walsh","year":"2006","journal-title":"Proc USENIX NSDI"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019258"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073873"},{"key":"ref37","first-page":"192","article-title":"informant: detecting sybils using incentives","author":"margolin","year":"2007","journal-title":"Proc Financial Cryptography"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2005.8"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984660"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988788"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/586135.586138"},{"key":"ref11","first-page":"294","article-title":"captcha: using hard ai problems for security","author":"von ahn","year":"2003","journal-title":"Proc IACR Eurocrypt"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367591"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/1151659.1159947","article-title":"understanding the network-level behavior of spammers","author":"ramachandran","year":"2006","journal-title":"Proc ACM Sigcomm"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923723"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498447"},{"key":"ref17","author":"flaxman","year":"2006","journal-title":"Expansion and lack thereof in randomly perturbed graphs"},{"key":"ref18","author":"anderson","year":"2006","journal-title":"SIGCOMM'06 public review on SybilGuard Defending against sybil attacks via social networks"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.26"},{"key":"ref4","year":"0","journal-title":"E-Mule"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21958"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1290168.1290176"},{"key":"ref6","author":"prakash","year":"0","journal-title":"Razor"},{"key":"ref29","first-page":"305","article-title":"sybil-resistant dht routing","author":"danezis","year":"2005","journal-title":"Proc ESORICS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1060289.1060317"},{"key":"ref7","first-page":"318","article-title":"towards a scalable and robust dht","author":"awerbuch","year":"2006","journal-title":"Proc ACM SPAA"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2007.84"},{"key":"ref9","first-page":"803","article-title":"making chord robust to byzantine attacks","author":"fiat","year":"2005","journal-title":"Proc ESA"},{"key":"ref1","first-page":"251","article-title":"the sybil attack","author":"douceur","year":"2002","journal-title":"Proc IPTPS"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"ref46","author":"wouhaybi","year":"2007","journal-title":"Trends and behavior in online social communities"},{"key":"ref45","author":"roozenburg","year":"2005","journal-title":"A literature survey on bloom filters"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"ref47","year":"0","journal-title":"Dataset DBLP"},{"key":"ref24","first-page":"15","article-title":"ostra: leveraging trust to thwart unwanted communication","author":"mislove","year":"2008","journal-title":"Proc USENIX NSDI"},{"key":"ref42","first-page":"60","article-title":"probabilistic quorums for dynamic systems","author":"abraham","year":"2003","journal-title":"Proc DISCEX"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923723"},{"key":"ref41","author":"lindvall","year":"2002","journal-title":"Lectures on the Coupling Method"},{"key":"ref26","first-page":"15","article-title":"sybil-resilient online content voting","author":"tran","year":"2009","journal-title":"Proc USENIX NSDI"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380810"},{"key":"ref25","article-title":"sybilinfer: detecting sybil nodes using social networks","author":"danezis","year":"2009","journal-title":"NDSS"},{"key":"ref43","author":"yu","year":"2008","journal-title":"SybilLimit A near-optimal social network defense against sybil attacks"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/90\/5484926\/05313843.pdf?arnumber=5313843","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:00:15Z","timestamp":1633914015000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5313843\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":47,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2009.2034047","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}