{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:55:23Z","timestamp":1773510923563,"version":"3.50.1"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"National High Technology Research and Development Program (\u201c863\u201d Program) of China","award":["2013AA013203"],"award-info":[{"award-number":["2013AA013203"]}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2011CB302305"],"award-info":[{"award-number":["2011CB302305"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Science Foundation for Young Scholars of China","award":["61202423"],"award-info":[{"award-number":["61202423"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2016,7,1]]},"DOI":"10.1109\/tdsc.2015.2410792","type":"journal-article","created":{"date-parts":[[2015,3,9]],"date-time":"2015-03-09T18:43:10Z","timestamp":1425926590000},"page":"488-501","source":"Crossref","is-referenced-by-count":55,"title":["VoteTrust: Leveraging Friend Invitation Graph to Defend against Social Network Sybils"],"prefix":"10.1109","volume":"13","author":[{"given":"Zhi","family":"Yang","sequence":"first","affiliation":[]},{"given":"Jilong","family":"Xue","sequence":"additional","affiliation":[]},{"given":"Xiaoyong","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yafei","family":"Dai","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1145\/1851275.1851226","author":"viswanath","year":"2010","journal-title":"Proc ACM SIGCOMM Conf"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567045"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1145\/1879141.1879190","author":"jiang","year":"2010","journal-title":"Proc 10th ACM SIGCOMM Conf Internet Meas"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526784"},{"key":"ref14","first-page":"576","article-title":"Combating web spam with trustrank","author":"gyongyi","year":"2004","journal-title":"Proc 30th Int Conf Very Large Data Bases"},{"key":"ref15","article-title":"Aiding the detection of fake accounts in large scale social online services","author":"cao","year":"2012","journal-title":"Proc 9th USENIX Conf Netw Syst Des Implementation"},{"key":"ref16","year":"0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.14722\/ndss.2015.23260","article-title":"Íntegro: Leveraging victim prediction for robust fake account detection in OSNs","author":"boshmaf","year":"2015","journal-title":"Proc Symp Network and Distributed System Security"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1080192.1080202"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866311"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1052934.1052938"},{"key":"ref3","first-page":"259","article-title":"Detecting and characterizing social spam campaigns","author":"gao","year":"2010","journal-title":"Proc ACM SIGCOMM Conf Internet Meas Conf"},{"key":"ref6","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":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159945"},{"key":"ref8","article-title":"Sybilinfer: Detecting sybil nodes using social networks","author":"danezis","year":"2009","journal-title":"Proc Symp Network and Distributed System Security"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195572"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2068816.2068841"},{"key":"ref9","first-page":"15","article-title":"Sybil-resilient online content voting","author":"tran","year":"2009","journal-title":"Proc 6th USENIX Symp Netw Syst Des Implementation"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45748-8_24"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/775240.775242"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2068816.2068840"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187846"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1920261.1920263"},{"key":"ref23","first-page":"1","article-title":"Don't follow me: Spam detection on twitter","author":"wang","year":"2010","journal-title":"Proc Int Conf Security and Cryptography"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2342549.2342551"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2504730.2504731"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/7506373\/07056537.pdf?arnumber=7056537","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T19:08:24Z","timestamp":1651432104000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7056537\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,1]]},"references-count":27,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2015.2410792","relation":{},"ISSN":["1545-5971"],"issn-type":[{"value":"1545-5971","type":"print"}],"subject":[],"published":{"date-parts":[[2016,7,1]]}}}