DocumentCode
3445099
Title
"P2P scrabble. Can P2P games commence?"
Author
Wierzbicki, Adam ; Kucharski, Tomasz
Author_Institution
Polish-Japanese Inst. of Inf. Technol., Warsaw, Poland
fYear
2004
fDate
25-27 Aug. 2004
Firstpage
100
Lastpage
107
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.
Keywords
computer games; data privacy; file organisation; peer-to-peer computing; security of data; P2P games; P2P scrabble; commitment protocols; distributed hash tables; fair protocol; finite state; node leaves; secret drawing; secret sharing; state replication; trust management; trusted centralized resources; Computer architecture; Computer networks; Control systems; Cryptography; History; Information technology; Multiagent systems; Peer to peer computing; Physics computing; Protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Peer-to-Peer Computing, 2004. Proceedings. Proceedings. Fourth International Conference on
Print_ISBN
0-7695-2156-8
Type
conf
DOI
10.1109/PTP.2004.1334936
Filename
1334936
Link To Document