Managing trust in a peer-2-peer information system

Aberer, Karl; Despotovic, Zoran

doi:10.1145/502585.502638

Cited by 669 publications

(254 citation statements)

References 7 publications

Supporting

Mentioning

250

Contrasting

Unclassified

Order By: Relevance

“…A considerable amount of research has been conducted into this issue and a number of solutions have been proposed in the literature (Xiong and Liu, 2003;Aberer and Despotovic, 2001). Xiong and Liu (2003) have proposed a dynamic trust model for P2P e-commerce communities using a transaction-based feedback system where a trader's trustworthiness is measured based on five factors namely satisfaction, number of transactions, credibility of feedback, transaction context and community context.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A fully distributed reputation system for m-commerce via ad hoc wireless networking

Osman

Abdullah

Ahamad

2017

Int. j. adv. appl. sci

View full text Add to dashboard Cite

Trust development among traders in an ad hoc m-commerce trading system is vital to mitigate uncertainty and risks involved in transactions. It helps traders decide whether to trade with potential trading partners as well as to gauge the degree of confidence that they should give these parties. One way to facilitate such trust is through use of a reputation system. However, the potential for ill-intentioned traders to subvert the reputation system makes the task challenging. This paper discusses key issues in designing a reputation system that can effectively facilitate trust development in such a loose and dynamic trading community. It proposes a fully distributed approach that employs a sanction-backed mechanism to encourage traders to be truthful in providing reputation reports. It advocates letting traders maintain their own reputation information as well as share knowledge about other traders' trading behavior in a peer-to-peer (P2P) manner without relying on network services that are always available. A security analysis on the proposed design shows that it can help traders detect or mitigate the identified misbehavior-related threats to a sufficient degree.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Another approach by Aberer and Despotovic (2001) is based on a binary valued concept of trust, where an agent can only be trustworthy or not. In their approach, only information on dishonest transactions is used to evaluate the trustworthiness of each agent.…”

Section: Related Workmentioning

confidence: 99%

A fully distributed reputation system for m-commerce via ad hoc wireless networking

Osman

Abdullah

Ahamad

2017

Int. j. adv. appl. sci

View full text Add to dashboard Cite

show abstract

“…There is some recent research on reputation and trust management in distributed systems. Aberer and Despotovic [18] are one of the first in proposing a reputation based management system. However, their trust metric simply summarizes the complaints a peer receives and is very sensitive to the skewed distribution of the community and misbehaving peers.…”

Section: Related Workmentioning

confidence: 99%

“…Reputation systems [18] provide a way for building trust by utilizing community based feedback about past experiences of nodes to help making recommendation and judgment on quality and reliability of the transactions and messages exchanged between communicating nodes. The challenge of building such a reputation based trust mechanism in distributed system is "How to effectively cope with various malicious behaviours of peers such as providing fake or misleading feedback about other peers?"…”

Section: Proposed Security Mechanisms Based On Node Behaviourmentioning

confidence: 99%

A dynamic file replication based on CPU load and consistency mechanism in a trusted distributed environment

Vardhan

Kushwaha

2017

Teh. vjesn.

View full text Add to dashboard Cite

