{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:08:34Z","timestamp":1704931714429},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transcom.2015amp0004","type":"journal-article","created":{"date-parts":[[2016,6,22]],"date-time":"2016-06-22T22:05:50Z","timestamp":1466633150000},"page":"1002-1011","source":"Crossref","is-referenced-by-count":1,"title":["Trust-Based Sybil Nodes Detection with Robust Seed Selection and Graph Pruning on SNS"],"prefix":"10.23919","volume":"E99.B","author":[{"given":"Shuichiro","family":"HARUTA","sequence":"first","affiliation":[{"name":"Dept. of Information and Computer Science, Keio University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kentaroh","family":"TOYODA","sequence":"additional","affiliation":[{"name":"Dept. of Information and Computer Science, Keio University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iwao","family":"SASASE","sequence":"additional","affiliation":[{"name":"Dept. of Information and Computer Science, Keio University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","unstructured":"[1] \u201cReporting abusive accounts.\u201d"},{"key":"2","unstructured":"[2] Q. Cao, M. Sirivianos, X. Yang, and T. Pregueiro, \u201cAiding the detection of fake accounts in large scale social online services,\u201d USENIX NSDI, p.15, USENIX Association, 2012."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] H. Yu, M. Kaminsky, P.B. Gibbons, and A. Flaxman, \u201cSybilGuard: Defending against sybil attacks via social networks,\u201d SIGCOMM Comput. Commun. Rev., vol.36, no.4, pp.267-278, 2006.","DOI":"10.1145\/1151659.1159945"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] H. Yu, P.B. Gibbons, M. Kaminsky, and F. Xiao, \u201cSybilLimit: A near-optimal social network defense against sybil attacks,\u201d 2008 IEEE Symposium on Security and Privacy, pp.3-17, 2008.","DOI":"10.1109\/SP.2008.13"},{"key":"5","unstructured":"[5] G. Danezis and P. Mittal, \u201cSybilinfer: Detecting sybil nodes using social networks,\u201d NDSS, 2009."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] A. Mohaisen, N. Hopper, and Y. Kim, \u201cKeep your friends close: Incorporating trust into social network-based Sybil defenses,\u201d 2011 Proc. IEEE INFOCOM, pp.1943-1951, 2011.","DOI":"10.1109\/INFCOM.2011.5934998"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] L. Alvisi, A. Clement, A. Epasto, S. Lattanzi, and A. Panconesi, \u201cSoK: The evolution of sybil defense via social networks,\u201d 2013 IEEE Symposium on Security and Privacy, pp.382-396, 2013.","DOI":"10.1109\/SP.2013.33"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] H. Zhang, C. Xu, and J. Zhang, \u201cExploiting trust and distrust information to combat sybil attack in online social networks,\u201d Trust Management VIII, vol.430, pp.77-92, 2014.","DOI":"10.1007\/978-3-662-43813-8_6"},{"key":"9","unstructured":"[9] \u201cFake Accounts in Facebook \u2014 How to Counter It.\u201d"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] D. Koll, J. Li, J. Stein, and X. Fu, \u201cOn the state of OSN-based Sybil defenses,\u201d 2014 IFIP Networking Conference, pp.1-9, 2014.","DOI":"10.1109\/IFIPNetworking.2014.6857128"},{"key":"11","unstructured":"[11] A. Mislove, A. Post, P. Druschel, and P.K. Gummadi, \u201cOstra: Leveraging trust to thwart unwanted communication,\u201d NSDI, pp.15-30, 2008."},{"key":"12","unstructured":"[12] D.N. Tran, B. Min, J. Li, and L. Subramanian, \u201cSybil-resilient online content voting,\u201d NSDI, pp.15-28, 2009."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] N. Tran, J. Li, L. Subramanian, and S.S.M. Chow, \u201cOptimal sybil-resilient node admission control,\u201d 2011 Proc. IEEE INFOCOM, pp.3218-3226, 2011.","DOI":"10.1109\/INFCOM.2011.5935171"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] A.N. Langville and C.D. Meyer, \u201cDeeper inside PageRank,\u201d Internet Mathematics, vol.1, no.3, pp.335-380, 2004.","DOI":"10.1080\/15427951.2004.10129091"},{"key":"15","unstructured":"[15] J. Leskovec and J.J. Mcauley, \u201cLearning to discover social circles in ego networks,\u201d Advances in Neural Information Processing Systems, pp.539-547, 2012."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] M.E.J. Newman, \u201cFast algorithm for detecting community structure in networks,\u201d Phys. Rev. E., vol.69, no.6, 066133, 2004.","DOI":"10.1103\/PhysRevE.69.066133"},{"key":"17","unstructured":"[17] H. Rashtian, Y. Boshmaf, P. Jaferian, and K. Beznosov, \u201cTo befriend or not? a model of friend request acceptance on facebook,\u201d Symposium on Usable Privacy and Security (SOUPS), 2014."},{"key":"18","unstructured":"[18] \u201cShinzo Abe Facebook,\u201d https:\/\/www.facebook.com\/abeshinzo?fref=ts"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] L. Lamport, R. Shostak, and M. Pease, \u201cThe Byzantine generals problem,\u201d ACM Trans. Program. Lang. Syst., vol.4, no.3, pp.382-401, 1982.","DOI":"10.1145\/357172.357176"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] J.A. Hanley and B.J. McNeil, \u201cThe meaning and use of the area under a receiver operating characteristic (ROC) curve,\u201d Radiology, vol.143, no.1, pp.29-36, 1982.","DOI":"10.1148\/radiology.143.1.7063747"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] A.L. Barab\u00e1si and R. Albert, \u201cEmergence of scaling in random networks,\u201d Science, vol.286, no.5439, pp.509-512, 1999.","DOI":"10.1126\/science.286.5439.509"},{"key":"22","unstructured":"[22] G. Csardi and T. Nepusz, \u201cThe igraph software package for complex network research,\u201d InterJournal, vol.Complex Systems, p.1695, 2006."}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E99.B\/5\/E99.B_2015AMP0004\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T14:59:40Z","timestamp":1704898780000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E99.B\/5\/E99.B_2015AMP0004\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2015amp0004","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}