The Taub Faculty of Computer Science Events and Talks

We are interested in public-setup Zero-Knowledge proof systems for natural languages in NP with poly-logarithmic Verifier and quasi-linear Prover. Systems having such properties can be compiled efficiently to succinct publicly verifiable arguments, that could in practice effect our lives in many aspects. Although the theory behind such systems has been studied for about 3 decades, practical solutions do not yet achieve desired requirements. In a "Theory to Practice and back again" research we have made a few steps towards practical implementation. Recent advances that are covered in the talk: - Improved Zero-Knowledge protocol. - Implementation of such a system, with concrete measurements. The lecture does not assume any prior knowledge in this field. Based on joint works with Eli Ben-Sasson, Iddo Ben-Tov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Mark Siberstein, Nicholas Spooner, Eran Tromer and Madars Virza.