Dynamics of Reputation

To enforce security without user enrollment, trust (or reputation) systems were proposed to use experience as crucial information to support cooperation as well as for security enforcement mechanisms. However, use of trust introduces very difficult problems that still discourage from exploitation of trust for security mechanisms. The ability to change trust quickly and react effectively to changes in environment and user behaviour is profound for usability of mechanisms built on top of trust. Dempster-Shafer theory was proposed as a suitable theoretical model for trust computation. Here, we define general requirements for reputation dynamics and demonstrate that DempsterShafer theory properties are not as good as is widely thought. On the contrary, simple formulae work.

[1]  Joseph Y. Halpern,et al.  A Logic for Reasoning about Evidence , 2002, UAI.

[2]  S Hailes,et al.  Using Recommendations for Managing Trust in Distributed Systems , 1997 .

[3]  Audun Jøsang,et al.  The consensus operator for combining beliefs , 2002, Artif. Intell..

[4]  Stephen Hailes,et al.  Supporting trust in virtual communities , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[5]  P. Vannoorenberghe,et al.  Strategies for combining conflicting dogmatic beliefs , 2003, Sixth International Conference of Information Fusion, 2003. Proceedings of the.

[6]  Jean Bacon,et al.  Access control and trust in the use of widely distributed services , 2001, Softw. Pract. Exp..

[7]  Nick Mathewson,et al.  Reputation in privacy enhancing technologies , 2002, CFP '02.

[8]  Ronald N. Bracewell,et al.  The Fourier Transform and Its Applications , 1966 .

[9]  Václav Matyás,et al.  Pseudonymity in the Light of Evidence-Based Trust , 2004, Security Protocols Workshop.

[10]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[11]  Roger Dingledine,et al.  On the Economics of Anonymity , 2003, Financial Cryptography.

[12]  A. Jøsang Subjective Evidential Reasoning � , 2002 .