| Title | : | Through the lens of SNARGs: hard games, faster prime search and more |
| Speaker | : | Dr. Chethan Kamath (Post-doctoral fellow at Tel Aviv University) |
| Details | : | Wed, 10 May, 2023 10:00 AM @ SSB 223 (MR1) |
| Abstract: | : | Relaxing what constitutes a "proof" via notions such as interactive proof or probabilistically-checkable proof has turned out to have far-reaching consequences for complexity theory and cryptography. In this talk, I will focus on a related notion of *succinct non-interactive arguments* (SNARGs). I will describe two applications of SNARGs based on my works, one theoretical and the other practical. The theoretical application concerns the hardness of a complexity class PPAD, which characterises important computational problems from fields such as game theory and combinatorics. As for the practical application, I will explain how customised SNARGs can help accelerate our search for giant prime numbers. |
