Skip to main content
SpringerLink
Log in

Webs of Trust: Choosing Who to Trust on the Internet

  • Conference paper
  • First Online:
Privacy Technologies and Policy (APF 2020)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 12121))

Included in the following conference series:

Abstract

How to decide whether to engage in transactions with strangers? Whether we’re offering a ride, renting a room or apartment, buying or selling items, or even lending money, we need a degree of trust that the others will behave as they should. Systems like Airbnb, Uber, Blablacar, eBay and others handle this by creating systems where people initially start as untrusted, and they gain reputation over time by behaving well. Unfortunately, these systems are proprietary and siloed, meaning that all information about transactions becomes property of the company managing the systems, and that there are two types of barriers to entry: first, whenever new users enter a new system they will need to restart from scratch as untrusted, without the possibility of exploiting the reputation they gained elsewhere; second, new applications have a similar cold-start problem: young systems, where nobody has reputation yet, are difficult to kickstart.

We propose a solution based on a web of trust: a decentralized repository of data about past interactions between users, without any trusted third party. We think this approach can solve the aforementioned issue, establishing a notion of trust that can be used across applications while protecting user privacy. Several problems require consideration, such as scalability and robustness, as well as the trade-off between privacy and accountability.

In this paper, we provide an overview of issues and solutions available in the literature, and we discuss the directions to take to pursue this project.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. California States Assembly: The California Consumer Privacy Act of 2018 (2018). https://leginfo.legislature.ca.gov/faces/billTextClient.xhtml?bill_id=201720180AB375

  2. Avesani, P., Massa, P., Tiella, R.: Moleskiing. it: a trust-aware recommender system for SKI mountaineering. Int. J. Infonom. 20(35), 1–10 (2005)

    Google Scholar 

  3. Axelrod, R., Hamilton, W.D.: The evolution of cooperation. Science 211(4489), 1390–1396 (1981)

    Article  MathSciNet  Google Scholar 

  4. Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. CryptolePrint Arch., Technical report 46, 2018 (2018)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. 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–140. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04944-6_11

    Chapter  Google Scholar 

  7. 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–349. 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

  8. Bojchevski, A., Günnemann, S.: adversarial attacks on node embeddings via graph poisoning. In: International Conference on Machine Learning, pp. 695–704 (2019)

    Google Scholar 

  9. 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–347 (2011)

    Article  Google Scholar 

  10. Chen, Y., Wu, S., Li, J., Fu, X.: NCShield: protecting decentralized, matrix factorization-based network coordinate systems. IEEE Trans. Serv. Comput. 10(2), 244–257 (2017). https://doi.org/10.1109/TSC.2015.2437383. ISSN 1939–1374

    Article  Google Scholar 

  11. Cheng, A., Friedman, E.: Sybilproof reputation mechanisms. In: Proceedings of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems, pp. 128–132. ACM (2005)

    Google Scholar 

  12. Chwelos, P., Dhar, T.: Caveat emptor: Differences in online reputation mechanisms. Technical report, Working Paper, Sauder School of Business, University of British Columbia (2006)

    Google Scholar 

  13. 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–66. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44702-4_4

    Chapter  Google Scholar 

  14. Cohen, B.: Incentives build robustness in bittorrent. Workshop Econ. Peer-to-Peer Syst. 6, 68–72 (2003)

    Google Scholar 

  15. 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–187. IEEE (2004)

    Google Scholar 

  16. Cox, R., Dabek, F., Kaashoek, F., Li, J., Morris, R.: Practical, distributed network coordinates. ACM SIGCOMM Comput. Commun. Rev. 34(1), 113–118 (2004)

    Article  Google Scholar 

  17. Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: a decentralized network coordinate system. ACM SIGCOMM Comput. Commun. Rev. 34, 15–26 (2004)

    Google Scholar 

  18. 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–410. ACM (2010)

    Google Scholar 

  19. Dell’Amico, M.: Mapping small worlds. In: Seventh IEEE International Conference on Peer-to-Peer Computing, P2P 2007, pp. 219–228. IEEE (2007)

    Google Scholar 

  20. Dell’Amico, M.: Exploiting Social Networks in Robust P2P Applications. Ph.D. thesis, Università degli Studi di Genova (2008). https://www.disi.unige.it/person/DellamicoM/research/phd-thesis.pdf

  21. Dell’Amico, M., Capra, L.: Dependable filtering: philosophy and realizations. ACM Trans. Inf. Syst. (TOIS) 29(1), 5 (2010)

    Google Scholar 

  22. Dell’Amico, 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)

    Google Scholar 

  23. Douceur, J.R.: The sybil attack. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251–260. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45748-8_24

    Chapter  Google Scholar 

  24. DuPont, Q.: Experiments in algorithmic governance: a history and ethnography of “the dao,” a failed decentralized autonomous organization. In: Bitcoin and Beyond, pp. 157–177. Routledge (2017)

    Google Scholar 

  25. Ethereum: Ethereum: the world computer (2015). https://www.youtube.com/watch?v=j23HnORQXvs

  26. 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)

    Google Scholar 

  27. 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–314. IEEE (2007)

    Google Scholar 

  28. 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–1019 (2006)

    Article  Google Scholar 

  29. Friedman, E.J., Resnick, P.: The social cost of cheap pseudonyms. J. Econ. Manage. Strategy 10(2), 173–199 (2001)

    Article  Google Scholar 

  30. 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–1911, July 2019. https://doi.org/10.1109/ICDCS.2019.00188. ISSN 1063–6927

  31. Golbeck, J.A.: Computing and applying trust in web-based social networks. Ph.D. thesis, University of Maryland (2005)

    Google Scholar 

  32. Goyal, P., Ferrara, E.: Graph embedding techniques, applications, and performance: a survey. Knowl.-Based Syst. 151, 78–94 (2018)

    Article  Google Scholar 

  33. 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–864. ACM (2016)

    Google Scholar 

  34. 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–508. ACM (2010)

    Google Scholar 

  35. Hamilton, W.L., Ying, R., Leskovec, J.: Representation learning on graphs: methods and applications. arXiv preprint arXiv:1709.05584 (2017)

  36. 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)

    Article  Google Scholar 

  37. Hvistendahl, M.: Inside China’s vast new experiment in social ranking. Wired (2017). https://www.wired.com/story/age-of-social-credit/

  38. Jentzsch, C.: Decentralized autonomous organization to automate governance. White paper, November 2016

    Google Scholar 

  39. Jösang, A., Ismail, R., Boyd, C.: A survey of trust and reputation systems for online service provision. Decis. Support Syst. 43(2), 618–644 (2007)

    Article  Google Scholar 

  40. 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–72 (2007)

    Article  Google Scholar 

  41. 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–146. ACM (2006)

    Google Scholar 

  42. Kempe, D., McSherry, F.: A decentralized algorithm for spectral analysis. J. Comput. Syst. Sci. 74(1), 70–83 (2008)

    Article  MathSciNet  Google Scholar 

  43. Kermarrec, A.M., Leroy, V., Trédan, G.: Distributed social graph embedding. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, pp. 1209–1214. ACM (2011)

    Google Scholar 

  44. Klein, T.J., Lambertz, C., Spagnolo, G., Stahl, K.O.: Last minute feedback. Technical report, SFB/TR 15 Discussion Paper (2006)

    Google Scholar 

  45. Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604–632 (1999)

    Article  MathSciNet  Google Scholar 

  46. Kleinberg, J.M.: Navigation in a small world. Nature 406(6798), 845 (2000)

    Article  Google Scholar 

  47. Koren, Y.: On spectral graph drawing. In: Warnow, T., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 496–508. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-45071-8_50

    Chapter  Google Scholar 

  48. Lapowsky, I.: California Unanimously Passes Historic Privacy Bill. Wired, June 2018. https://www.wired.com/story/california-unanimously-passes-historic-privacy-bill/

  49. Lempel, R., Moran, S.: SALSA: the stochastic approach for link-structure analysis. ACM Trans. Inf. Syst. (TOIS) 19(2), 131–160 (2001)

    Article  Google Scholar 

  50. 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–1524 (2013)

    Article  Google Scholar 

  51. 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–2928. IEEE (2012)

    Google Scholar 

  52. Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Approximate nearest neighbor algorithm based on navigable small world graphs. Inf. Syst. 45, 61–68 (2014). https://doi.org/10.1016/j.is.2013.10.006, http://www.sciencedirect.com/science/article/pii/S0306437913001300. ISSN 0306–4379

  53. 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–2284 (2006)

    Article  Google Scholar 

  54. Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). https://bitcoin.org/bitcoin.pdf

  55. 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–179. IEEE (2002)

    Google Scholar 

  56. Ng, T.E., Zhang, H.: A network positioning system for the internet. In: USENIX Annual Technical Conference, General Track, pp. 141–154 (2004)

    Google Scholar 

  57. 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

  58. 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–710. ACM (2014)

    Google Scholar 

  59. 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–291. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45172-3_26

    Chapter  Google Scholar 

  60. Poon, J., Dryja, T.: The Bitcoin Lightning network: Scalable off-chain instant payments (2016). https://lightning.network/lightning-network-paper.pdf

  61. 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–467. ACM, New York (2018). https://doi.org/10.1145/3159652.3159706. ISBN 978-1-4503-5581-0; Event-place: Marina Del Rey, CA, USA

  62. Raiden: What is the Raiden network? (2019). https://raiden.network/101.html

  63. Rogers, M., Bhatti, S.: How to disappear completely: a survey of private peer-to-peer networks. RN 7(13), 1 (2007)

    Google Scholar 

  64. 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–9. IEEE (2016)

    Google Scholar 

  65. 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)

  66. Rozas, D., Tenorio-Fornés, A., Díaz-Molina, S., Hassan, S.: When Ostrom meets blockchain: exploring the potentials of blockchain for commons governance. Available at SSRN 3272329 (2018)

    Google Scholar 

  67. Sandberg, O.: Distributed routing in small-world networks. In: 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 144–155. SIAM (2006)

    Google Scholar 

  68. 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–95. IEEE (2011)

    Google Scholar 

  69. Shavitt, Y., Tankel, T.: Big-bang simulation for embedding network distances in euclidean space. IEEE/ACM Trans. Networking (TON) 12(6), 993–1006 (2004)

    Article  Google Scholar 

  70. 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)

    Google Scholar 

  71. 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–1174. ACM (2015)

    Google Scholar 

  72. 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–1077. International World Wide Web Conferences Steering Committee (2015)

    Google Scholar 

  73. Travers, J., Milgram, S.: The small world problem. Phychol. Today 1(1), 61–67 (1967)

    Google Scholar 

  74. Vincent, A.: Black Mirror is coming true in China, where your ‘rating’ 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/

  75. 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–1152. Springer, Heidelberg (2005). https://doi.org/10.1007/11549468_125

    Chapter  Google Scholar 

  76. Wood, G.: Ethereum: a secure decentralised generalised transaction ledger. Ethereum Proj. Yellow Paper 151, 1–32 (2014)

    Google Scholar 

  77. 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–17. IEEE (2008)

    Google Scholar 

  78. Yu, H., Kaminsky, M., Gibbons, P.B., Flaxman, A.: Sybilguard: defending against sybil attacks via social networks. ACM SIGCOMM Comput. Commun. Rev. 36, 267–278 (2006)

    Article  Google Scholar 

  79. 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–596. USENIX Association, Santa Clara, Mar 2016. https://www.usenix.org/conference/nsdi16/technical-sessions/presentation/zhai. ISBN 978-1-931971-29-4

  80. Zhao, X., Sala, A., Wilson, C., Zheng, H., Zhao, B.Y.: Orion: shortest path estimation for large social graphs. Networks 1, 5 (2010)

    Google Scholar 

  81. 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–86. IEEE (2011)

    Google Scholar 

  82. Zimmerman, P.: PGP user’s guide (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NortonLifeLock Research Group, Biot, France

    Matteo Dell’Amico

Authors
  1. Matteo Dell’Amico
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matteo Dell’Amico .

Editor information

Editors and Affiliations

  1. University of Porto, Porto, Portugal

    Luís Antunes

  2. LUMSA University, Rome, Italy

    Maurizio Naldi

  3. LUISS, Rome, Italy

    Giuseppe F. Italiano

  4. Goethe University Frankfurt, Frankfurt am Main, Germany

    Kai Rannenberg

  5. ENISA, Athens, Greece

    Prokopios Drogkaris

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dell’Amico, M. (2020). Webs of Trust: Choosing Who to Trust on the Internet. In: Antunes, L., Naldi, M., Italiano, G., Rannenberg, K., Drogkaris, P. (eds) Privacy Technologies and Policy. APF 2020. Lecture Notes in Computer Science(), vol 12121. Springer, Cham. https://doi.org/10.1007/978-3-030-55196-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-55196-4_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-55195-7

  • Online ISBN: 978-3-030-55196-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation