A Novel Approach to Evaluate Trustworthiness and Uncertainty of Trust Relationships in Peer-to-Peer Computing

Author(s):  
Rui He ◽  
Jianwei Niu ◽  
Kai Hu
2011 ◽  
Vol 2 (2) ◽  
pp. 77 ◽  
Author(s):  
Hailong Sun ◽  
Jinpeng Huai ◽  
Xudong Liu ◽  
Jing Li
Keyword(s):  

2014 ◽  
Vol 14 (1) ◽  
pp. 5394-5397
Author(s):  
Sourabh S. Mahajan ◽  
S.K. Pathan

Peer-to-Peer systems enables the interactions of peers to accomplish tasks. Attacks of peers with malicious can be reduced by establishing trust relationship among peers. In this paper we presents algorithms which helps a peer to reason about trustworthiness of other peers based on interactions in the past and recommendations. Local information is used to create trust network of peers and does not need to deal with global information. Trustworthiness of peers in providing services can be describedby Service metric and recommendation metric. Parameters considered for evaluating interactions and recommendations are Recentness, Importance and Peer Satisfaction. Trust relationships helps a good peer to isolate malicious peers.


2018 ◽  
Vol 9 (1) ◽  
pp. 19-42 ◽  
Author(s):  
Mohammad Yamin ◽  
Adnan Ahmed Abi Sen

Location Based Services (LBS) expose user data to malicious attacks. Approaches, evolved, so far, for preserving privacy and security, suffer from one or more anomalies, and hence the problem of securing LBS data is far from being resolved. In particular, accuracy of results vs. privacy degree, privacy vs. performance, and trust between users are open problems. In this article, we present a novel approach by integration of peer-to-peer (P2P) with the caching technique and dummies from real queries. Our approach increases efficiency, leads to improved performance, and provides solutions to many problems that have existed in the past. In addition, we offer an improved way of managing cache. Simulation demonstrates superiority of our approach over earlier ones dealing with both the ratio of privacy and that of performance.


2013 ◽  
Vol 38 (2) ◽  
pp. 111-122
Author(s):  
Aurel Paulovič ◽  
Peter Lacko

AbstractTransactional memory is a rather novel approach to concurrency control in parallel computing, that has just recently found its way into distributed systems research. However, the research concentrates mainly on single processor solutions or cluster environment. In this paper we argue, that peer-to-peer systems would require a different design of transactional memory because of the increased failure-rate of nodes, slower network and possibility of network splits. We also present a few of our design ideas, namely increased performance and fault tolerance through the use of higher-level conflict detection and resolution via abstract data types and eventually consistency, that as we think could be important to a successful implementation of a scalable and resilient transactional memory.


2012 ◽  
Vol 52 (9) ◽  
pp. 24-29 ◽  
Author(s):  
A. K.Singh ◽  
Shubham Maheshwari ◽  
Shekhar Verma

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1442
Author(s):  
Amal Alqahtani ◽  
Heba Kurdi ◽  
Majed Abdulghani

Peer-to-peer (P2P) platforms are gaining increasing popularity due to their scalability, robustness and self-organization. In P2P systems, peers interact directly with each other to share resources or exchange services without a central authority to manage the interaction. However, these features expose P2P platforms to malicious attacks that reduce the level of trust between peers and in extreme situations, may cause the entire system to shut down. Therefore, it is essential to employ a trust management system that establishes trust relationships among peers. Current P2P trust management systems use binary categorization to classify peers as trustworthy or not trustworthy. However, in the real world, trustworthiness is a vague concept; peers have different levels of trustworthiness that affect their overall trust value. Therefore, in this paper, we developed a novel trust management algorithm for P2P platforms based on Hadith science where Hadiths are systematically classified into multiple levels of trustworthiness, based on the quality of narrator and content. To benchmark our proposed system, HadithTrust, we used two state-of-art trust management systems, EigenTrust and InterTrust, with no-trust algorithm as a baseline scenario. Various experimental results demonstrated the superiority of HadithTrust considering eight performance measures.


Sign in / Sign up

Export Citation Format

Share Document