Journal of Computing Science and Engineering

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지
DOI QR코드

DOI QR Code

Protecting the iTrust Information Retrieval Network against Malicious Attacks

  • Chuang, Yung-Ting (Department of Electrical and Computer Engineering, University of California) ;
  • Melliar-Smith, P. Michael (Department of Electrical and Computer Engineering, University of California) ;
  • Moser, Louise E. (Department of Electrical and Computer Engineering, University of California) ;
  • Lombera, Isai Michel (Department of Electrical and Computer Engineering, University of California)
  • Received : 2012.05.31
  • Accepted : 2012.08.16
  • Published : 2012.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper presents novel statistical algorithms for protecting the iTrust information retrieval network against malicious attacks. In iTrust, metadata describing documents, and requests containing keywords, are randomly distributed to multiple participating nodes. The nodes that receive the requests try to match the keywords in the requests with the metadata they hold. If a node finds a match, the matching node returns the URL of the associated information to the requesting node. The requesting node then uses the URL to retrieve the information from the source node. The novel detection algorithm determines empirically the probabilities of the specific number of matches based on the number of responses that the requesting node receives. It also calculates the analytical probabilities of the specific numbers of matches. It compares the observed and the analytical probabilities to estimate the proportion of subverted or non-operational nodes in the iTrust network using a window-based method and the chi-squared statistic. If the detection algorithm determines that some of the nodes in the iTrust network are subverted or non-operational, then the novel defensive adaptation algorithm increases the number of nodes to which the requests are distributed to maintain the same probability of a match when some of the nodes are subverted or non-operational as compared to when all of the nodes are operational. Experimental results substantiate the effectiveness of the detection and defensive adaptation algorithms for protecting the iTrust information retrieval network against malicious attacks.

Keywords

References

  1. Y. T. Chuang, I. Michel Lombera, L. E. Moser, and P. M. Melliar-Smith, "Trustworthy distributed search and retrieval over the Internet," Proceedings of the International Conference on Internet Computing, Las Vegas, NV, 2011, pp. 169- 175.
  2. I. Michel Lombera, Y. T. Chuang, P. M. Melliar-Smith, and L. E. Moser, "Trustworthy distribution and retrieval of information over HTTP and the Internet," Proceedings of the 3rd International Conference on Evolving Internet, Luxembourg City, Luxembourg, 2011, pp. 7-13.
  3. P. M. Melliar-Smith, L. E. Moser, I. Michel Lombera, and Y. T. Chuang, "iTrust: trustworthy information publication, search and retrieval," Proceedings of the 13th International Conference on Distributed Computing and Networking, Hong Kong, China, 2012, pp. 351-366.
  4. W. Feller, An Introduction to Probability Theory and Its Applications, New York: Wiley, 1968.
  5. P. E. Greenwood and M. S. Nikulin, A Guide to Chi-Squared Testing, New York: Wiley, 1996.
  6. J. Mischke and B. Stiller, "A methodology for the design of distributed search in P2P middleware," IEEE Network, vol. 18, no. 1, pp. 30-37, 2004.
  7. Gnutella, http://en.wikipedia.org/wiki/Gnutella.
  8. R. A. Ferreira, M. K. Ramanathan, A. Awan, A. Grama, and S. Jagannathan, "Search with probabilistic guarantees in unstructured peer-to-peer networks," Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing, Konstanz, Germany, 2005, pp. 165-172.
  9. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, "Making Gnutella-like P2P systems scalable," Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Karlsruhe, Germany, 2003, pp. 407-418.
  10. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong, "Freenet: a distributed anonymous information storage and retrieval system," Proceedings of the International Workshop on Designing Privacy Enhancing Technologies, Berkeley, CA, 2001, pp. 46-66.
  11. D. Tsoumakos and N. Roussopoulos, "Adaptive probabilistic search for peer-to-peer networks," Proceedings of the 3rd International Conference on Peer-to-Peer Computing, Linkoping, Sweden, 2003, pp. 102-109.
  12. E. Cohen and S. Shenker, "Replication strategies in unstructured peer-to-peer networks," Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Pittsburgh, PA, 2002, pp. 177-190.
  13. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, "Search and replication in unstructured peer-to-peer networks," Proceedings of the 16th International Conference on Supercomputing, New York, NY, 2002, pp. 84-95.
  14. W. W. Terpstra, J. Kangasharju, C. Leng, and A. P. Buchmann, "Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search," Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computing Communications, Kyoto, Japan, 2007, pp. 49-60.
  15. C. Leng, W. W. Terpstra, B. Kemme, W. Stannat, and A. P. Buchmann, "Maintaining replicas in unstructured P2P systems," Proceedings of the ACM Conference on Emerging Network Experiments and Technology, Madrid, Spain, 2008.
  16. F. M. Cuenca-Acuna, C. Peery, R. P. Martin, and T. D. Nguyen, "PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities," Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing, Seattle, WA, 2003, pp. 236-246.
  17. Y. Wang, L. Galanis, and D. J. DeWitt, "GALANX: an efficient peer-to-peer search engine system," University of Wisconsin, Madison, WI, 2003.
  18. R. Morselli, B. Bhattacharjee, A. Srinivasan, and M. A. Marsh, "Efficient lookup on unstructured topologies," Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing, Las Vegas, NV, 2005, pp. 77-86.
  19. N. Sarshar, P. O. Boykin, and V. P. Roychowdhury, "Percolation search in power law networks: making unstructured peer-to-peer networks scalable," Proceedings of the 4th International Conference on Peer-to-Peer Computing, Zurich, Switzerland, 2004, pp. 2-9.
  20. G. P. Jesi, D. Hales, and M. van Steen, "Identifying malicious peers before it's too late: a decentralized secure peer sampling service," Proceedings of the 1st International Conference on Self-Adaptive and Self-Organizing Systems, Boston, MA, 2007, pp. 237-246.
  21. T. Condie, S. D. Kamvar, and H. Garcia-Molina, "Adaptive peer-to-peer topologies," Proceedings of the 4th International Conference on Peer-to-Peer Computing, Zurich, Switzerland, 2004, pp. 53-62.
  22. R. Goonatilake, A. Herath, S. Herath, S. Herath, and J. Herath, "Intrusion detection using the chi-square goodness-of-fit test for information assurance, network, forensics and software security," Journal of Computing Science in Colleges, vol. 23, no. 1, pp. 255-263, 2007.
  23. Y. T. Chuang, I. Michel Lombera, P. M. Melliar-Smith, and L. E. Moser, "Detecting and defending against malicious attacks in the iTrust information retrieval network," Proceedings of the International Conference on Information Networking, Bali, Indonesia, 2012, pp. 263-268.

Cited by

  1. An adaptable and scalable membership management for the iTrust information search and retrieval system vol.8, pp.18, 2015, https://doi.org/10.1002/sec.1273
  2. Maintaining censorship resistance in the iTrust network for publication, search and retrieval vol.9, pp.2, 2016, https://doi.org/10.1007/s12083-015-0327-1
  3. Statistical Estimation and Dynamic Adaptation Algorithms for the iTrust Publication, Search and Retrieval System vol.59, pp.10, 2016, https://doi.org/10.1093/comjnl/bxw038