Abstract
Distributed security models based on a ‘web of trust’ eliminate single points of failure and alleviate performance bottlenecks. However, such distributed approaches rely on the ability to find trust paths between participants, which introduces performance overhead. It is therefore of importance to develop trust path discovery algorithms that minimize such overhead. Since peer-to-peer (P2P) networks share various characteristics with the web of trust, P2P search algorithms can potentially be exploited to find trust paths. In this paper we systematically evaluate the application of P2P search algorithms to the trust path discovery problem. We consider the number of iterations required (as expressed by the TTL parameter) as well as the messaging overhead, for discovery of single as well as multiple trust paths. Since trust path discovery does not allow for resource replication (usual in P2P applications), we observe that trust path discovery is very sensitive to parameter choices in selective forwarding algorithms (such as K-walker), but is relatively fast when the underlying network topology is scale-free.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Patil, V., Shyamasundar, R.: Trust management for e-transactions. Sadhana 30(2- 3), 141–158 (2005)
Housley, R., Polk, W., Ford, W., Solo, D.: Internet X. 509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile. IETF RFC 3280 (April 2002)
Zimmerman, P.: PGP User’s Guide. Massachusetts Institute of Technology (May 1994)
Ellison, C.M., Frantz, B., Lampson, B., Rivest, R., Thomas, B.M., Ylonen, T.: SPKI Certificate Theory. Internet Engineering Task Force RFC 2693 (September 1999)
Rivest, R.L., Lampson, B.: SDSI – A simple distributed security infrastructure. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, Springer, Heidelberg (1996)
Jøsang, A., Keser, C., Dimitrakos, T.: Can we manage trust? In: Herrmann, P., Issarny, V., Shiu, S.C.K. (eds.) iTrust 2005. LNCS, vol. 3477, pp. 93–107. Springer, Heidelberg (2005)
Skogsrud, H., Benatallah, B., Casati, F.: Model-driven trust negotiation for web services. In: IEEE Internet Computing, pp. 45–52. IEEE Computer Society Press, Los Alamitos (2003)
Spantzel, A.B., Squicciarini, A.C., Bertino, E.: Integrating federated identity management and trust negotiation. Technical Report 2005-46, CERIAS – Purdue University (2005)
Winslett, M., Yu, T., Seamons, K.E., Hess, A., Jacobson, J., Jarvis, R., Smith, B., Yu, L.: Negotiating trust on the web. In: IEEE Internet Computing. 6(6), pp. 30–37. IEEE Computer Society Press, Los Alamitos (2002)
Atif, Y.: Building trust in E-commerce. IEEE Internet Computing 6(1), 18–24 (2002)
de Mello, E.R., da Silva Fraga, J., Santin, A.O.: O uso do spki/sdsi em redes p2p. In: I Workshop sobre Redes Peer-to-Peer (WP2P 2005), Fortaleza, CE - Brasil, XXIII Simpósio Brasileiro de Redes de Computadores (SBRC 2005) (2005)
Santin, A.O., da Silva Fraga, J., Siqueira, F., de Mello, E.R.: Federation web: A scheme to compound authorization chains on large-scale distributed systems. In: 22nd Symposium on Reliable Distributed Systems (SRDS 2003), Florence - Italy (2003)
Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: INFOCOM (2004)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proceedings of the 16th international conference on Supercomputing, pp. 84–95 (2002)
Zhuang, Z., Liu, Y., Xiao, L., Ni, L.M.: Hybrid periodical flooding in unstructured peer-to-peer networks. In: ICPP, pp. 171–178. IEEE Computer Society Press, Los Alamitos (2003)
Penning, H.P.: Analysis of the strong set in the pgp web of trust (2006), http://www.cs.uu.nl/people/henkp/henkp/pgp/pathfinder/plot/
Burrows, M., Abadi, M., Needham, R.: A logic of authentication. ACM Trans. on Computer Sys. 8(1), 18 (1990)
Jøsang, A., Pope, S.: Semantic Constraints for Trust Transitivity. In: Research and Practice in Information Technology, vol. 43, ACS, Newcastle, Australia (2005)
Gnutella: The Gnutella Protocol Specification v0.4. Clip2 (2001)
Rowstron, A., Druschel, P.: Pastry: scalable, decentraized object location and routing for large-scale peer-to-peer systems. In: Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware) (November 2001)
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw 11(1), 17–32 (2003)
Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making gnutella-like P2P systems scalable. In: Proceedings of the ACM SIGCOMM 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 407–418. ACM Press, New York (2003)
Jiang, H., Jin, S.: Exploiting dynamic querying like flooding techniques in unstructured peer-to-peer networks. In: ICNP, pp. 122–131. IEEE Computer Society Press, Los Alamitos (2005)
Yang, B., Garcia-Molina, H.: Improving search in peer-to-peer networks. In: ICDCS, pp. 5–14 (2002)
Kazaa media desktop (2001), http://www.kazaa.com
Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74, 47 (2002)
Milgram, S.: The small world problem. Psychology Today 1, 61 (1967)
Capkun, S., Buttyan, L., Hubaux, J.P.: Small worlds in security systems: an analysis of the PGP certificate graph. In: Proceedings of the 2002 New Security Paradigms Workshop, September 2002, pp. 28–35 (2002)
Gnumap project (2002), http://home.comcast.net/~gregory.bray
Peersim p2p simulator (2004), http://peersim.sourceforge.net
Jesi, G.P.: Peersim howto: Build a new protocol for the peersim 1.0 simulator (December 2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Mello, E.R., van Moorsel, A., da Silva Fraga, J. (2007). Evaluation of P2P Search Algorithms for Discovering Trust Paths. In: Wolter, K. (eds) Formal Methods and Stochastic Models for Performance Evaluation. EPEW 2007. Lecture Notes in Computer Science, vol 4748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75211-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-75211-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75210-3
Online ISBN: 978-3-540-75211-0
eBook Packages: Computer ScienceComputer Science (R0)