Repeated Games for Generating Randomness in Encryption

Repeated Games for Generating Randomness in Encryption

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2018/04/01, Vol.E101.A(4), pp.697-703
Hauptverfasser: YASUNAGA, Kenji, YUZAWA, Kosuke
Format: Artikel
Sprache:eng
Schlagworte:
Encryption
Game theory
Randomness
repeated game
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0916-8508
1745-1337
DOI:10.1587/transfun.E101.A.697