Efficient Zero Knowledge Proof Protocols and Their Applications to Decision Tree Predictions and Accuracy (Jiaheng Zhang)

Abstract

We present two efficient zero knowledge proofs protocols with optimal prover computation, Libra and Virgo. Libra has linear prover time, logarithmic verification time and proof size. It needs a universal trusted setup. Virgo removes the trusted setup of Libra and remains roughly the same complexity by a new transparent zero knowledge verifiable polynomial delegation scheme. 


In addition, we initiate the study of zero knowledge machine learning and propose protocols for zero knowledge decision tree predictions and accuracy tests (ZKDT). The protocols allow the owner of a decision tree model to convince others that the model computes a prediction on a data sample, or achieves a certain accuracy on a public dataset, without leaking any information about the model itself.

Time

2020-11-10   10:00 ~ 11:00   

Speaker

Jiaheng Zhang, UC Berkeley

Room

Room 602, School of Information Management & Engineering, Shanghai University of Finance & Economics