Paper 2023/1049
Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method
Abstract
The low-degree method postulates that no efficient algorithm outperforms low-degree polynomials in certain hypothesis-testing tasks. It has been used to understand computational indistinguishability in high-dimensional statistics. We explore the use of the low-degree method in the context of cryptography. To this end, we apply it in the design and analysis of a new public-key encryption scheme whose security is based on Goldreich's pseudorandom generator. The scheme is a combination of two proposals of Applebaum, Barak, and Wigderson, and inherits desirable features from both.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- local pseudorandom generatorshypothesis testinglow-degree methodaverage-case hardness
- Contact author(s)
-
abogdano @ uottawa ca
praveshk @ cs cmu edu
alon rosen @ unibocconi it - History
- 2023-07-05: approved
- 2023-07-05: received
- See all versions
- Short URL
- https://ia.cr/2023/1049
- License
-
CC0
BibTeX
@misc{cryptoeprint:2023/1049,
author = {Andrej Bogdanov and Pravesh Kothari and Alon Rosen},
title = {Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method},
howpublished = {Cryptology ePrint Archive, Paper 2023/1049},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/1049}},
url = {https://eprint.iacr.org/2023/1049}
}
