Paper 2020/911 Original: eprint.iacr.org/2020/911 ↗
Lossy Correlation Intractability and PPAD Hardness from Sub-exponential LWE
Abstract
We introduce a new cryptographic primitive, a lossy correlation-intractable hash function, and use it to soundly instantiate the Fiat-Shamir transform for the general interactive sumcheck protocol, assuming sub-exponential hardness of the Learning with Errors (LWE) problem. By combining this with the result of Choudhuri et al. (STOC 2019), we show that $\#\mathsf{SAT}$ reduces to end-of-line, which is a $\mathsf{PPAD}$-complete problem, assuming the sub-exponential hardness of LWE.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2020-07-28: last updated
- 2020-07-23: published
- Short URL
- https://ia.cr/2020/911
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2020/911,
author = {Ruta Jawale and Dakshita Khurana},
title = {Lossy Correlation Intractability and PPAD Hardness from Sub-exponential LWE},
howpublished = {Cryptology {ePrint} Archive, Paper 2020/911},
year = {2020},
url = {https://eprint.iacr.org/2020/911}
}