Original scientific paper An effort has been made to propose a CPU load based dynamic, cooperative, trust based, and secure file replication approach based along with consistency among file replicas for distributed environment. Simulation results consisting of 100 requesting nodes, three file servers and file size ranging from 677 KB to 11 MB establishes that, when the CPU load is taken into consideration, the average decrease in file request completion time is about 22,04 ÷ 24,81 % thus optimizing the CPU load and minimizing the file request completion time. The CPU load decreases by 4,25 ÷ 5,58 %. Results show that, the average write latency with proposed mechanism decreases by 6,12 % as compared to Spinnaker writes and the average read latency is 3 times better than Cassandra Quorum Read (CQR). The proposed partial update propagation for maintaining file consistency stands to gain up to 69,67 % in terms of time required to update stale replicas. Thus the integrity of files and behaviour of the requesting nodes and file servers is guaranteed within even lesser time. Finally, a relationship between the formal aspects of simple security model and secure reliable CPU load based file replication model is established through process algebra. Keywords Dinamička replikacija datoteke zasnovana na mehanizmu opterećenosti i konzistencije CPU u pouzdanom distribuiranom okruženjuIzvorni znanstveni članak Pokušalo se predložiti dinamički, kooperativni, pouzdani i sigurni pristup replikaciji datoteke utemeljen na opterećenosti CPU uz konzistenciju među replikama datoteke za distribuirano okruženje. Rezultati simulacije koja se sastoji od 100 potrebnih čvorova, tri servera datoteke i datoteke veličine od 677 KB to 11 MB pokazuju da kada se uzme u obzir opterećenje CPU, prosječno smanjenje vremena potrebnog za popunjavanje datoteke je oko 22,04 ÷ 24,81 %. Tako se optimiziralo opterećenje CPU i smanjilo traženo vrijeme popunjavanja datoteke. Opterećenje CPU smanjuje se za 4,25 ÷ 5,58 %. Rezultati pokazuju da se prosječno kašnjenje upisa (write latency) s predloženim mehanizmom smanjuje za 6,12 % u usporedbi sa Spinnakerovim, a prosječno vrijeme čekanja čitanja (read latency) je 3 puta bolje od Cassandra Quorum Read (CQR). Predložena parcijalna propagacija ažuriranja za održavanje konzistencije datoteke povećava se do 69,67 % u odnosu na vrijeme potrebno za ažuriranje zastarjelih replika. Tako je integritet datoteka i ponašanje zahtijevanih čvorova i servera datoteke zagarantirano za čak manje vremena. Konačno, kroz algebra postupak uspostavljen je odnos između formalnih aspekata jednostavnog modela sigurnosti i sigurnog pouzdanog modela replikacije datoteke zasnovanog na sigurnom pouzdanom opterećenju datoteke.

show abstract

“…At present, among researches on reputation system, most focus on building distributed reputation systems rather than worrying about privacy [3,4]. In [5÷7], the works only address the conflict issue of anonymity in reputation system.…”

Section: Related Workmentioning

confidence: 99%

Making reputation system traceable without losing privacy

Zhang

Yang

2016

Teh. vjesn.

View full text Add to dashboard Cite

Preliminary noteIn existing reputation system nodes usually adopt regular pseudonyms instead of true identities to gain the anonymity. However complete anonymity will cause watershed and Sybil attack, which look on system be out of control and break the fairness of the reputation system. This paper introduces the conditional anonymity mechanism to check the evaluation between anonymity nodes, evaluation between two nodes if not more than the several times, but not be evaluated between two pseudonyms belong to the same peer. It will be effective, otherwise, the node true identity will be exposed, if number of attacks of the peer within the time exceeds d times, nodes in the evaluation and transaction will be tracked. Analysis shows that this mechanism cannot only protect the identity of peer's anonymity, but identify and track malicious attackers.Keywords: conditional anonymity; privacy; pseudonym; reputation system; traceable Izrada sljedivog sustava ugleda bez gubitka privatnostPrethodno propćenje U postojećim čvorovima sustava ugleda obično se prihvaćaju redoviti pseudonimi umjesto pravog identiteta radi postizanja anonimnosti. Međutim, potpuna anonimnost će uzrokovati prekretnicu i Sybil napad, koji bi sustav ugleda stavio izvan kontrole i razbio pravičnost sustava ugleda. Ovaj rad predstavlja uvjetni mehanizam anonimnosti za provjeru vrednovanja između anonimnosti čvorova, vrednovanja između dva čvora ako se ne ponavlja nekoliko puta, ne može se vrednovati između dva pseudonima koji pripadaju istoj razini. On će biti učinkovit, ako će pravi identitet čvora biti izložen, ako je broj napada iste razine unutar vremena koje prelazi d vremena, čvorovi u procjeni i transakciji će biti praćeni. Analiza pokazuje da ovaj mehanizam ne samo da može zaštititi identitet istorazinske anonimnosti, već će identificirati i pratiti zlonamjerne napadače.

show abstract

Managing trust in a peer-2-peer information system

Cited by 669 publications

References 7 publications

A fully distributed reputation system for m-commerce via ad hoc wireless networking

A fully distributed reputation system for m-commerce via ad hoc wireless networking

A dynamic file replication based on CPU load and consistency mechanism in a trusted distributed environment

Making reputation system traceable without losing privacy

Contact Info

Product

Resources

About