• Calendar

February 13, Wednesday
12:00 – 13:30

In recent years there has been a growing interest in bridging Game Theory and Cryptography. While the standard Cryptographic settings view players as either totally honest or arbitrarily malicious, Game Theory assumes that players are rational, selfish individuals. Designing protocols for such settings poses new challenges. We investigate rational versions of two classical problems in foundations of cryptography: secret sharing and function evaluation. We show that schemes for these tasks, in which players' values come from a bounded domain, cannot satisfy some of the most desirable properties. In contrast, we suggest protocols for rational secret sharing where the shares come from an unbounded domain, but have a finite expectation.