Paper 2019/050
Improved Security Evaluation Techniques for Imperfect Randomness from Arbitrary Distributions
Takahiro Matsuda, Kenta Takahashi, Takao Murakami, and Goichiro Hanaoka
Abstract
Dodis and Yu (TCC 2013) studied how the security of cryptographic primitives that are secure in the "ideal" model in which the distribution of a randomness is the uniform distribution, is degraded when the ideal distribution of a randomness is switched to a "real-world" (possibly biased) distribution that has some lowerbound on its min-entropy or collision-entropy. However, in many constructions, their security is guaranteed only when a randomness is sampled from some non-uniform distribution (such as Gaussian in lattice-based cryptography), in which case we cannot directly apply the results by Dodis and Yu.
In this paper, we generalize the results by Dodis and Yu using the Rényi divergence, and show how the security of a cryptographic primitive whose security is guaranteed when the ideal distribution of a randomness is a general (possibly non-uniform) distribution
Metadata
- Available format(s)
-
PDF
- Publication info
- Published by the IACR in PKC 2019
- Keywords
- security evaluationRenyi divergencesquare-friendlyinversion sampling
- Contact author(s)
-
t-matsuda @ aist go jp
tmatsuda310 @ gmail com - History
- 2019-01-25: received
- Short URL
- https://ia.cr/2019/050
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/050, author = {Takahiro Matsuda and Kenta Takahashi and Takao Murakami and Goichiro Hanaoka}, title = {Improved Security Evaluation Techniques for Imperfect Randomness from Arbitrary Distributions}, howpublished = {Cryptology {ePrint} Archive, Paper 2019/050}, year = {2019}, url = {https://eprint.iacr.org/2019/050} }