P2P Scrabble. Can P2P Games Commence?

  • Authors:
  • Adam Wierzbicki;Tomasz Kucharski

  • Affiliations:
  • Polish-Japanese Institute of Information Technology;Polish-Japanese Institute of Information Technology

  • Venue:
  • P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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.