iTrust: trustworthy information publication, search and retrieval

Authors:
Peter Michael Melliar-Smith;Louise E. Moser;Isai Michel Lombera;Yung-Ting Chuang
Affiliations:
Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA
Venue:
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Year:
2012

Citing 14
Cited 1

On the impossibility of group membership

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Freenet: a distributed anonymous information storage and retrieval system

International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Group communication specifications: a comprehensive study

ACM Computing Surveys (CSUR)
Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Replication strategies in unstructured peer-to-peer networks

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities

HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Improving Search in Peer-to-Peer Networks

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
The many faces of publish/subscribe

ACM Computing Surveys (CSUR)
An Efficient Interest-Group Based Search Mechanism in Unstructured Peer-to-Peer Networks

ICCNMC '03 Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing
Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks

P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Privacy-preserving P2P data sharing with OneSwarm

Proceedings of the ACM SIGCOMM 2010 conference
Quasar: a probabilistic publish-subscribe system for social networks

IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
A methodology for the design of distributed search in P2P middleware

IEEE Network: The Magazine of Global Internetworking

Gossiping for resource discovering: An analysis based on complex network theory

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The iTrust system is a decentralized and distributed information publication, search and retrieval system, whose objective is to prevent censorship and filtering of information accessed over the Internet. In iTrust, metadata describing information are randomly distributed to multiple participating nodes. Similarly, requests containing keywords are randomly distributed to multiple participating nodes. If a participating node receives a request and the keywords in the request match the metadata it holds, the participating node sends the URL for the information to the requesting node. The requesting node then can retrieve the information from the source node. In this paper, we present the iTrust messaging and membership protocols. We establish lower bounds for the probabilities of a match if all of the participating nodes are operational and if a proportion of the participating nodes are non-operational or subverted. We provide probabilistic results for n participating nodes, where the metadata and the requests are distributed to a multiple of the square root of n nodes. These results show that distribution of the metadata and the requests to relatively few nodes suffices to achieve a high probability of a match, even if some of the nodes are non-operational or subverted.