Efficient and Affordable Zero-Knowledge Proofs: ResNet Inference and RAM Computation

Efficient and Affordable Zero-Knowledge Proofs: ResNet Inference and RAM Computation

Cybersecurity Seminars Online seminar
Thursday, 07 October 2021
11 am - 12 pm (AEDT)

Zero-knowledge (ZK) proofs with an optimal memory footprint have attracted a lot of attention because such protocols can easily prove very large computation with a small memory requirement. In this talk, the speaker will talk about some recent progress on concretely efficient ZK protocols and their applications in this setting. These protocols are very cheap computationally and can prove large statements like ResNet inference or large RAM-based computation with ease; on the other hand, it is designated-verifier, and the proof size is often linear to the circuit size.

The unique features of the protocol make it highly affordable. With the cost of one Caffe Latte (Grande size, tax excluded), we could prove 3.65 trillion AND gates at a speed of 0.2 microseconds (~1-bit communication) per AND gate using low-end machines. Implementation and latest performance can be found at https://github.com/emp-toolkit/emp-zk

Talk based on:
1. Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits, Chenkai Weng and Kang Yang and Jonathan Katz and Xiao Wang, IEEE S&P 2021
2. QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field, Kang Yang and Pratik Sarkar and Chenkai Weng and Xiao Wang, ACM CCS 2021
3. Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning, Chenkai Weng, Kang Yang, Xiang Xie, Jonathan Katz, and Xiao Wang, USENIX 2021
4. Constant-Overhead Zero-Knowledge for RAM Programs, Nicholas Franzese, Jonathan Katz, Steve Lu, Rafail Ostrovsky, Xiao Wang, and Chenkai Weng, ACM CCS 2021

About the speaker

Xiao Wang
Assistant Professor, Northwestern University

Xiao Wang's research interests include computer security, privacy, and cryptography. Recently, he is working on practical multi-party computation, zero-knowledge proof, oblivious RAM, and post-quantum cryptography. He likes building real systems based on advanced cryptographic techniques and pushing their limits of practicality.

Monash University values the privacy of every individual's personal information and is committed to the protection of that information from unauthorised use and disclosure except where permitted by law. For information about the handling of your personal information please see Data Protection and Privacy Procedure and the relevant Data Protection and Privacy Collection Statement that applies to you depending on the nature of your interaction with us.

If you have any questions about how Monash University is collecting and handling your personal information, please contact our Data Protection and Privacy Office at dataprotectionofficer@monash.edu.


Event contact

Share this event