Finitely Iterated Rational Secret Sharing With Private Information

Date

2015-01-06

Authors

Foster, Chelsey

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

This thesis considers the problem of finitely iterated rational secret sharing. We describe how to evaluate this problem using game theory and finitely iterated prisoner’s dilemma. The players each have a private horizon that the other player does not know. The only thing that a player knows about their opponent’s private horizon is a common upper bound. The description of a synchronous and asynchronous finitely iterated secret sharing protocol with private information is followed by a game theoretic proof of the viability of such protocols.

Description

Keywords

Rational Secret Sharing, Uncertainty in Prisoners Dilemma, Privately Informed Prisoners Dilemma, Rational Multi party computation

Citation