Please note: This half-hour seminar will take place in M3 4206 and online.
Vahid Asadi, PhD candidate
David R. Cheriton School of Computer Science
Non-interactive arguments are a form of cryptographic proof systems that allow a prover to convince a verifier of a statement without any interaction. They have many applications in areas such as zero-knowledge proofs, succinct proofs, and blockchain protocols. A common technique to prove they are sound is to use the random oracle model, which assumes that there exists an ideal hash function that behaves like a random function and can be queried by both parties.
In this presentation, I will briefly review some basics of non-interactive arguments. Then, I will discuss their security against quantum adversaries that can query the random oracle in superposition.
This is the second of two back-to-back seminars.