Title: Randomness, Interaction and Zero-Knowledge Proofs

Speaker: Salil Vadhan

Abstract:

In this survey talk, I will give a theoretical computer science
perspective on the question "what is a proof?" and describe how
different answers to it play a key role in understanding the power and 
limits of efficient algorithms (e.g. the P vs. NP question).  
In particular, I will show how allowing randomness and interaction in 
their verification enables proofs to be "zero knowledge" --- 
revealing nothing other than the validity of the assertion being proven.