Parallelizable Delegation from LWE

Cody Freitag, Rafael Pass, Naomi Sirkin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present the first non-interactive delegation scheme for P with time-tight parallel prover efficiency based on standard hardness assumptions. More precisely, in a time-tight delegation scheme—which we refer to as a SPARG (succinct parallelizable argument)—the prover’s parallel running time is t+ polylog (t), while using only polylog (t) processors and where t is the length of the computation. (In other words, the proof is computed essentially in parallel with the computation, with only some minimal additive overhead in terms of time). Our main results show the existence of a publicly-verifiable, non-interactive, SPARG for P assuming polynomial hardness of LWE. Our SPARG construction relies on the elegant recent delegation construction of Choudhuri, Jain, and Jin (FOCS’21) and combines it with techniques from Ephraim et al. (EuroCrypt’20). We next demonstrate how to make our SPARG time-independent—where the prover and verifier do not need to known the running-time t in advance; as far as we know, this yields the first construction of a time-tight delegation scheme with time-independence based on any hardness assumption. We finally present applications of SPARGs to the constructions of VDFs (Boneh et al., Crypto’18), resulting in the first VDF construction from standard polynomial hardness assumptions (namely LWE and the minimal assumption of a sequentially hard function).

Original languageEnglish
Title of host publicationTheory of Cryptography - 20th International Conference, TCC 2022, Proceedings
EditorsEike Kiltz, Vinod Vaikuntanathan
PublisherSpringer Science and Business Media Deutschland GmbH
Pages623-652
Number of pages30
ISBN (Print)9783031223648
DOIs
StatePublished - 2022
Event20th Theory of Cryptography Conference, TCC 2022 - Chicago, United States
Duration: 7 Nov 202210 Nov 2022

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13748 LNCS

Conference

Conference20th Theory of Cryptography Conference, TCC 2022
Country/TerritoryUnited States
CityChicago
Period7/11/2210/11/22

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Parallelizable Delegation from LWE'. Together they form a unique fingerprint.

Cite this