Reliable resource searching in P2P networks

Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia, Nikos Triandopoulos

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

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(log2n) messages and content from a collection of m data items is securely retrieved with O(lognlogm) messages.

Original languageEnglish
Title of host publicationSecurity and Privacy in Communication Networks - 5th International ICST Conference, SecureComm 2009, Revised Selected Papers
Pages437-447
Number of pages11
DOIs
StatePublished - 2009
Event5th International ICST Conference on Security and Privacy in Communication Networks, SecureComm 2009 - Athens, Greece
Duration: 14 Sep 200918 Sep 2009

Publication series

NameLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Volume19 LNICST
ISSN (Print)1867-8211

Conference

Conference5th International ICST Conference on Security and Privacy in Communication Networks, SecureComm 2009
Country/TerritoryGreece
CityAthens
Period14/09/0918/09/09

Keywords

  • Digital signatures
  • Distributed hash tables
  • Oneway hash functions
  • Overlay networks
  • Peer-to-peer

Fingerprint

Dive into the research topics of 'Reliable resource searching in P2P networks'. Together they form a unique fingerprint.

Cite this