Welcome to the resource topic for 2022/353
Title:
SNARGs for P from Sub-exponential DDH and QR
Authors: James Hulett, Ruta Jawale, Dakshita Khurana, Akshayaram Srinivasan
Abstract:We obtain publicly verifiable Succinct Non-Interactive Arguments (SNARGs) for arbitrary deterministic computations and bounded space non-deterministic computation from standard group-based assumptions, without relying on pairings. In particular, assuming the sub-exponential hardness of both the Decisional Diffie-Hellman (DDH) and Quadratic Residuosity (QR) assumptions, we obtain the following results, where n denotes the length of the instance: 1. A SNARG for any language that can be decided in non-deterministic time T and space S with communication complexity and verifier runtime (n + S) \cdot T^{o(1)}. 2. A SNARG for any language that can be decided in deterministic time T with communication complexity and verifier runtime n \cdot T^{o(1)}.
ePrint: https://eprint.iacr.org/2022/353
Talk: https://www.youtube.com/watch?v=MTPFIwL4IuA
Slides: https://iacr.org/submit/files/slides/2022/eurocrypt/eurocrypt2022/228/slides.pptx
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .