Joint Theory Lunch Seminar / Computer Science Speaking Skills Talk
— 1:00pm
Location:
In Person
-
Gates Hillman 8102
Speaker:
ABHIRAM KOTHAPALLI
,
Ph.D. Student, Computer Science Department, Carnegie Mellon University
https://abhiramkothapalli.github.io/
Nova: Recursive Zero-Knowledge Arguments from Folding Schemes
Zero-knowledge proofs are a powerful cryptographic technique for demonstrating the correctness of computations without revealing any secret inputs. Modern applications are beginning to employ recursive zero-knowledge proofs (proofs that demonstrate the existence of other proofs) due to their distinct ability to prove stateful computations with dynamic control flow.
For instance, one can prove large statements such as “the current state of the blockchain is valid” by proving that “there exists a proof for the previous state of the blockchain and the most recent update is valid”. Recursive proofs can similarly be utilized to incrementally prove the correct execution of delay functions, virtual machines, transparency dictionaries, and distributed computations.
Presented as part of the Theory Lunch Seminar
Presented in Partial Fulfillment of the CSD Speaking Skills Requirement
Event Website:
https://www.cs.cmu.edu/~theorylunch/