Cheat-proof playout for centralized and distributed online games Export

@proceedings{baughman:cheating, abstract = {We explore exploits possible for cheating in real-time, multiplayer games for both client-server and distributed, serverless architectures. We offer the first formalization of cheating in online games and propose an initial set of strong solutions. We propose a protocol that has provable anti-cheating guarantees, but suffers a performance penalty. We then develop an extended version of this protocol, called asynchronous synchronization, which avoids the penalty, is serverless, offers provable anti-cheating guarantees, is robust in the face of packet loss, and provides for significantly increased communication performance. This technique is applicable to common game features as well as clustering and cell-based techniques for massively multiplayer games. Our performance claims are backed by analysis using a simulation based on real game traces}, author = {Baughman, N. E. and Levine, B. N.}, booktitle = {INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE}, citeulike-article-id = {4304328}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/INFCOM.2001.916692}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=916692}, doi = {10.1109/INFCOM.2001.916692}, journal = {INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE}, keywords = {cheating, mmo, mmorpg, security}, pages = {104--113 vol.1}, posted-at = {2009-10-26 19:22:04}, priority = {2}, title = {Cheat-proof playout for centralized and distributed online games}, url = {http://dx.doi.org/10.1109/INFCOM.2001.916692}, volume = {1}, year = {2001} }

TY - CONF ID - baughman:cheating L3 - citeulike-article-id:4304328 N2 - We explore exploits possible for cheating in real-time, multiplayer games for both client-server and distributed, serverless architectures. We offer the first formalization of cheating in online games and propose an initial set of strong solutions. We propose a protocol that has provable anti-cheating guarantees, but suffers a performance penalty. We then develop an extended version of this protocol, called asynchronous synchronization, which avoids the penalty, is serverless, offers provable anti-cheating guarantees, is robust in the face of packet loss, and provides for significantly increased communication performance. This technique is applicable to common game features as well as clustering and cell-based techniques for massively multiplayer games. Our performance claims are backed by analysis using a simulation based on real game traces JF - INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE EP - 113 vol.1 TI - Cheat-proof playout for centralized and distributed online games VL - 1 T2 - INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE SP - 104 KW - cheating KW - mmo KW - mmorpg KW - security AU - Baughman, NE AU - Levine, BN PY - 2001/// UR - http://dx.doi.org/10.1109/INFCOM.2001.916692 ER -