Trust But Verify : A Framework for the Trustworthiness of Distributed Systems
Keywords:
Distributed Systems, Trust Management, Reputation, Security, CryptographyAbstract
Distributed networking technologies have gained popularity as a mechanism for users to share files without the need for centralized servers. A Distributed network provides a scalable and fault-tolerant mechanism to locate nodes anywhere on a network without maintaining a large amount of routing nodes. This can allows for a variety of applications beyond simple sharing of file. This includes multicast systems, and communication systems, and caches of web. We survey security issues that occur in the underlying Distributed routing protocols, along with fairness and trust that occur in file sharing and other Distributed systems. Here we discuss how techniques, ranging from cryptography techniques, to randomize network guessing, can be used to address these problems. Open nature of Distributed systems exposes them to malicious activity. Defining trusty relationships among peers can mitigate attacks of malicious peers. This paper presents distributed algorithms that enable a peer to reason about trustworthiness of other peers based on past interactions. System peers create their own trust network in their proximity by using local information available and do not try to learn global trust information. Two contexts of trust context, service context, and recommendation, these are defined to measure trustworthiness in providing services and giving recommendations. These recommendations are derived based on priority, history, and peer satisfaction. Moreover, nodes trustworthiness and confidence about a recommendation are considered while evaluating recommendations. Effective experiments on a file sharing application show that the proposed model can mitigate attacks on 16 different malicious behavior nodes.
References
- K. Aberer and Z. Despotovic, “Managing Trust in a Peer-2-Peer Information System,” Proc. 10th Int'l Conf. Information and Knowledge Management (CIKM), 2001.R. Caves, Multinational Enterprise and Economic Analysis, Cambridge University Press, Cambridge, 1982. (book style)
- F. Cornelli, E. Damiani, S.D.C. di Vimercati, S.Paraboschi, and P. Samarati, Choosing Reputable Servents in a DISTRIBUTED Network,” Proc. 11thWorld Wide Web conf. (WWW), 2002.
- S. Kamvar, M. Schlosser, and H. Garcia-Molina, “The (Eigentrust) Algorithm for Reputation Management in DISTRIBUTED Networks,” Proc. 12th World Wide Web Conf. (WWW), 2003.
- L. Xiong and L. Liu, “Peertrust: Supporting Reputation-Based Trust for Distributed Ecommerce Communities,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 7, pp. 843-857, July 004
- B. Yu and M. Singh, “A Social Mechanism of Reputation management in Electronic Communities,” Proc. Cooperative Information Agents (CIA), 2000
- Z. Despotovic and K. Aberer, “Trust-Aware Delivery of mposite Goods,” Proc. First Int'l Conf. Agents and Distributed Computing, 2002
- F. Cornelli, E. Damiani, S.C. Vimercati, S. Paraboschi, and P. Samarati, A reputation-based approach for choosing reliable resources in Distributed networks ,In CCS02, Washington DC, USA 2002.
- K. Aberer, A. Datta, and M. Hauswirth, “P-Grid: Dynamics of Self- Organization Processes in Structured DISTRIBUTED Systems,” Distributed Systems and Applications, vol. 3845, 2005.
- R. Zhou and K. Hwang, “Powertrust: A Robust and Scalable Reputation System for Trusted Distributed Computing,” IEEE Trans. Parallel and distributed Systems, vol. 18, no. 4, pp. 460-473, Apr. 2007.
- M. Gupta, P. Judge, and M. Ammar, “A Reputation System for Distributed Networks,” Proc. 13th Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), 2003.
- S. Staab, B. Bhargava, L. Lilien, A. Rosenthal, M.Winslett, M. Sloman, T. Dillon, E. Chang, F.K.Hussain, W. Nejdl, D. Olmedilla, and V. Kashyap,“The Pudding of Trust,” IEEE Intelligent Systems, vol.19, no. 5, pp. 74-88, 2004.
- M. Virendra, M. Jadliwala, M. Chandrasekaran, and S.Upadhyaya, “Quantifying Trust in Mobile Ad-Hoc Networks,” Proc. IEEE Int'l Conf. Integration of Knowledge Intensive Multi-Agent Systems (KIMAS),2005
- E.J. Friedman and P. Resnick, “The Social Cost of Cheap Pseudonyms,” J. Economics and Management Strategy, vol. 10, no. 2, pp. 173-199, 2001.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT

This work is licensed under a Creative Commons Attribution 4.0 International License.