Cyber Security Webinar by Dr. Shihui Fu of the University of Waterloo - Transparent Succinct Zero-Knowledge Arguments for R1CS with Efficient Verifier

Join Zoom Meeting

https://tudelft.zoom.us/j/95108026354?pwd=RVhXS3EwQjIyZnVzNk1ScWNzQmtTdz09

Meeting ID: 951 0802 6354

Passcode: 378365

Abstract 

We propose Polaris, a zkSNARK with quasi-linear prover time and both polylogarithmic proof size and verification time in the size of the arithmetic circuit representing the statement. By instantiating with different commitment schemes, we obtain several zkSNARKs where the verifier's costs and the proof size range from $O(\log^2{N})$ to $O(\sqrt{N})$ depending on the underlying polynomial commitment schemes. All these schemes do not require a trusted setup. It is plausibly post-quantum secure when instantiated with a secure collision-resistant hash function. Our experimental evaluation demonstrates that Polaris offers a much lower verification time than Ligero and Aurora for instances with large sizes as we reduce the complexity from linear to polylogarithmic.

Short bio

Shihui Fu received his Ph.D. degree in Mathematics from Academy of Mathematics and Systems Science, CAS in 2018. Currently, he is a post-doc in University of Waterloo. His main research interests include cryptographic protocols and zero-knowledge proof.