A Novel Power-Sum PRG with Applications to Lattice-Based zkSNARKs

ePrint Report: A Novel Power-Sum PRG with Applications to Lattice-Based zkSNARKs

Charanjit S Jutla, Eamonn W. Postlethwaite, Arnab Roy

zkSNARK is a cryptographic primitive that allows a prover to prove to a resource constrained verifier, that it has indeed performed a specified non-deterministic computation correctly, while hiding private witnesses. In this work we focus on lattice based zkSNARK, as this serves two important design goals. Firstly, we get post-quantum zkSNARK schemes with $O(\log (\mbox{Circuit size}))$ sized proofs (without random oracles) …

applications computation cryptographic eprint report indeed non novel power private prove report resource zksnarks