Abstract
This paper presents the architecture of the iTrust system together with algorithms for maintaining censorship resistance. In iTrust, metadata describing documents, and requests containing keywords, are distributed to randomly chosen nodes in the iTrust network. If a node receives a request containing keywords that match metadata it holds, it sends the URL of the matching document to the requesting node, which then retrieves the document from the source node. A novel detection algorithm estimates the proportion of operational nodes in the iTrust network, by comparing the empirical probabilities of the number of responses received for a node’s request with the analytical probabilities for a match, for various proportions of operational nodes. A novel defensive adaptation algorithm increases the number of nodes to which the requests are distributed, in order to maintain the same high probability of a match when some of the nodes are non-operational or malicious as when all of the nodes are operational. Extensive experimental evaluations demonstrate the effectiveness of the architecture and the algorithms for maintaining censorship resistance in the iTrust network.


















Similar content being viewed by others
References
Belen R (2009) Detecting Disguised Missing Data. Ph.D. Dissertation, Middle East Technical University
Chawathe Y, Ratnasamy S, Breslau L, Lanham N, Shenker S (2003) Making Gnutella-like P2P systems scalable. In: Proceedings of the ACM special interest group on data communication conference, Karlsruhe, pp 407–418
Chuang YT, Michel Lombera I, Moser LE, Melliar-Smith PM (2011) Trustworthy distributed search and retrieval over the Internet. In: Proceedings of the international conference on internet computing, Las Vegas, pp 169–175
Chuang YT, Melliar-Smith PM, Moser LE, Michel Lombera I (2012) Protecting the iTrust information retrieval network against malicious attacks. J Comput Sci Eng 6(3):179–192
Chuang YT, Melliar-Smith PM, Moser LE, Michel Lombera I Membership protocols for the iTrust community network, submitted
Cohen E, Shenker S (2002) Replication strategies in unstructured peer-to-peer networks. In: Proceedings of the ACM special interest group on data communications conference, Pittsburgh, pp 177–190
Condie T, Kamvar SD, Garcia-Molina H (2004) Adaptive peer-to-peer topologies. In: Proceedings of the 4th IEEE international conference on peer-to-peer computing, Zurich, pp 53–62
Cooper BF, Garcia-Molina H (2005) Ad hoc, self-supervising peer-to-peer search networks. ACM Trans Inf Syst 23(2):169–200
Ferreira RA, Ramanathan MK, Awan A, Grama A, Jagannathan S (2005) Search with probabilistic guarantees in unstructured peer-to-peer networks. In: Proceedings of the 5th IEEE international conference on peer-to-peer computing, Konstanz, pp 165–172
Freenet (2014) http://freenetproject.org/
Gnutella (2014) http://www.gnutella.wego.com
Goonatilake R, Herath A, Herath S, Herath J (2007) Intrusion detection using the chi-square goodness-of-fit test for information assurance, network forensics and software security. J Comput Sci Coll 23(1):255–263
Hales D (2004) From selfish nodes to cooperative networks - Emergent link-based incentives in peer-to-peer networks. In: Proceedings of the 4th international conference on peer-to-peer computing, Bologna, pp 151–158
Heckert A (2014) Chi-square two sample tests, http://www.itl.nist.gov/div898/software/dataplot/refman1/auxillar/chi2samp.htm
Lazarevic A, Ertoz L, Kumar V, Ozgur A, Srivastava J (2003) A comparative study of anomaly detection schemes in network intrusion detection. In: Proceedings of the 3rd SIAM international conference on data mining, San Francisco, pp 25–36
Leng C, Terpstra WW, Kemme B, Stannat W, Buchmann AP (2008) Maintaining replicas in unstructured P2P systems. In: Proceedings of the ACM conference on emerging networking experiments and technologies, Madrid, p 19
Luu T, Skobeltsyn G, Klemm F, Puh M, Zarko IP, Rajman M, Aberer K (2008) AlvisP2P: scalable peer-to-peer text retrieval in a structured P2P network. In: Proceedings of the VLDB Endowment. vol. 1 no.2, pp 1424–1427
Lv Q, Cao P, Cohen E, Li K, Shenker S (2002) Search and replication in unstructured peer-to-peer networks. In: Proceedings of the 16th international conference on supercomputing, Baltimore, pp 84–95
Melliar-Smith PM, Moser LE, Michel Lombera I, Chuang YT (2012) iTrust: Trustworthy information publication, search and retrieval. In: Proceedings of the 13th international conference on distributed computing and networking, LNCS 7129. Springer, Hong Kong, pp 351–366
Michel Lombera I, Chuang YT, Melliar-Smith PM, Moser LE (2011) Trustworthy distribution and retrieval of information over HTTP and the Internet. In: Proceedings of the 3rd international conference on the evolving internet, Luxembourg City, pp 7–13
Mischke J, Stiller B (2004) A methodology for the design of distributed search in P2P middleware. IEEE Netw 18(1):30– 37
Morselli R, Bhattacharjee B, Srinivasan A, Marsh MA (2005) Efficient lookup on unstructured topologies. In: Proceedings of the 24th ACM symposium on principles of distributed computing, Las Vegas, pp 77–86
Press WH, Teukolsky SA, Vetterling WT, Flannery BP (2007) Numerical recipes in fortran: the art of scientific computing. Cambridge University Press, Cambridge
Raftopoulou P, Petrakis EGM (2008) iCluster: a self-organizing overlay network for P2P information retrieval. In: Advances in information retrieval. Springer, Berlin Heidelberg, pp 65–76
Reynolds P, Vahdat A (2013) Peer-to-peer keyword search: a retrospective. In: Proceedings of the 2013 ACM middleware conference, LNCS 8275. Springer, Beijing, pp 485–496
Richardson S, Cox IJ (2014) Estimating global statistics for unstructured P2P search in the presence of adversarial peers. In: Procedings of the 37th international ACM SIGIR conference on research and development in information retrieval, Gold Coast, Queensland, pp 203–212
Roberts SW (2000) Control chart tests based on geometric moving averages. Technometrics 42(1):97–101
Skobeltsyna G, Luua T, Zarkob IP, Rajmana M, Aberera K (2009) Query-driven indexing for scalable peer-to-peer text retrieval. Futur Gener Comput Syst 25(1):89–99
Tahoe-LAFS (2014) Documentation for Tahoe-LAFS Users. https://tahoe-lafs.org/trac/tahoe-lafs/wiki/Doc
Terpstra WW, Kangasharju J, Leng C, Buchmann AP (2007) Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search. In: Proceedings of the ACM conference on applications, technologies, architectures and protocols for computer communications, Kyoto, pp 49–60
Tsoumakos D, Roussopoulos N (2003) Adaptive probabilistic search for peer-to-peer networks. In: Proceedings of the IEEE 3rd international conference on peer-to-peer computing, Linkoping, pp 102–109
Viinikka J, Debar H (2004) Monitoring IDS background noise using EWMA control charts and alert information. In: Recent advances in intrusion detection. Springer, French Riviera, pp 166–187
Ye N, Chen Q (2001) An anomaly detection technique based on a chi-square statistic for detecting intrusions into information systems. Int J Qual Rehab Eng 17(2):105–112
Zhang R, Hu YC (2007) Assisted peer-to-peer search with partial indexing. IEEE Trans Parallel and Distributed Syst 18(8):1146–1158
Zhou B, Shi Q, Merabti M (2006) Intrusion detection in pervasive networks based on a chi-square statistic test. In: Proceedings of the 30th international computer software and applications conference, vol 2, Chicago, pp 203–208
Acknowledgments
This research was supported in part by the U.S. National Science Foundation under grant NSF CNS 10-16193.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chuang, YT., Melliar-Smith, P.M., Moser, L.E. et al. Maintaining censorship resistance in the iTrust network for publication, search and retrieval. Peer-to-Peer Netw. Appl. 9, 266–283 (2016). https://doi.org/10.1007/s12083-015-0327-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12083-015-0327-1