[Resource Topic] 2019/1400: RedShift: Transparent SNARKs from List Polynomial Commitment IOPs

Welcome to the resource topic for 2019/1400

RedShift: Transparent SNARKs from List Polynomial Commitment IOPs

Authors: Assimakis Kattis, Konstantin Panarin, Alexander Vlasov


We introduce an efficient transformation from univariate polynomial commitment based zk-SNARKs to their fully transparent counterparts. The transformation is achieved with the help of a new IOP primitive which we call a list polynomial commitment. This primitive is applicable for preprocessing zk-SNARKs over both prime and binary fields. We present the primitive itself along with a soundness analysis of the transformation and instantiate it with an existing universal proof system. We also present benchmarks for a proof of concept implementation alongside a comparison with a non-transparent alternative based on Kate commitments. Our results show competitive efficiency both in terms of proof size and generation times at large security levels.

ePrint: https://eprint.iacr.org/2019/1400

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 .