The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Building Secure and Dependable Online Gaming Applications
Abstract
Online gaming has become a multibillion-dollar industry. The security and dependability of such games are critical for both the game providers and honest game players alike. Essential to all such applications is the use of random numbers; for example, random numbers are needed to shuffle cards. For obvious reasons, if the hands can be predicated, players could gain unfair advantages. The nature of this type of applications poses great challenges in increasing their availability while preserving their integrity (Arkin, Hill, Marks, Scjmod, & Walls, 1999; Viega & McGraw, 2002; Young & Yung, 2004). Byzantine fault tolerance (BFT; Castro & Liskov, 2002) is a well-known technique to tolerate various malicious attacks to online systems and it often involves state machine replication (Schneider, 1990). However, state machine replication assumes that all replicas are deterministic, which is not the case for online gaming applications. In this article, we elaborate how we address this dilemma using an online poker application that uses a pseudorandom number generator (PRNG) to shuffle the cards as an illustrating example. We propose two alternative strategies to cope with the intrinsic application nondeterminism. One depends on a Byzantine consensus algorithm and the other depends on a practical threshold signature scheme. Furthermore, we thoroughly discuss the strength and weaknesses of these two schemes.
Related Content
|
Christine Kosmopoulos.
© 2022.
22 pages.
|
|
Melkamu Beyene, Solomon Mekonnen Tekle, Daniel Gelaw Alemneh.
© 2022.
21 pages.
|
|
Rajkumari Sofia Devi, Ch. Ibohal Singh.
© 2022.
21 pages.
|
|
Ida Fajar Priyanto.
© 2022.
16 pages.
|
|
Murtala Ismail Adakawa.
© 2022.
27 pages.
|
|
Shimelis Getu Assefa.
© 2022.
17 pages.
|
|
Angela Y. Ford, Daniel Gelaw Alemneh.
© 2022.
22 pages.
|
|
|