Secure peer-to-peer trading in small- and large-scale multiplayer games

A fundamental aspect of many multiplayer online games is the ability to trade items between players. Trading may occur with items that were found in the virtual environment, included as pieces of the game, or purchased by the player as assets. Regardless of the types of items, any multiplayer game that supports trading or exchanging items in the game must do so in a secure manner. We have developed a protocol to solve the problem of secure peer-to-peer trading in games in which the primary concern is that items are exchanged fairly, and additionally that items are not duplicated. Our protocol enables one-way and two-way trades and can be extended to multi-item trades in both small- and large-scale games where trades last only for the duration of a session or are persistent. We show that our protocol addresses the security threats which it might encounter, and then provide an analysis to demonstrate its scalability.

[1]  Miguel Castro,et al.  Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.

[2]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[3]  Chris GauthierDickey,et al.  Secure peer-to-peer trading for multiplayer games , 2012, 2012 11th Annual Workshop on Network and Systems Support for Games (NetGames).

[4]  Maha Abdallah,et al.  VoroGame: A Hybrid P2P Architecture for Massively Multiplayer Games , 2009, 2009 6th IEEE Consumer Communications and Networking Conference.

[5]  Peter Druschel,et al.  Peer-to-peer systems , 2010, Commun. ACM.

[6]  Sean Rooney,et al.  A federated peer-to-peer network game architecture , 2004, IEEE Communications Magazine.

[7]  Adam Wierzbicki,et al.  Fair and scalable peer-to-peer games of turns , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[8]  Ivan Damgård.  Practical and Provably Secure Release of a Secret and Exchange of Signatures , 1993, EUROCRYPT.

[9]  N. Asokan,et al.  Asynchronous protocols for optimistic fair exchange , 1998, Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186).

[10]  Robert H. Deng,et al.  Efficient and practical fair exchange protocols with off-line TTP , 1998, Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186).

[11]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[12]  Dirk Neumann,et al.  An asynchronous and secure ascending peer-to-peer auction , 2005, P2PECON '05.

[13]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[14]  Marcus Fontoura,et al.  Decentralized Peer-to-Peer Auctions , 2005, Electron. Commer. Res..

[15]  Paul F. Syverson,et al.  Weakly secret bit commitment: applications to lotteries and fair exchange , 1998, Proceedings. 11th IEEE Computer Security Foundations Workshop (Cat. No.98TB100238).

[16]  Michael K. Reiter,et al.  Fair Exchange with a Semi-Trusted Third Party (extended abstract) , 1997, CCS.

[17]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM '04.

[18]  Silvio Micali,et al.  A fair protocol for signing contracts , 1990, IEEE Trans. Inf. Theory.

[19]  Chris GauthierDickey,et al.  Match+Guardian: a secure peer-to-peer trading card game protocol , 2012, Multimedia Systems.

[20]  Kazuo Ohta,et al.  How to simultaneously exchange secrets by general assumptions , 1994, CCS '94.

[21]  Honghui Lu,et al.  Peer-to-peer support for massively multiplayer games , 2004, IEEE INFOCOM 2004.

[22]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[23]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.