BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//project/author//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTEND:20221118T120000Z
UID:7e58fd5f074aa3b84b7dc64eb19fd8ab-355
DTSTAMP:19700101T120010Z
DESCRIPTION:Efficient zero-knowledge proofs based on vector-oblivious linear evaluation
URL;VALUE=URI:https://www.csa.iisc.ac.in/newweb/event/355/efficient-zero-knowledge-proofs-based-on-vector-oblivious-linear-evaluation/
SUMMARY:Zero-knowledge (ZK) proofs with an optimal memory footprint have attracted a lot of attention because such protocols can easily prove very large computations with a small memory requirement. In this talk, the speaker will talk about some recent progress on concretely efficient ZK protocols based on VOLE 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. Finally, the speaker will talk about more recent advances that lead to sublinear communication VOLE zero-knowledge proof protocols.
DTSTART:20221118T120000Z
END:VEVENT
END:VCALENDAR