Cryptology ePrint Archive: Report 2017/218

Repeated Games for Generating Randomness in Encryption

Kenji Yasunaga and Kosuke Yuzawa

Abstract: In encryption schemes, the sender may not generate randomness properly if generating randomness is costly, and the sender is not concerned about the security of a message. The problem was studied by the first author (2016), and was formalized in a game-theoretic framework. In this work, we construct an encryption scheme with an optimal round complexity on the basis of the mechanism of repeated games.

Category / Keywords: cryptographic protocols / game theory, repeated game, randomness, encryption

Date: received 1 Mar 2017, last revised 3 Dec 2017

Contact author: yasunaga at se kanazawa-u ac jp

Available format(s): PDF | BibTeX Citation

Version: 20171204:020227 (All versions of this report)

Short URL: ia.cr/2017/218

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]