Computer Science/Discrete Mathematics

Date:
Dec
09
2024

Computer Science/Discrete Mathematics Seminar I

Efficient Batch Verification: Recent Progress and Challenges
Ron Rothblum
10:30am|Simonyi 101 and Remote Access

Suppose Alice wants to convince Bob of the correctness of k NP statements. Alice could send the k witnesses to Bob, but as k grows the communication becomes prohibitive. Is it possible to convince Bob using smaller communication? This is the...