Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR23-098 | 5th July 2023 09:13

Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method

RSS-Feed




TR23-098
Authors: Andrej Bogdanov, Pravesh Kothari, Alon Rosen
Publication: 6th July 2023 14:37
Downloads: 345
Keywords: 


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.



ISSN 1433-8092 | Imprint