You are looking at a specific version 20200728:183423 of this paper.
See the latest version.
Paper 2020/911
Lossy Correlation Intractability and PPAD Hardness from Sub-exponential LWE
Ruta Jawale and Dakshita Khurana
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)
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- correlation intractabilitylossy functionssumcheckdelegationPPAD
- Contact author(s)
- jawale2 @ illinois edu,dakshita @ illinois edu
- History
- 2020-07-28: last of 2 revisions
- 2020-07-23: received
- See all versions
- Short URL
- https://ia.cr/2020/911
- License
-
CC BY