Shubham Khurana

Zero-Knowledge Extension of PARI

PARI is a recent SNARK based on equifficient polynomial commitments, giving an exceptionally compact proof of just 1280 bits over the BLS12-381 curve, which is the smallest among all the known SNARKs in the literature. However, PARI does not achieve the zero-knowledge property; d...