{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:41:15Z","timestamp":1761648075047},"reference-count":36,"publisher":"Elsevier BV","issue":"17","license":[{"start":{"date-parts":[[2013,12,1]],"date-time":"2013-12-01T00:00:00Z","timestamp":1385856000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1016\/j.comnet.2013.08.005","type":"journal-article","created":{"date-parts":[[2013,8,24]],"date-time":"2013-08-24T03:31:39Z","timestamp":1377315099000},"page":"3522-3544","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["SGor: Trust graph based onion routing"],"prefix":"10.1016","volume":"57","author":[{"given":"Peng","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiapu","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rocky K.C.","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.comnet.2013.08.005_b0005","doi-asserted-by":"crossref","unstructured":"Krishna P.N. Puttaswamy, Alessandra Sala, Ben Y. Zhao, Improving anonymity using social links, in: Proc. Workshop on Secure Network Protocols, 2008.","DOI":"10.1109\/NPSEC.2008.4664875"},{"key":"10.1016\/j.comnet.2013.08.005_b0010","doi-asserted-by":"crossref","unstructured":"Aaron Johnson, Paul Syverson, More anonymous onion routing through trust, in: Proc. Computer Security Foundations Symposium, 2009.","DOI":"10.1109\/CSF.2009.27"},{"key":"10.1016\/j.comnet.2013.08.005_b0015","doi-asserted-by":"crossref","unstructured":"Aaron Johnson, Paul Syverson, Roger Dingledine, Nick Mathewson, Trust-based anonymous communication: adversary models and routing algorithms, in: Proc. ACM Conference on Computer and Communications Security, 2011.","DOI":"10.1145\/2046707.2046729"},{"key":"10.1016\/j.comnet.2013.08.005_b0020","doi-asserted-by":"crossref","unstructured":"Paul Syverson, Gene Tsudik, Michael Reed, Carl Landwehr, Towards an analysis of onion routing security, in: Proc. Privacy Enhancing Technologies Symposium, 2000.","DOI":"10.21236\/ADA465255"},{"key":"10.1016\/j.comnet.2013.08.005_b0025","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1145\/1042031.1042032","article-title":"The predecessor attack: an analysis of a threat to anonymous communications systems","volume":"7","author":"Wright","year":"2004","journal-title":"ACM Transactions on Information and System Security"},{"key":"10.1016\/j.comnet.2013.08.005_b0030","doi-asserted-by":"crossref","unstructured":"Steven J. Murdoch, George Danezis, Low-cost traffic analysis of Tor, in: Proc. IEEE Symposium on Security and Privacy, 2005.","DOI":"10.1109\/SP.2005.12"},{"key":"10.1016\/j.comnet.2013.08.005_b0035","doi-asserted-by":"crossref","unstructured":"Lasse \u00d8verlier, Paul Syverson, Locating hidden servers, in: Proc. IEEE Symposium on Security and Privacy, 2006.","DOI":"10.1109\/SP.2006.24"},{"key":"10.1016\/j.comnet.2013.08.005_b0040","doi-asserted-by":"crossref","unstructured":"Kevin Bauer, Damon McCoy, Dirk Grunwald, Tadayoshi Kohno, Douglas Sicker, Low-resource routing attacks against Tor, in: Proc. ACM Workshop on Privacy in the Electronic Society, 2007.","DOI":"10.1145\/1314333.1314336"},{"key":"10.1016\/j.comnet.2013.08.005_b0045","doi-asserted-by":"crossref","unstructured":"Nicholas Hopper, Eugene Y. Vasserman, Eric Chan-Tin, How much anonymity does network latency leak? in: Proc. ACM Conference on Computer and Communications Security, 2007.","DOI":"10.1145\/1315245.1315257"},{"key":"10.1016\/j.comnet.2013.08.005_b0050","doi-asserted-by":"crossref","unstructured":"Zhen Ling, Junzhou Luo, Wei Yu, Xinwen Fu, Dong Xuan, Weijia Jia, A new cell counter based attack against Tor, in: Proc. ACM Conference on Computer and Communications Security, 2009.","DOI":"10.1145\/1653662.1653732"},{"key":"10.1016\/j.comnet.2013.08.005_b0055","unstructured":"Nathan S. Evans, Roger Dingledine, Christian Grothoff, A practical congestion attack on Tor using long paths, in: Proc. USENIX Security Symposium, 2009."},{"key":"10.1016\/j.comnet.2013.08.005_b0060","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1109\/TPDS.2009.146","article-title":"Correlation-based traffic analysis attacks on anonymity networks","volume":"21","author":"Zhu","year":"2010","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/j.comnet.2013.08.005_b0065","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1016\/j.comnet.2012.11.005","article-title":"Protocol-level attacks against tor","volume":"57","author":"Ling","year":"2012","journal-title":"Computer Networks"},{"key":"10.1016\/j.comnet.2013.08.005_b0070","doi-asserted-by":"crossref","unstructured":"Roger Dingledine, Nick Mathewson, Paul Syverson, Tor: the second-generation onion router, in: Proc. USENIX Security Symposium, 2004.","DOI":"10.21236\/ADA465464"},{"key":"10.1016\/j.comnet.2013.08.005_b0075","doi-asserted-by":"crossref","unstructured":"Peng Zhou, Xiapu Luo, Rocky K.C. Chang, More anonymity through trust degree in trust-based onion routing, in: Proc. International Conference on Security and Privacy in Communication Networks, 2012.","DOI":"10.1007\/978-3-642-36883-7_17"},{"key":"10.1016\/j.comnet.2013.08.005_b0080","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/293411.293443","article-title":"Onion routing for anonymous and private Internet connections","volume":"42","author":"Goldschlag","year":"1999","journal-title":"Communications of the ACM"},{"key":"10.1016\/j.comnet.2013.08.005_b0085","doi-asserted-by":"crossref","unstructured":"George Danezis, Claudia Diaz, Carmela Troncoso, Ben Laurie, Drac: an architecture for anonymous low-volume communications, in: Proc. Privacy Enhancing Technologies Symposium, 2010.","DOI":"10.1007\/978-3-642-14527-8_12"},{"key":"10.1016\/j.comnet.2013.08.005_b0090","unstructured":"Prateek Mittal, Matthew Wright, Nikita Borisov, Pisces: Anonymous communication using social networks, in: Proc. Network and Distributed System Security Symposium, 2013."},{"key":"10.1016\/j.comnet.2013.08.005_b0095","doi-asserted-by":"crossref","unstructured":"Bimal Viswanath, Alan Mislove, Meeyoung Cha, Krishna P. Gummadi, On the evolution of user interaction in Facebook, in: Proc. Workshop on Online Social Networks, 2009.","DOI":"10.1145\/1592665.1592675"},{"key":"10.1016\/j.comnet.2013.08.005_b0100","doi-asserted-by":"crossref","unstructured":"Christo Wilson, Bryce Boe, Alessandra Sala, Krishna P.N. Puttaswamy, Ben Y. Zhao, User interactions in social networks and their implications, in: Proc. European Conference on Computer Systems, 2009.","DOI":"10.1145\/1519065.1519089"},{"issue":"4","key":"10.1016\/j.comnet.2013.08.005_b0105","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1109\/TNET.2011.2178036","article-title":"A new cell-counting-based attack against Tor","volume":"20","author":"Ling","year":"2012","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/j.comnet.2013.08.005_b0110","unstructured":"Amir Houmansadr, Nikita Borisov, SWIRL: a scalable watermark to detect correlated network flows, in: Proc. Network and Distributed System Security Symposium, 2011."},{"key":"10.1016\/j.comnet.2013.08.005_b0115","doi-asserted-by":"crossref","unstructured":"Xiapu Luo, Junjie Zhang, Roberto Perdisci, Wenke Lee, On the secrecy of spread-spectrum flow watermarks, in: Proc. European Symposium on Research in Computer Security, 2010.","DOI":"10.1007\/978-3-642-15497-3_15"},{"key":"10.1016\/j.comnet.2013.08.005_b0120","doi-asserted-by":"crossref","unstructured":"Xiapu Luo, Peng Zhou, Junjie Zhang, Roberto Perdisci, Wenke Lee, Rocky K.C. Chang, Exposing invisible timing-based traffic watermarks with backlit, in: Proc. Annual Computer Security Applications Conference, 2011.","DOI":"10.1145\/2076732.2076760"},{"key":"10.1016\/j.comnet.2013.08.005_b0125","doi-asserted-by":"crossref","unstructured":"John R. Douceur. The Sybil attack, in: Revised Papers from the First International Workshop on Peer-to-Peer Systems, 2002.","DOI":"10.1007\/3-540-45748-8_24"},{"key":"10.1016\/j.comnet.2013.08.005_b0130","doi-asserted-by":"crossref","unstructured":"Haifeng Yu. Sybil defenses via social networks: a tutorial and survey. in: SIGACT News, 42, pp. 80\u2013101.","DOI":"10.1145\/2034575.2034593"},{"key":"10.1016\/j.comnet.2013.08.005_b0135","doi-asserted-by":"crossref","unstructured":"Ralph Gross, Alessandro Acquisti, Information revelation and privacy in online social networks (the facebook case), in: Proc. Workshop on Privacy in the Electronic Society, 2005.","DOI":"10.1145\/1102199.1102214"},{"key":"10.1016\/j.comnet.2013.08.005_b0140","doi-asserted-by":"crossref","unstructured":"Yabing Liu, Krishna P. Gummadi, Balachander Krishnamurthy, Alan Mislove, Analyzing facebook privacy settings: User expectations vs. reality, in: Proc. Internet Measurement Conference, 2011.","DOI":"10.1145\/2068816.2068823"},{"key":"10.1016\/j.comnet.2013.08.005_b0145","doi-asserted-by":"crossref","unstructured":"Yazan Boshmaf, Ildar Muslukhov, Konstantin Beznosov, Matei Ripeanu, The socialbot network: When bots socialize for fame and money, in: Proc. Annual Computer Security Applications Conference, 2011.","DOI":"10.1145\/2076732.2076746"},{"key":"10.1016\/j.comnet.2013.08.005_b0150","doi-asserted-by":"crossref","unstructured":"Alan Mislove, Bimal Viswanath, Krishna P. Gummadi, Peter Druschel, You are who you know: inferring user profiles in online social networks, in: Proc. ACM International Conference on Web Search and Data Mining, 2010.","DOI":"10.1145\/1718487.1718519"},{"key":"10.1016\/j.comnet.2013.08.005_b0155","doi-asserted-by":"crossref","unstructured":"Ramanthan Guha, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins, Propagation of trust and distrust, in: Proc. International conference on World Wide Web, 2004.","DOI":"10.1145\/988672.988727"},{"key":"10.1016\/j.comnet.2013.08.005_b0160","unstructured":"Dinh Nguyen Tran, Bonan Min, Jinyang Li, Lakshminarayanan Subramanian, Sybil-resilient online content rating, in: Proc. USENIX Symposium on Networked Systems Design and Implementation, 2009."},{"key":"10.1016\/j.comnet.2013.08.005_b0165","unstructured":"Prateek Mittal, Matthew Caesar, Nikita Borisov, X-vine: Secure and pseudonymous routing in dhts using social networks, in: Proc. Network and Distributed System Security Symposium, 2012."},{"key":"10.1016\/j.comnet.2013.08.005_b0170","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/TNET.2009.2034047","article-title":"Sybillimit: a near-optimal social network defense against sybil attacks","volume":"18","author":"Yu","year":"2010","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/j.comnet.2013.08.005_b0175","unstructured":"NetworkX. <http:\/\/networkx.github.io\/>."},{"key":"10.1016\/j.comnet.2013.08.005_b0180","doi-asserted-by":"crossref","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","author":"Barab\u00e1si","year":"1999","journal-title":"Science"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128613002594?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128613002594?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,8,2]],"date-time":"2020-08-02T13:36:44Z","timestamp":1596375404000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128613002594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":36,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["S1389128613002594"],"URL":"https:\/\/doi.org\/10.1016\/j.comnet.2013.08.005","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2013,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"SGor: Trust graph based onion routing","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comnet.2013.08.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}