Cheat-Proof Playout for Centralized and Peer-to-Peer Gaming
We explore exploits possible for cheating in real-time, multiplayer games for both client-server and 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...
Gespeichert in:
| Veröffentlicht in: | IEEE/ACM transactions on networking 2007-02, Vol.15 (1), p.1-13 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 13 |
|---|---|
| container_issue | 1 |
| container_start_page | 1 |
| container_title | IEEE/ACM transactions on networking |
| container_volume | 15 |
| creator | Baughman, N.E. Liberatore, M. Levine, B.N. |
| description | We explore exploits possible for cheating in real-time, multiplayer games for both client-server and 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, is provably safe and live, 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 presence 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. Specifically, we provide a zero-knowledge proof protocol so that players are within a specific range of each other, and otherwise have no notion of their distance. Our performance claims are backed by analysis using a simulation based on real game traces |
| doi_str_mv | 10.1109/TNET.2006.886289 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_4100707</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4100707</ieee_id><sourcerecordid>2338408111</sourcerecordid><originalsourceid>FETCH-LOGICAL-c420t-c3ee12ee02b857a8c6e4e924dd3f599238c809648e3a78dbb25b29dd0d40513e3</originalsourceid><addsrcrecordid>eNp9kD1PwzAURS0EEqWwI7FEDIgl5fkjji0mFJWCVEGHMltO8gKp0rjYyVB-PYmKGBiY7hvOvdI7hFxSmFEK-m79Ml_PGICcKSWZ0kdkQpNExSyR8ni4QfJYSs1OyVkIGwDKgckJuc8-0HbxyjtXRavG7l3fRZXzUYZt521Tf2EZ2baMVog-7lw8ZrSw27p9PycnlW0CXvzklLw9ztfZU7x8XTxnD8u4EAy6uOCIlCECy1WSWlVIFKiZKEteJVozrgoFWgqF3KaqzHOW5EyXJZQCEsqRT8nNYXfn3WePoTPbOhTYNLZF1wfDhZCaJmIAb_8FqUwpF5wOz0_J9R9043rfDm8YJcWwphUbIDhAhXcheKzMztdb6_eGghmtm9G6Ga2bg_WhcnWo1Ij4iwsKkELKvwGhh3ty</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>864915982</pqid></control><display><type>article</type><title>Cheat-Proof Playout for Centralized and Peer-to-Peer Gaming</title><source>IEEE Electronic Library (IEL)</source><creator>Baughman, N.E. ; Liberatore, M. ; Levine, B.N.</creator><creatorcontrib>Baughman, N.E. ; Liberatore, M. ; Levine, B.N.</creatorcontrib><description>We explore exploits possible for cheating in real-time, multiplayer games for both client-server and 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, is provably safe and live, 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 presence 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. Specifically, we provide a zero-knowledge proof protocol so that players are within a specific range of each other, and otherwise have no notion of their distance. Our performance claims are backed by analysis using a simulation based on real game traces</description><identifier>ISSN: 1063-6692</identifier><identifier>EISSN: 1558-2566</identifier><identifier>DOI: 10.1109/TNET.2006.886289</identifier><identifier>CODEN: IEANEP</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Analytical models ; Cheating ; Dead reckoning ; Games ; Gaming ; Multimedia communication ; On-line systems ; Online ; Peer to peer computing ; peer-to-peer networking ; Performance analysis ; Performance loss ; Players ; Protocols ; Real time ; Robustness ; Scalability ; security ; Simulation ; Synchronism ; Synchronization</subject><ispartof>IEEE/ACM transactions on networking, 2007-02, Vol.15 (1), p.1-13</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2007</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c420t-c3ee12ee02b857a8c6e4e924dd3f599238c809648e3a78dbb25b29dd0d40513e3</citedby><cites>FETCH-LOGICAL-c420t-c3ee12ee02b857a8c6e4e924dd3f599238c809648e3a78dbb25b29dd0d40513e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4100707$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,777,781,793,27905,27906,54739</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4100707$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Baughman, N.E.</creatorcontrib><creatorcontrib>Liberatore, M.</creatorcontrib><creatorcontrib>Levine, B.N.</creatorcontrib><title>Cheat-Proof Playout for Centralized and Peer-to-Peer Gaming</title><title>IEEE/ACM transactions on networking</title><addtitle>TNET</addtitle><description>We explore exploits possible for cheating in real-time, multiplayer games for both client-server and 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, is provably safe and live, 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 presence 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. Specifically, we provide a zero-knowledge proof protocol so that players are within a specific range of each other, and otherwise have no notion of their distance. Our performance claims are backed by analysis using a simulation based on real game traces</description><subject>Analytical models</subject><subject>Cheating</subject><subject>Dead reckoning</subject><subject>Games</subject><subject>Gaming</subject><subject>Multimedia communication</subject><subject>On-line systems</subject><subject>Online</subject><subject>Peer to peer computing</subject><subject>peer-to-peer networking</subject><subject>Performance analysis</subject><subject>Performance loss</subject><subject>Players</subject><subject>Protocols</subject><subject>Real time</subject><subject>Robustness</subject><subject>Scalability</subject><subject>security</subject><subject>Simulation</subject><subject>Synchronism</subject><subject>Synchronization</subject><issn>1063-6692</issn><issn>1558-2566</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kD1PwzAURS0EEqWwI7FEDIgl5fkjji0mFJWCVEGHMltO8gKp0rjYyVB-PYmKGBiY7hvOvdI7hFxSmFEK-m79Ml_PGICcKSWZ0kdkQpNExSyR8ni4QfJYSs1OyVkIGwDKgckJuc8-0HbxyjtXRavG7l3fRZXzUYZt521Tf2EZ2baMVog-7lw8ZrSw27p9PycnlW0CXvzklLw9ztfZU7x8XTxnD8u4EAy6uOCIlCECy1WSWlVIFKiZKEteJVozrgoFWgqF3KaqzHOW5EyXJZQCEsqRT8nNYXfn3WePoTPbOhTYNLZF1wfDhZCaJmIAb_8FqUwpF5wOz0_J9R9043rfDm8YJcWwphUbIDhAhXcheKzMztdb6_eGghmtm9G6Ga2bg_WhcnWo1Ij4iwsKkELKvwGhh3ty</recordid><startdate>20070201</startdate><enddate>20070201</enddate><creator>Baughman, N.E.</creator><creator>Liberatore, M.</creator><creator>Levine, B.N.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20070201</creationdate><title>Cheat-Proof Playout for Centralized and Peer-to-Peer Gaming</title><author>Baughman, N.E. ; Liberatore, M. ; Levine, B.N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c420t-c3ee12ee02b857a8c6e4e924dd3f599238c809648e3a78dbb25b29dd0d40513e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Analytical models</topic><topic>Cheating</topic><topic>Dead reckoning</topic><topic>Games</topic><topic>Gaming</topic><topic>Multimedia communication</topic><topic>On-line systems</topic><topic>Online</topic><topic>Peer to peer computing</topic><topic>peer-to-peer networking</topic><topic>Performance analysis</topic><topic>Performance loss</topic><topic>Players</topic><topic>Protocols</topic><topic>Real time</topic><topic>Robustness</topic><topic>Scalability</topic><topic>security</topic><topic>Simulation</topic><topic>Synchronism</topic><topic>Synchronization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Baughman, N.E.</creatorcontrib><creatorcontrib>Liberatore, M.</creatorcontrib><creatorcontrib>Levine, B.N.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE/ACM transactions on networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Baughman, N.E.</au><au>Liberatore, M.</au><au>Levine, B.N.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Cheat-Proof Playout for Centralized and Peer-to-Peer Gaming</atitle><jtitle>IEEE/ACM transactions on networking</jtitle><stitle>TNET</stitle><date>2007-02-01</date><risdate>2007</risdate><volume>15</volume><issue>1</issue><spage>1</spage><epage>13</epage><pages>1-13</pages><issn>1063-6692</issn><eissn>1558-2566</eissn><coden>IEANEP</coden><abstract>We explore exploits possible for cheating in real-time, multiplayer games for both client-server and 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, is provably safe and live, 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 presence 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. Specifically, we provide a zero-knowledge proof protocol so that players are within a specific range of each other, and otherwise have no notion of their distance. Our performance claims are backed by analysis using a simulation based on real game traces</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TNET.2006.886289</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1063-6692 |
| ispartof | IEEE/ACM transactions on networking, 2007-02, Vol.15 (1), p.1-13 |
| issn | 1063-6692 1558-2566 |
| language | eng |
| recordid | cdi_ieee_primary_4100707 |
| source | IEEE Electronic Library (IEL) |
| subjects | Analytical models Cheating Dead reckoning Games Gaming Multimedia communication On-line systems Online Peer to peer computing peer-to-peer networking Performance analysis Performance loss Players Protocols Real time Robustness Scalability security Simulation Synchronism Synchronization |
| title | Cheat-Proof Playout for Centralized and Peer-to-Peer Gaming |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T20%3A15%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Cheat-Proof%20Playout%20for%20Centralized%20and%20Peer-to-Peer%20Gaming&rft.jtitle=IEEE/ACM%20transactions%20on%20networking&rft.au=Baughman,%20N.E.&rft.date=2007-02-01&rft.volume=15&rft.issue=1&rft.spage=1&rft.epage=13&rft.pages=1-13&rft.issn=1063-6692&rft.eissn=1558-2566&rft.coden=IEANEP&rft_id=info:doi/10.1109/TNET.2006.886289&rft_dat=%3Cproquest_RIE%3E2338408111%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=864915982&rft_id=info:pmid/&rft_ieee_id=4100707&rfr_iscdi=true |