Published Articles >> Table of Contents >> Abstract

Fourth International Conference on Peer-to-Peer Computing (P2P'04)   pp. 100-107
P2P Scrabble. Can P2P Games Commence?
Adam Wierzbicki, Polish-Japanese Institute of Information Technology
Tomasz Kucharski, Polish-Japanese Institute of Information Technology

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PTP.2004.1334936
Send link to a friend

Abstract
The article considers the design of P2P games without trusted, centralized resources. The main difficulty is how to prevent the possibility of cheating. The article considers Scrabble as a case study and attempts to solve issues such as maintenance of public, private, and concealed public state, as well as secret drawing from a finite set of objects. The issues of state replication are considered to allow node leaves. The article presents a fair protocol for secret drawing from a finite state that is resistant to node leaves.
Back to Top Additional Information
Index Terms- peer-to-peer, trust management, distributed hash tables, commitment protocols, secret sharing Citation:  Adam Wierzbicki, Tomasz Kucharski, "P2P Scrabble. Can P2P Games Commence?," p2p, pp. 100-107,  Fourth International Conference on Peer-to-Peer Computing (P2P'04),  2004