Fair Games Against an All-Powerful Adversary (original) (raw)

DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1991

Abstract

Suppose that a weak (polynomial time) device needs to interact over a clear channelwith a strong (infinitely-powerful) and untrustworthy adversarial device. Assumingthe existence of one-way functions, during this interaction (game) the infinitelypowerfuldevice can encrypt and (computationally) hide information from the weakdevice. However, to keep the game fair, the weak player must hide information fromthe infinitely-powerful player in the information-theoretic sense.

Moti Yung hasn't uploaded this paper.

Let Moti know you want this paper to be uploaded.

Ask for this paper to be uploaded.