Cheat-proof serverless network games

0Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider playing online games on peer-to-peer networks, without assuming servers that control the execution of a game. In such an environment, players may cheat the opponent by, for example, illegally replacing the cards in their hands. The aim of this paper is to examine a possibility of excluding such cheatings. We show that by employing cryptographic techniques, we can exclude some types of cheating at some level. Finally, based on our discussion, we implement the cheat-proof network "Gunjin-Shogi", which is a variant of Japanese Chess. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Kato, S., Miyazaki, S., Nishimura, Y., & Okabe, Y. (2007). Cheat-proof serverless network games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4630 LNCS, pp. 234–243). Springer Verlag. https://doi.org/10.1007/978-3-540-75538-8_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free