2026-09-19T13:32:20Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1449432022-08-30T03:11:35Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Vaikuntanathan, Vinod
Kalai, Yael Tauman
Devadas, Lalita
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2022-08-29T16:22:36Z
2022-08-29T16:22:36Z
2022-05
2022-06-21T19:25:42.316Z
https://hdl.handle.net/1721.1/144943
0000-0002-6869-8690
Succinct non-interactive arguments for batch-NP computations, called BARGs (Choudhuri, Jain and Jin, STOC 2021), have emerged as a powerful tool to construct succinct non-interactive arguments (SNARGs) for expressive classes of computations such as all deterministic computations (P), time-space bounded non-deterministic computations (NTISP), and so on. A BARG gives us a way to prove k NP statements where the size of the proof (resp. the verification time) is proportional to the size of a single witness (resp. the time for a single NP verification).
We present a rate-1 construction of a publicly verifiable non-interactive argument system for batch-NP (also called a BARG), under the LWE assumption. Namely, a proof corresponding to a batch of k NP statements each with an m-bit witness, has size m + poly(λ). In contrast, prior work either relied on non-standard knowledge assumptions, or produced proofs of size m · poly(λ) (Kalai, Paneth, and Yang, STOC 2019, and Choudhuri, Jain, and Jin, STOC 2021). The soundness of our construction relies on the learning with errors (LWE) assumption.
We also observe we can obtain an incrementally verifiable computation (IVC) scheme for arbitrary deterministic computations, even beyond P; a multi-hop BARG scheme for NP; and a multi-hop aggregate signature scheme, in the standard model, with unbounded and universal aggregation. Prior to this work, IVC schemes were only known for P under a bilinear map assumption, and beyond P only under non-standard knowledge assumptions or in the random oracle model; multi-hop BARGs were only known under non-standard knowledge assumptions or in the random oracle model; and aggregate signatures were only known under indistinguishability obfuscation (and RSA) or in the random oracle model.
S.M.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright MIT
http://rightsstatements.org/page/InC-EDU/1.0/
Rate-1 non-interactive arguments for batch-NP
Thesis
application/pdf
Master
Master of Science in Electrical Engineering and Computer Science
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="cb1a1040-351a-4c03-a447-51481627b057">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>Rate-1 non-interactive arguments for batch-NP</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2022-05</PublicationDate>
<Authors>
<Author>
<DisplayName>Devadas, Lalita</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://rightsstatements.org/page/InC-EDU/1.0/</License>
<Abstract>Succinct non-interactive arguments for batch-NP computations, called BARGs (Choudhuri, Jain and Jin, STOC 2021), have emerged as a powerful tool to construct succinct non-interactive arguments (SNARGs) for expressive classes of computations such as all deterministic computations (P), time-space bounded non-deterministic computations (NTISP), and so on. A BARG gives us a way to prove k NP statements where the size of the proof (resp. the verification time) is proportional to the size of a single witness (resp. the time for a single NP verification).
We present a rate-1 construction of a publicly verifiable non-interactive argument system for batch-NP (also called a BARG), under the LWE assumption. Namely, a proof corresponding to a batch of k NP statements each with an m-bit witness, has size m + poly(λ). In contrast, prior work either relied on non-standard knowledge assumptions, or produced proofs of size m · poly(λ) (Kalai, Paneth, and Yang, STOC 2019, and Choudhuri, Jain, and Jin, STOC 2021). The soundness of our construction relies on the learning with errors (LWE) assumption.
We also observe we can obtain an incrementally verifiable computation (IVC) scheme for arbitrary deterministic computations, even beyond P; a multi-hop BARG scheme for NP; and a multi-hop aggregate signature scheme, in the standard model, with unbounded and universal aggregation. Prior to this work, IVC schemes were only known for P under a bilinear map assumption, and beyond P only under non-standard knowledge assumptions or in the random oracle model; multi-hop BARGs were only known under non-standard knowledge assumptions or in the random oracle model; and aggregate signatures were only known under indistinguishability obfuscation (and RSA) or in the random oracle model.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>