Repeated Games for Generating Randomness in Encryption

Kenji YASUNAGA  Kosuke YUZAWA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E101-A   No.4   pp.697-703
Publication Date: 2018/04/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E101.A.697
Type of Manuscript: PAPER
Category: Cryptography and Information Security
Keyword: 
game theory,  repeated game,  randomness,  encryption,  

Full Text: PDF(681KB)>>
Buy this Article



Summary: 
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.