Ziyi Guan - On the Security of Succinct Arguments from Probabilistic Proofs скачать в хорошем качестве

Ziyi Guan - On the Security of Succinct Arguments from Probabilistic Proofs

Abstract: Succinct arguments are fundamental cryptographic primitives with wide-ranging applications. A common approach to build succinct arguments is from probabilistic proofs, dating back to Kilian’s protocol that combines a PCP and a Merkle tree. In this talk, I will present the tightest bound on the regular security of Kilian’s protocol and show how to obtain similar bounds for more general argument systems, such as those based on polynomial commitment schemes. I’ll conclude with results that achieve post-quantum security and Fiat-Shamir security for general classes of arguments. Bio: Ziyi Guan (https://ziyiguan.github.io/) is a fourth-year Ph.D. student at the EPFL theory group, advised by Alessandro Chiesa and Mika Göös. She received a B.S. in Computer Science and a B.S. in Mathematical Sciences from Carnegie Mellon University in 2020. She works on theoretical computer science, particularly complexity theory, probabilistic proof systems, cryptography, and quantum computing.