Paper 2021/110
Replacing Probability Distributions in Security Games via Hellinger Distance
Kenji Yasunaga
Abstract
Security of cryptographic primitives is usually proved by assuming ``ideal'' probability distributions. We need to replace them with approximated ``real'' distributions in the real-world systems without losing the security level. We demonstrate that the Hellinger distance is useful for this problem, while the statistical distance is mainly used in the cryptographic literature. First, we show that for preserving
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Minor revision. ITC 2021
- Keywords
- bit securityHellinger distanceleftover hash lemmarandomness extractor
- Contact author(s)
- yasunaga @ ist osaka-u ac jp
- History
- 2021-07-19: revised
- 2021-02-01: received
- See all versions
- Short URL
- https://ia.cr/2021/110
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/110, author = {Kenji Yasunaga}, title = {Replacing Probability Distributions in Security Games via Hellinger Distance}, howpublished = {Cryptology {ePrint} Archive, Paper 2021/110}, year = {2021}, url = {https://eprint.iacr.org/2021/110} }