COPLAS: Rubio, Formal Methods in Zero-Knowledge Protocols: Challenges in the circom Programming Language
On 7 December, Albert Rubio,
A combined COPLAS Talk and DS (Decentralized Systems) Talk.
Abstract
The most widely studied language in the context of Zero-Knowledge (ZK) proofs is arithmetic circuit satisfiability. In this talk we present circom, a programming language and a compiler that allows the programmer to provide a low-level description of the arithmetic circuit together with an effective way to execute it. We will introduce challenging safety properties to be checked in circom programs and show the need of improving existing techniques to analyse and simplify the nonlinear arithmetic constraints generated by the compiler.
Bio
Albert is professor at Complutense University of Madrid.
Registration
All are welcome. No registration required. Feel free to forward this invitation.
To be informed about Copenhagen Programming Languages Seminar (COPLAS) and related talks, join this mailing list. If you are interested in joining the (open) Decentralized Systems Group at DIKU, please contact Fritz Henglein.