Name
Abstract | ||
|---|---|---|
In a fully distributed peer-to-peer (P2P) overlay network, peer processes (peers) cannot perceive where every object exists due to the scalability and openness. A peer has to obtain service through communicating with acquaintance peers. Here, acquaintance peers may hold obsolete information and may be even malicious. Hence, it is critical for a peer to identify which acquaintance is more trustworthy. In this paper, the trustworthiness of an acquaintance is defined in terms of the satisfiability and ranking factor. We define how satisfiable a requesting peer is for each type of access requests by newly taking into account the authorization. The ranking factor of an acquaintance shows how much the acquaintance is trusted by trustworthy acquaintances. The trustworthiness of each acquaintance is propagated in a peer-by-peer way. We evaluate how the ranking factors of acquaintance is changing through interactions among peers. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/DEXA.2007.142 | DEXA Workshops |
Keywords | Field | DocType |
access request,access control models,overlay network,obsolete information,trustworthy acquaintance,ranking factor,acquaintance peer,authorization,satisfiability,authorisation,p2p | World Wide Web,Internet privacy,Ranking,Trustworthiness,Computer science,Authorization,Openness to experience,Access control,An acquaintance,Overlay network,Scalability | Conference |
ISBN | Citations | PageRank |
0-7695-2932-1 | 0 | 0.34 |
References | Authors | |
14 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoshio Nakajima | 1 | 8 | 2.10 |
| Kenichi Watanabe | 2 | 160 | 15.86 |
| Alireza Goudarzi Nemati | 3 | 18 | 4.13 |
| Tomoya Enokido | 4 | 1990 | 240.21 |
| Makoto Takizawa | 5 | 3180 | 440.50 |