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.

Go to Source of this post
Author Of this post:

By admin