{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T07:25:21Z","timestamp":1743492321328,"version":"3.40.3"},"publisher-location":"Cham","reference-count":82,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030551957"},{"type":"electronic","value":"9783030551964"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-55196-4_7","type":"book-chapter","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T23:11:38Z","timestamp":1602717098000},"page":"113-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Webs of Trust: Choosing Who to Trust on the Internet"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3152-4993","authenticated-orcid":false,"given":"Matteo","family":"Dell\u2019Amico","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,15]]},"reference":[{"key":"7_CR1","unstructured":"California States Assembly: The California Consumer Privacy Act of 2018 (2018). https:\/\/leginfo.legislature.ca.gov\/faces\/billTextClient.xhtml?bill_id=201720180AB375"},{"issue":"35","key":"7_CR2","first-page":"1","volume":"20","author":"P Avesani","year":"2005","unstructured":"Avesani, P., Massa, P., Tiella, R.: Moleskiing. it: a trust-aware recommender system for SKI mountaineering. Int. J. Infonom. 20(35), 1\u201310 (2005)","journal-title":"Int. J. Infonom."},{"issue":"4489","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1126\/science.7466396","volume":"211","author":"R Axelrod","year":"1981","unstructured":"Axelrod, R., Hamilton, W.D.: The evolution of cooperation. Science 211(4489), 1390\u20131396 (1981)","journal-title":"Science"},{"key":"7_CR4","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. CryptolePrint Arch., Technical report 46, 2018 (2018)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Bennett, K., Grothoff, C., Horozov, T., Patrascu, I., Stef, T.: Gnunet-a truly anonymous networking infrastructure. In: Proceedings of the Privacy Enhancing Technologies Workshop (PET). Citeseer (2002)","DOI":"10.1007\/978-3-540-40956-4_10"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-04944-6_11","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"Y Berchenko","year":"2009","unstructured":"Berchenko, Y., Teicher, M.: Graph embedding through random walk for shortest paths problems. In: Watanabe, O., Zeugmann, T. (eds.) SAGA 2009. LNCS, vol. 5792, pp. 127\u2013140. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04944-6_11"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS 2012, pp. 326\u2013349. ACM, New York (2012). https:\/\/doi.org\/10.1145\/2090236.2090263 , http:\/\/doi.acm.org\/10.1145\/2090236.2090263 . ISBN 978-1-4503-1115-1","DOI":"10.1145\/2090236.2090263"},{"key":"7_CR8","unstructured":"Bojchevski, A., G\u00fcnnemann, S.: adversarial attacks on node embeddings via graph poisoning. In: International Conference on Machine Learning, pp. 695\u2013704 (2019)"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1109\/TNSM.2011.110911.100079","volume":"8","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Wang, X., Shi, C., Lua, E.K., Fu, X., Deng, B., Li, X.: Phoenix: a weight-based network coordinate system using matrix factorization. IEEE Trans. Netw. Serv. Manage. 8(4), 334\u2013347 (2011)","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/TSC.2015.2437383","volume":"10","author":"Y Chen","year":"2017","unstructured":"Chen, Y., Wu, S., Li, J., Fu, X.: NCShield: protecting decentralized, matrix factorization-based network coordinate systems. IEEE Trans. Serv. Comput. 10(2), 244\u2013257 (2017). https:\/\/doi.org\/10.1109\/TSC.2015.2437383 . ISSN 1939\u20131374","journal-title":"IEEE Trans. Serv. Comput."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Cheng, A., Friedman, E.: Sybilproof reputation mechanisms. In: Proceedings of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems, pp. 128\u2013132. ACM (2005)","DOI":"10.1145\/1080192.1080202"},{"key":"7_CR12","unstructured":"Chwelos, P., Dhar, T.: Caveat emptor: Differences in online reputation mechanisms. Technical report, Working Paper, Sauder School of Business, University of British Columbia (2006)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-44702-4_4","volume-title":"Designing Privacy Enhancing Technologies","author":"I Clarke","year":"2001","unstructured":"Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: a distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 46\u201366. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44702-4_4"},{"key":"7_CR14","first-page":"68","volume":"6","author":"B Cohen","year":"2003","unstructured":"Cohen, B.: Incentives build robustness in bittorrent. Workshop Econ. Peer-to-Peer Syst. 6, 68\u201372 (2003)","journal-title":"Workshop Econ. Peer-to-Peer Syst."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Costa, M., Castro, M., Rowstron, R., Key, P.: PIC: practical internet coordinates for distance estimation. In: Proceedings of the 24th International Conference on Distributed Computing Systems, pp. 178\u2013187. IEEE (2004)","DOI":"10.1109\/ICDCS.2004.1281582"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/972374.972394","volume":"34","author":"R Cox","year":"2004","unstructured":"Cox, R., Dabek, F., Kaashoek, F., Li, J., Morris, R.: Practical, distributed network coordinates. ACM SIGCOMM Comput. Commun. Rev. 34(1), 113\u2013118 (2004)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"7_CR17","unstructured":"Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: a decentralized network coordinate system. ACM SIGCOMM Comput. Commun. Rev. 34, 15\u201326 (2004)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Das Sarma, A., Gollapudi, S., Najork, M., Panigrahy, R.: A sketch-based distance oracle for web-scale graphs. In: Proceedings of the Third ACM International Conference on Web Search and Data Mining, pp. 401\u2013410. ACM (2010)","DOI":"10.1145\/1718487.1718537"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Dell\u2019Amico, M.: Mapping small worlds. In: Seventh IEEE International Conference on Peer-to-Peer Computing, P2P 2007, pp. 219\u2013228. IEEE (2007)","DOI":"10.1109\/P2P.2007.29"},{"key":"7_CR20","unstructured":"Dell\u2019Amico, M.: Exploiting Social Networks in Robust P2P Applications. Ph.D. thesis, Universit\u00e0 degli Studi di Genova (2008). https:\/\/www.disi.unige.it\/person\/DellamicoM\/research\/phd-thesis.pdf"},{"issue":"1","key":"7_CR21","first-page":"5","volume":"29","author":"M Dell\u2019Amico","year":"2010","unstructured":"Dell\u2019Amico, M., Capra, L.: Dependable filtering: philosophy and realizations. ACM Trans. Inf. Syst. (TOIS) 29(1), 5 (2010)","journal-title":"ACM Trans. Inf. Syst. (TOIS)"},{"key":"7_CR22","unstructured":"Dell\u2019Amico, M., Roudier, Y.: A measurement of mixing time in social networks. In: Proceedings of the 5th International Workshop on Security and Trust Management, Saint Malo, France, p. 72 (2009)"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","volume-title":"Peer-to-Peer Systems","author":"JR Douceur","year":"2002","unstructured":"Douceur, J.R.: The sybil attack. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251\u2013260. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45748-8_24"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"DuPont, Q.: Experiments in algorithmic governance: a history and ethnography of \u201cthe dao,\u201d a failed decentralized autonomous organization. In: Bitcoin and Beyond, pp. 157\u2013177. Routledge (2017)","DOI":"10.4324\/9781315211909-8"},{"key":"7_CR25","unstructured":"Ethereum: Ethereum: the world computer (2015). https:\/\/www.youtube.com\/watch?v=j23HnORQXvs"},{"key":"7_CR26","unstructured":"European Union: Regulation (EU) 2016\/679 of the European Parliament and of the Council of 27 April 2016 on the protection of natural persons with regard to the processing of personal data and on the free movement of such data, and repealing Directive 95\/46\/EC (General Data Protection Regulation). Official Journal of the European Union (2016)"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Evans, N.S., GauthierDickey, C., Grothoff, C.: Routing in the dark: pitch black. In: Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007), pp. 305\u2013314. IEEE (2007)","DOI":"10.1109\/ACSAC.2007.7"},{"issue":"5","key":"7_CR28","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/JSAC.2006.872882","volume":"24","author":"M Feldman","year":"2006","unstructured":"Feldman, M., Papadimitriou, C., Chuang, J., Stoica, I.: Free-riding and whitewashing in peer-to-peer systems. IEEE J. Sel. Areas Commun. 24(5), 1010\u20131019 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"2","key":"7_CR29","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/105864001300122476","volume":"10","author":"EJ Friedman","year":"2001","unstructured":"Friedman, E.J., Resnick, P.: The social cost of cheap pseudonyms. J. Econ. Manage. Strategy 10(2), 173\u2013199 (2001)","journal-title":"J. Econ. Manage. Strategy"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Garcia Lopez, P., Montresor, A., Datta, A.: Please, do not Decentralize the Internet with (Permissionless) Blockchains! In: 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS), pp. 1901\u20131911, July 2019. https:\/\/doi.org\/10.1109\/ICDCS.2019.00188 . ISSN 1063\u20136927","DOI":"10.1109\/ICDCS.2019.00188"},{"key":"7_CR31","unstructured":"Golbeck, J.A.: Computing and applying trust in web-based social networks. Ph.D. thesis, University of Maryland (2005)"},{"key":"7_CR32","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal, P., Ferrara, E.: Graph embedding techniques, applications, and performance: a survey. Knowl.-Based Syst. 151, 78\u201394 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855\u2013864. ACM (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Gubichev, A., Bedathur, S., Seufert, S., Weikum, G.: Fast and accurate estimation of shortest paths in large graphs. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, pp. 499\u2013508. ACM (2010)","DOI":"10.1145\/1871437.1871503"},{"key":"7_CR35","unstructured":"Hamilton, W.L., Ying, R., Leskovec, J.: Representation learning on graphs: methods and applications. arXiv preprint arXiv:1709.05584 (2017)"},{"issue":"1","key":"7_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1592451.1592452","volume":"42","author":"K Hoffman","year":"2009","unstructured":"Hoffman, K., Zage, D., Nita-Rotaru, C.: A survey of attack and defense techniques for reputation systems. ACM Comput. Surv. (CSUR) 42(1), 1 (2009)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"7_CR37","unstructured":"Hvistendahl, M.: Inside China\u2019s vast new experiment in social ranking. Wired (2017). https:\/\/www.wired.com\/story\/age-of-social-credit\/"},{"key":"7_CR38","unstructured":"Jentzsch, C.: Decentralized autonomous organization to automate governance. White paper, November 2016"},{"issue":"2","key":"7_CR39","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/j.dss.2005.05.019","volume":"43","author":"A J\u00f6sang","year":"2007","unstructured":"J\u00f6sang, A., Ismail, R., Boyd, C.: A survey of trust and reputation systems for online service provision. Decis. Support Syst. 43(2), 618\u2013644 (2007)","journal-title":"Decis. Support Syst."},{"key":"7_CR40","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/1282427.1282388","volume":"37","author":"MA Kaafar","year":"2007","unstructured":"Kaafar, M.A., Mathy, L., Barakat, C., Salamatian, K., Turletti, T., Dabbous, W.: Securing internet coordinate embedding systems. ACM SIGCOMM Comput. Commun. Rev. 37, 61\u201372 (2007)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"7_CR41","doi-asserted-by":"crossref","unstructured":"Kaafar, M.A., Mathy, L., Turletti, T., Dabbous, W.: Real attacks on virtual networks: Vivaldi out of tune. In: Proceedings of the 2006 SIGCOMM Workshop on Large-Scale Attack Defense, pp. 139\u2013146. ACM (2006)","DOI":"10.1145\/1162666.1162672"},{"issue":"1","key":"7_CR42","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jcss.2007.04.014","volume":"74","author":"D Kempe","year":"2008","unstructured":"Kempe, D., McSherry, F.: A decentralized algorithm for spectral analysis. J. Comput. Syst. Sci. 74(1), 70\u201383 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR43","doi-asserted-by":"crossref","unstructured":"Kermarrec, A.M., Leroy, V., Tr\u00e9dan, G.: Distributed social graph embedding. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, pp. 1209\u20131214. ACM (2011)","DOI":"10.1145\/2063576.2063751"},{"key":"7_CR44","unstructured":"Klein, T.J., Lambertz, C., Spagnolo, G., Stahl, K.O.: Last minute feedback. Technical report, SFB\/TR 15 Discussion Paper (2006)"},{"issue":"5","key":"7_CR45","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604\u2013632 (1999)","journal-title":"J. ACM"},{"issue":"6798","key":"7_CR46","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1038\/35022643","volume":"406","author":"JM Kleinberg","year":"2000","unstructured":"Kleinberg, J.M.: Navigation in a small world. Nature 406(6798), 845 (2000)","journal-title":"Nature"},{"key":"7_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/3-540-45071-8_50","volume-title":"Computing and Combinatorics","author":"Y Koren","year":"2003","unstructured":"Koren, Y.: On spectral graph drawing. In: Warnow, T., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 496\u2013508. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45071-8_50"},{"key":"7_CR48","unstructured":"Lapowsky, I.: California Unanimously Passes Historic Privacy Bill. Wired, June 2018. https:\/\/www.wired.com\/story\/california-unanimously-passes-historic-privacy-bill\/"},{"issue":"2","key":"7_CR49","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/382979.383041","volume":"19","author":"R Lempel","year":"2001","unstructured":"Lempel, R., Moran, S.: SALSA: the stochastic approach for link-structure analysis. ACM Trans. Inf. Syst. (TOIS) 19(2), 131\u2013160 (2001)","journal-title":"ACM Trans. Inf. Syst. (TOIS)"},{"issue":"5","key":"7_CR50","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1109\/TNET.2012.2228881","volume":"21","author":"Y Liao","year":"2013","unstructured":"Liao, Y., Du, W., Geurts, P., Leduc, G.: DMFSGD: a decentralized matrix factorization algorithm for network distance prediction. IEEE\/ACM Trans. Networking (TON) 21(5), 1511\u20131524 (2013)","journal-title":"IEEE\/ACM Trans. Networking (TON)"},{"key":"7_CR51","doi-asserted-by":"crossref","unstructured":"Ling, Q., Xu, Y., Yin, W., Wen, Z.: Decentralized low-rank matrix completion. In: 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 2925\u20132928. IEEE (2012)","DOI":"10.1109\/ICASSP.2012.6288528"},{"key":"7_CR52","doi-asserted-by":"publisher","unstructured":"Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Approximate nearest neighbor algorithm based on navigable small world graphs. Inf. Syst. 45, 61\u201368 (2014). https:\/\/doi.org\/10.1016\/j.is.2013.10.006 , http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0306437913001300 . ISSN 0306\u20134379","DOI":"10.1016\/j.is.2013.10.006"},{"issue":"12","key":"7_CR53","doi-asserted-by":"publisher","first-page":"2273","DOI":"10.1109\/JSAC.2006.884026","volume":"24","author":"Y Mao","year":"2006","unstructured":"Mao, Y., Saul, L.K., Smith, J.M.: Ides: an internet distance estimation service for large networks. IEEE J. Sel. Areas Commun. 24(12), 2273\u20132284 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"7_CR54","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"7_CR55","doi-asserted-by":"crossref","unstructured":"Ng, T.E., Zhang, H.: Predicting internet network distance with coordinates-based approaches. In: Proceedings of the Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1, pp. 170\u2013179. IEEE (2002)","DOI":"10.1109\/INFCOM.2002.1019258"},{"key":"7_CR56","unstructured":"Ng, T.E., Zhang, H.: A network positioning system for the internet. In: USENIX Annual Technical Conference, General Track, pp. 141\u2013154 (2004)"},{"key":"7_CR57","unstructured":"Pearson, J.: Peeple has backtracked to the point of pointlessness. Motherboard (2015). https:\/\/motherboard.vice.com\/en_us\/article\/vv74z3\/peeple-has-backtracked-to-the-point-of-pointlessness"},{"key":"7_CR58","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: Online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701\u2013710. ACM (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"7_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-45172-3_26","volume-title":"Peer-to-Peer Systems II","author":"M Pias","year":"2003","unstructured":"Pias, M., Crowcroft, J., Wilbur, S., Harris, T., Bhatti, S.: Lighthouses for scalable distributed location. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 278\u2013291. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45172-3_26"},{"key":"7_CR60","unstructured":"Poon, J., Dryja, T.: The Bitcoin Lightning network: Scalable off-chain instant payments (2016). https:\/\/lightning.network\/lightning-network-paper.pdf"},{"key":"7_CR61","doi-asserted-by":"publisher","unstructured":"Qiu, J., Dong, Y., Ma, H., Li, J., Wang, K., Tang, J.: Network embedding as matrix factorization: unifying DeepWalk, LINE, PTE, and Node2vec. In: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, WSDM 2018, pp. 459\u2013467. ACM, New York (2018). https:\/\/doi.org\/10.1145\/3159652.3159706 . ISBN 978-1-4503-5581-0; Event-place: Marina Del Rey, CA, USA","DOI":"10.1145\/3159652.3159706"},{"key":"7_CR62","unstructured":"Raiden: What is the Raiden network? (2019). https:\/\/raiden.network\/101.html"},{"issue":"13","key":"7_CR63","first-page":"1","volume":"7","author":"M Rogers","year":"2007","unstructured":"Rogers, M., Bhatti, S.: How to disappear completely: a survey of private peer-to-peer networks. RN 7(13), 1 (2007)","journal-title":"RN"},{"key":"7_CR64","doi-asserted-by":"crossref","unstructured":"Roos, S., Beck, M., Strufe, T.: Anonymous addresses for efficient and resilient routing in F2F overlays. In: IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications, pp. 1\u20139. IEEE (2016)","DOI":"10.1109\/INFOCOM.2016.7524553"},{"key":"7_CR65","doi-asserted-by":"crossref","unstructured":"Roos, S., Moreno-Sanchez, P., Kate, A., Goldberg, I.: Settling payments fast and private: efficient decentralized routing for path-based transactions. arXiv preprint arXiv:1709.05748 (2017)","DOI":"10.14722\/ndss.2018.23252"},{"key":"7_CR66","doi-asserted-by":"crossref","unstructured":"Rozas, D., Tenorio-Forn\u00e9s, A., D\u00edaz-Molina, S., Hassan, S.: When Ostrom meets blockchain: exploring the potentials of blockchain for commons governance. Available at SSRN 3272329 (2018)","DOI":"10.2139\/ssrn.3272329"},{"key":"7_CR67","doi-asserted-by":"crossref","unstructured":"Sandberg, O.: Distributed routing in small-world networks. In: 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 144\u2013155. SIAM (2006)","DOI":"10.1137\/1.9781611972863.14"},{"key":"7_CR68","doi-asserted-by":"crossref","unstructured":"Schiller, B., Roos, S., Hofer, A., Strufe, T.: Attack resistant network embeddings for darknets. In: 2011 IEEE 30th Symposium on Reliable Distributed Systems Workshops, pp. 90\u201395. IEEE (2011)","DOI":"10.1109\/SRDSW.2011.19"},{"issue":"6","key":"7_CR69","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/TNET.2004.838597","volume":"12","author":"Y Shavitt","year":"2004","unstructured":"Shavitt, Y., Tankel, T.: Big-bang simulation for embedding network distances in euclidean space. IEEE\/ACM Trans. Networking (TON) 12(6), 993\u20131006 (2004)","journal-title":"IEEE\/ACM Trans. Networking (TON)"},{"key":"7_CR70","unstructured":"Sherr, M., Blaze, M., Loo, B.T.: Veracity: practical secure network coordinates via vote-based agreements. In: Proceedings of the 2009 Conference on USENIX Annual Technical Conference, p. 13. USENIX Association (2009)"},{"key":"7_CR71","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Mei, Q.: PTE: predictive text embedding through large-scale heterogeneous text networks. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1165\u20131174. ACM (2015)","DOI":"10.1145\/2783258.2783307"},{"key":"7_CR72","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line: large-scale information network embedding. In: Proceedings of the 24th International Conference on World Wide Web, pp. 1067\u20131077. International World Wide Web Conferences Steering Committee (2015)","DOI":"10.1145\/2736277.2741093"},{"issue":"1","key":"7_CR73","first-page":"61","volume":"1","author":"J Travers","year":"1967","unstructured":"Travers, J., Milgram, S.: The small world problem. Phychol. Today 1(1), 61\u201367 (1967)","journal-title":"Phychol. Today"},{"key":"7_CR74","unstructured":"Vincent, A.: Black Mirror is coming true in China, where your \u2018rating\u2019 affects your home, transport and social circle. The Telegraph (2017). https:\/\/www.telegraph.co.uk\/on-demand\/2017\/12\/15\/black-mirror-coming-true-china-rating-affects-home-transport\/"},{"key":"7_CR75","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1007\/11549468_125","volume-title":"Euro-Par 2005 Parallel Processing","author":"S Voulgaris","year":"2005","unstructured":"Voulgaris, S., van Steen, M.: Epidemic-style management of semantic overlays for content-based searching. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 1143\u20131152. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11549468_125"},{"key":"7_CR76","first-page":"1","volume":"151","author":"G Wood","year":"2014","unstructured":"Wood, G.: Ethereum: a secure decentralised generalised transaction ledger. Ethereum Proj. Yellow Paper 151, 1\u201332 (2014)","journal-title":"Ethereum Proj. Yellow Paper"},{"key":"7_CR77","doi-asserted-by":"crossref","unstructured":"Yu, H., Gibbons, P.B., Kaminsky, M., Xiao, F.: Sybillimit: a near-optimal social network defense against sybil attacks. In: 2008 IEEE Symposium on Security and Privacy (S&P 2008), pp. 3\u201317. IEEE (2008)","DOI":"10.1109\/SP.2008.13"},{"key":"7_CR78","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/1151659.1159945","volume":"36","author":"H Yu","year":"2006","unstructured":"Yu, H., Kaminsky, M., Gibbons, P.B., Flaxman, A.: Sybilguard: defending against sybil attacks via social networks. ACM SIGCOMM Comput. Commun. Rev. 36, 267\u2013278 (2006)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"7_CR79","unstructured":"Zhai, E., Wolinsky, D.I., Chen, R., Syta, E., Teng, C., Ford, B.: AnonRep: towards tracking-resistant anonymous reputation. In: 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2016), pp. 583\u2013596. USENIX Association, Santa Clara, Mar 2016. https:\/\/www.usenix.org\/conference\/nsdi16\/technical-sessions\/presentation\/zhai . ISBN 978-1-931971-29-4"},{"key":"7_CR80","first-page":"5","volume":"1","author":"X Zhao","year":"2010","unstructured":"Zhao, X., Sala, A., Wilson, C., Zheng, H., Zhao, B.Y.: Orion: shortest path estimation for large social graphs. Networks 1, 5 (2010)","journal-title":"Networks"},{"key":"7_CR81","doi-asserted-by":"crossref","unstructured":"Zhao, X., Sala, A., Zheng, H., Zhao, B.Y.: Efficient shortest paths on massive social graphs. In: 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom), pp. 77\u201386. IEEE (2011)","DOI":"10.4108\/icst.collaboratecom.2011.247162"},{"key":"7_CR82","unstructured":"Zimmerman, P.: PGP user\u2019s guide (1994)"}],"container-title":["Lecture Notes in Computer Science","Privacy Technologies and Policy"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-55196-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:46:36Z","timestamp":1723761996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-55196-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030551957","9783030551964"],"references-count":82,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-55196-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APF","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Privacy Forum","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apf2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/privacyforum.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"https:\/\/privacyforum.eu\/","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}