000000519 001__ 519
000000519 005__ 20180318102519.0
000000519 037__ $$aCONF
000000519 245__ $$aA Robust Reputation System for Peer-to-Peer and Mobile Ad-hoc Networks
000000519 269__ $$a2004
000000519 260__ $$c2004
000000519 336__ $$aConference Papers
000000519 520__ $$aReputation systems  can be tricked by the spread of false reputation ratings, be it false accusations or false praise. Simple solutions such as exclusively relying on one`s own direct observations have drawbacks, as they do not make use of all the information available.  We propose a fully distributed reputation system that can cope with false disseminated information. In our approach, everyone maintains a reputation rating and a trust rating about everyone else that they care about.  From time to time first-hand reputation information is exchanged with others
000000519 6531_ $$aWLN
000000519 6531_ $$apeer-to-peer
000000519 6531_ $$aLCA2-Reputation
000000519 6531_ $$aNCCR-MICS
000000519 6531_ $$aNCCR-MICS/CL2
000000519 700__ $$0244029$$aBuchegger, Sonja$$g130080
000000519 700__ $$0241098$$aLe Boudec, Jean-Yves$$g105633
000000519 7112_ $$aP2PEcon 2004$$cHarvard University, Cambridge MA, U.S.A.
000000519 773__ $$tP2PEcon 2004
000000519 8564_ $$s89648$$uhttps://infoscience.epfl.ch/record/519/files/bucheggerL04A.pdf$$zn/a
000000519 909CO $$ooai:infoscience.tind.io:519$$pconf$$pIC
000000519 909C0 $$0252614$$pLCA$$xUS00024
000000519 909C0 $$0252453$$pLCA2$$xU10427
000000519 937__ $$aLCA-CONF-2004-009
000000519 970__ $$a699/LCA
000000519 973__ $$aEPFL$$sPUBLISHED
000000519 980__ $$aCONF