ACM Home Page
Please provide us with feedback. Feedback
Smart cheaters do prosper: defeating trust and reputation systems
Full text PdfPdf (413 KB)
Source
International Conference on Autonomous Agents archive
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 table of contents
Budapest, Hungary
SESSION: Reputation and trust table of contents
Pages 993-1000  
Year of Publication: 2009
ISBN:978-0-9817381-7-8
Authors
Reid Kerr  University of Waterloo, Waterloo, Ontario, Canada
Robin Cohen  University of Waterloo, Waterloo, Ontario, Canada
Sponsors
: The Foundation for Intelligent Physical Agents
Microsoft Research : Microsoft Research
: Whitestein Technologies
: European Office of Aerospace Research and Development, Air Force Office of Scientific Research, United States Air Force Research Laboratory
: Drexel University
: Wiley -- Blackwell Ltd
Publisher
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 51,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Traders in electronic marketplaces may behave dishonestly, cheating other agents. A multitude of trust and reputation systems have been proposed to try to cope with the problem of cheating. These systems are often evaluated by measuring their performance against simple agents that cheat randomly. Unfortunately, these systems are not often evaluated from the perspective of security---can a motivated attacker defeat the protection? Previously, it was argued that existing systems may suffer from vulnerabilities that permit effective, profitable cheating despite the use of the system. In this work, we experimentally substantiate the presence of these vulnerabilities by successfully implementing and testing a number of such 'attacks', which consist only of sequences of sales (honest and dishonest) that can be executed in the system. This investigation also reveals two new, previously-unnoted cheating techniques. Our success in executing these attacks compellingly makes a key point: security must be a central design goal for developers of trust and reputation systems.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Bowling, B. Browning, and M. Veloso. Plays as effective multiagent plans enabling opponent-adaptive play selection. In Proceedings of International Conference on Automated Planning and Scheduling (ICAPS'04), 2004.
2
 
3
A. Jøsang and R. Ismail. The Beta Reputation System. In Proceedings of the 15th Bled Electronic Commerce Conference e-Reality: Constructing the e-Economy, 2002.
4
5
 
6
R. Ros, M. Veloso, R. L. de Màntaras, C. Sierra, and J. L. Arcos. Retrieving and reusing game plays for robot soccer. In 8th European Conference on Case-Based Reasoning (ECCBR-06), Fethiye, Turkey, 2006, 2006.
 
7
 
8
 
9
A. Whitby, A. Josang, and J. Indulska. Filtering out unfair ratings in bayesian reputation systems. In Proceedings of the 7th Int Workshop on Trust in Agent Societies, 2004.
 
10
B. Yu and M. P. Singh. Distributed reputation management for electronic commerce. Computational Intelligence, 18(4):535--549, 2002.