ACM Home Page
Please provide us with feedback. Feedback
AC/DC: an algorithm for cheating detection by cheating
Full text PdfPdf (175 KB)
Source International Workshop on Network and Operating System Support for Digital Audio and Video archive
Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video table of contents
Newport, Rhode Island
SESSION: Security and OS table of contents
Article No. 23  
Year of Publication: 2006
ISBN:1-59593-285-2
Authors
Stefano Ferretti  University of Bologna, Bologna, Italy
Marco Roccetti  University of Bologna, Bologna, Italy
Sponsor
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 49,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1378191.1378220
What is a DOI?

ABSTRACT

Time cheats represent some of the most crucial issues in online gaming. Since they act on timing properties of generated game events, these malicious schemes are particularly difficult to thwart when distributed games are deployed over peer-to-peer architectures. Indeed, the absence of a global clock shared among peers enables cheaters to see into the future by waiting for events generated by other peers before generating its own ones (lookahead cheat). This may give an unfair advantage to the cheater. We consider a version of lookahead cheat generalized in the context of real-time (i.e., not round-based) games. To face this time cheat, we present AC/DC, an Algorithm for Cheating Detection by Cheating. This algorithm enables to detect cheaters based on monitoring of network latencies. The basic idea is that of conducting against each suspected peer a sort of cheating counterattack, by delaying events before notifying them to the (hypothetic) cheater. This permits to detect whether that peer waits for these events before generating its own ones. Our claim is that an approach based on the monitoring of communication patterns among peers allows cheat detection without affecting the performances of the game.


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
N. E. Baughman, B. N. Levine, "Cheat-proof Playout for Centralized and Distributed Online Games", in Proc. of INFOCOM 2001, Anchorage (USA), IEEE, April 2001, 104--113.
 
2
M. S. Borella, "Source models for network game traffic", in Computer Communications, 23(4):403--410, February 2000.
 
3
4
 
5
 
6
E. Cronin, B. Filstrup, S. Jamin. "Cheat-proofing dead reckoned multiplayer games", In Proc. of 2nd International Conference on Application and Development of Computer Games, January 2003.
 
7
 
8
F. Cristian, "Probabilistic clock synchronization", Distributed Computing, 3(3):146--158, 1989.
9
10
11
 
12
13
 
14
15
 
16
H. Lee, E. Kozlowski, S. Lenker, S. Jamin, "Synchronization and Cheat-Proofing Protocol for Real-Time Multiplayer Games", in Proc. of the International Workshop on Entertainment Computing, Makuari (Japan), May 2002.
 
17
D. L. Mills, "Internet time synchronization: the Network Time Protocol", in IEEE Transactions on Communications, 39(10):1482--1493, October 1991.
 
18
M. Pritchard, "How to hurt the hackers: the scoop on Internet Cheating and How You Can Combat It", in Gamasutra Web Site, July 2000, http://www.gamasutra.com/.
 
19
J. Yan, H. J. Choi, "Security Issues in Online Games", in The Electronic Library: International Journal for the application of technology in information environments, Emerald, Vol. 20 No.2, 2002.
20


Collaborative Colleagues:
Stefano Ferretti: colleagues
Marco Roccetti: colleagues