{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/116136"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/116136","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Succinct non-interactive arguments for bounded depth computations","abstract":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms","abstract_html":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms","abstract_has_math":false,"creators":["Jawale, Ruta S"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Khurana, Dakshita"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2022,"date_issued":"2022-08","date_published":"2022-08","updated_at":"2026-07-22T22:24:55Z","subjects":["cryptography","cryptographic protocols","delegation schemes","non-interactive","Fiat-Shamir","sum-check","GKR","PPAD","lossy","correlation intractability"],"languages":["en","eng"],"rights":["Copyright 2022 Ruta Jawale"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2142/116136","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Khurana, Dakshita"]},{"key":"dc:creator","label":"Author","values":["Jawale, Ruta S"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2022-08","2022-04-25"]},{"key":"dc:type","label":"Dc Type","values":["text","Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["cryptography","cryptographic protocols","delegation schemes","non-interactive","Fiat-Shamir","sum-check","GKR","PPAD","lossy","correlation intractability"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en","eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2022 Ruta Jawale"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://hdl.handle.net/2142/116136"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms","The student, Ruta Jawale, accepted the attached license on 2022-04-21 at 18:40.","The student, Ruta Jawale, submitted this Thesis for approval on 2022-04-21 at 19:00.","This Thesis was approved for publication on 2022-04-25 at 14:43.","DSpace SAF Submission Ingestion Package generated from Vireo submission #17902 on 2022-11-15 at 17:37:23","We construct a succinct non-interactive publicly-verifiable delegation scheme for any logspace uniform circuit under the sub-exponential Learning With Errors (LWE) assumption. For a circuit C : {0, 1}^N → {0, 1} of size S and depth D, the prover runs in time poly(S), the communication complexity is D · polylog(S), and the verifier runs in time (D + N) · polylog(S). To obtain this result, we introduce a new cryptographic primitive: a lossy correlation-intractable hash function family. We use this primitive to soundly instantiate the Fiat-Shamir transform for a large class of interactive proofs, including the interactive sum-check protocol and the Goldwasser-Kalai-Rothblum (GKR) protocol, assuming the subexponential hardness of LWE. Additionally, by relying on the result of Choudhuri et al. (STOC 2019), we establish (sub-exponential) average-case hardness of PPAD, assuming the sub-exponential hardness of LWE."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Succinct non-interactive arguments for bounded depth computations"]}]}],"canonical_facts":{"dc:contributor":["Khurana, Dakshita"],"dc:creator":["Jawale, Ruta S"],"dc:date":["2022-08","2022-04-25"],"dc:description":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms","The student, Ruta Jawale, accepted the attached license on 2022-04-21 at 18:40.","The student, Ruta Jawale, submitted this Thesis for approval on 2022-04-21 at 19:00.","This Thesis was approved for publication on 2022-04-25 at 14:43.","DSpace SAF Submission Ingestion Package generated from Vireo submission #17902 on 2022-11-15 at 17:37:23","We construct a succinct non-interactive publicly-verifiable delegation scheme for any logspace uniform circuit under the sub-exponential Learning With Errors (LWE) assumption. For a circuit C : {0, 1}^N → {0, 1} of size S and depth D, the prover runs in time poly(S), the communication complexity is D · polylog(S), and the verifier runs in time (D + N) · polylog(S). To obtain this result, we introduce a new cryptographic primitive: a lossy correlation-intractable hash function family. We use this primitive to soundly instantiate the Fiat-Shamir transform for a large class of interactive proofs, including the interactive sum-check protocol and the Goldwasser-Kalai-Rothblum (GKR) protocol, assuming the subexponential hardness of LWE. Additionally, by relying on the result of Choudhuri et al. (STOC 2019), we establish (sub-exponential) average-case hardness of PPAD, assuming the sub-exponential hardness of LWE."],"dc:format":["application/pdf"],"dc:identifier":["https://hdl.handle.net/2142/116136"],"dc:language":["en","eng"],"dc:rights":["Copyright 2022 Ruta Jawale"],"dc:subject":["cryptography","cryptographic protocols","delegation schemes","non-interactive","Fiat-Shamir","sum-check","GKR","PPAD","lossy","correlation intractability"],"dc:title":["Succinct non-interactive arguments for bounded depth computations"],"dc:type":["text","Thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:55Z"}