Paper 2017/218 Original: eprint.iacr.org/2017/218 ↗
Repeated Games for Generating Randomness in Encryption
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2017-12-04: last updated
- 2017-03-04: published
- Short URL
- https://ia.cr/2017/218
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2017/218,
author = {Kenji Yasunaga and Kosuke Yuzawa},
title = {Repeated Games for Generating Randomness in Encryption},
howpublished = {Cryptology {ePrint} Archive, Paper 2017/218},
year = {2017},
url = {https://eprint.iacr.org/2017/218}
}