Welcome to the resource topic for 2021/932
Title:
Succinct Functional Commitment for a Large Class of Arithmetic Circuits
Authors: Helger Lipmaa, Kateryna Pavlyk
Abstract:A succinct functional commitment (SFC) scheme for a circuit class \mathbf{CC} enables, for any circuit \mathcal{C} \in \mathbf{CC}, the committer to first succinctly commit to a vector \vec{\alpha}, and later succinctly open the commitment to \mathcal{C} (\vec{\alpha}, \vec{\beta}), where the verifier chooses \vec{\beta} at the time of opening. Unfortunately, SFC commitment schemes are known only for severely limited function classes like the class of inner products. By making non-black-box use of SNARK-construction techniques, we propose an SFC scheme for the large class of semi-sparse polynomials. The new SFC scheme can be used to, say, efficiently (1) implement sparse polynomials, and (2) aggregate various interesting SFC (e.g., vector commitment and polynomial commitment) schemes. The new scheme is evaluation-binding under a new instantiation of the computational uber-assumption. We provide a thorough analysis of the new assumption.
ePrint: https://eprint.iacr.org/2021/932
Talk: https://www.youtube.com/watch?v=OTgTus74hFQ
Slides: https://iacr.org/submit/files/slides/2020/asiacrypt/ac2020/274/slides.pdf
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 .