Reliable Resource Searching in P2P Networks

  • Michael T. Goodrich
  • Jonathan Z. Sun
  • Roberto Tamassia
  • Nikos Triandopoulos
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 19)


We study the problem of securely searching for resources in p2p networks where a constant fraction of the peers may act maliciously. We present two novel hashing-based schemes that can be employed to reliably support resource location and content retrieval queries, limiting the ability of adversarial nodes to carry out attacks. Our schemes achieve scalability and load balancing and have small authentication overhead. In particular, for a network with n peers, resources are securely located with O(log2 n) messages and content from a collection of m data items is securely retrieved with O(logn logm) messages.


peer-to-peer overlay networks distributed hash tables one-way hash functions digital signatures 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aspnes, J., Shah, G.: Skip graphs. In: SODA, pp. 384–393. ACM, New York (2003)Google Scholar
  2. 2.
    Awerbuch, B., Scheideler, C.: Towards a scalable and robust DHT. In: SPAA, pp. 318–327. ACM, New York (2006)Google Scholar
  3. 3.
    Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.S.: Secure routing for structured P2P overlay networks. In: OSDI, pp. 299–314. ACM, New York (2002)CrossRefGoogle Scholar
  4. 4.
    Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: SOSP, pp. 202–215. ACM, New York (2001)Google Scholar
  5. 5.
    Fiat, A., Saia, J.: Censorship resistant peer-to-peer content addressable networks. In: SODA, pp. 94–103. ACM, New York (2002)Google Scholar
  6. 6.
    Fiat, A., Saia, J., Young, M.: Making Chord robust to Byzantine attacks. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 803–814. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Fu, K., Kaashoek, M.F., Mazieres, D.: Fast and secure distributed read-only file system. Transactions on Computer Systems 20(1), 1–24 (2002)CrossRefGoogle Scholar
  8. 8.
    Goodrich, M.T., Tamassia, R., Schwerin, A.: Implementation of an authenticated dictionary with skip lists and commutative hashing. In: DISCEX 2002, p. 1068. IEEE, Los Alamitos (2001)Google Scholar
  9. 9.
    Kapadia, A., Triandopoulos, N.: Halo: High assurance locate for distributed hash tables. In: NDSS, pp. 61–79 (2008); Internet SocietyGoogle Scholar
  10. 10.
    Kothapalli, K., Scheideler, C.: Supervised peer-to-peer systems. In: I-SPAN, pp. 188–193. IEEE, Los Alamitos (2005)Google Scholar
  11. 11.
    Nambiar, A., Wright, M.: Salsa: a structured approach to large-scale anonymity. In: CCS, pp. 17–26. ACM, New York (2006)Google Scholar
  12. 12.
    Overmars, M.H.: The Design of Dynamic Data Structures, vol. 156. Springer, Heidelberg (1983)zbMATHGoogle Scholar
  13. 13.
    Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Communications of the ACM 33(6), 668–676 (1990)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM, pp. 161–172. ACM, New York (2001)Google Scholar
  15. 15.
    Rhea, S., Godfrey, B., Karp, B., Kubiatowicz, J., Ratnasamy, S., Shenker, S., Stoica, I., Yu, H.: OpenDHT: A public DHT service and its uses. In: SIGCOMM, pp. 73–84. ACM, New York (2005)Google Scholar
  16. 16.
    Saia, J., Fiat, A., Gribble, S.D., Karlin, A.R., Saroiu, S.: Dynamically fault-tolerant content addressable networks. In: IPTPS, pp. 270–279. Springer, Heidelberg (2002)Google Scholar
  17. 17.
    Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable P2P lookup service for Internet applications. In: SIGCOMM, pp. 149–160 (2001)Google Scholar
  18. 18.
    Tamassia, R., Triandopoulos, N.: Efficient content authentication in peer-to-peer networks. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 354–372. Springer, Heidelberg (2007)CrossRefGoogle Scholar

Copyright information

© ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering 2009

Authors and Affiliations

  • Michael T. Goodrich
    • 1
  • Jonathan Z. Sun
    • 2
  • Roberto Tamassia
    • 3
  • Nikos Triandopoulos
    • 3
    • 4
  1. 1.Dept. of Computer ScienceU. CaliforniaIrvineUSA
  2. 2.School of ComputingUniv. of Southern MississippiUSA
  3. 3.Dept. of Computer ScienceBrown UniversityUSA
  4. 4.Dept. of Computer ScienceBoston UniversityUSA

Personalised recommendations