Abstract
Over the last decade, zero-knowledge proofs have experienced a substantial increase in adoption, primarily in distributed blockchain and financial applica- tions, where both transparency and privacy are important. With the help of smart contracts, blockchain applications have diversified, making it possible to play video games in a decentralized manner. Zero-knowledge proofs have simi- larly expanded their scope, and this thesis explores their usefulness and utility for video games in particular. Although they can be applied to some degree across different game types, the ability to prove facts about secret statements is naturally best highlighted in games that revolve around hidden states, also known as incomplete information games, such as Battleship. The thesis presents an in-depth analysis and evaluation of zero-knowledge protocols used in such games, taking into consideration the effect those protocols have on each game, as well as identifying their potential limitations for each use case. Addition- ally, an implementation of a number guessing game is presented, demonstrating how zero-knowledge proofs can be generated and incorporated in incomplete information games using the currently available domain-specific software.