Clik here to view.
CS276 Lecture 24 (draft)
Summary Today we introduce the notion of zero knowledge proof and design a zero knowledge protocol for the graph isomorphism problem. 1. Intuition A zero knowledge proof is a proof between two...
View ArticleClik here to view.
CS276 Lecture 25 (draft)
Summary Today we show that the graph isomorphism protocol we defined last time is indeed a zero-knowledge protocol. Then we discuss the quadratic residuosity problem modulo a composite, and define a...
View ArticleClik here to view.
CS276 Lecture 24: Zero Knowledge Protocols
Scribed by Milosh Drezgich Summary Today we introduce the notion of zero knowledge proof and design a zero knowledge protocol for the graph isomorphism problem. 1. Intuition A zero knowledge proof is...
View ArticleClik here to view.
Laci Babai and Graph Isomorphism
Next Tuesday, a week from today, Laci Babai will talk at the University of Chicago about a new algorithm that solves graph isomorphism in quasipolynomial time. There should also be a follow-up talk the...
View ArticleClik here to view.
What does it mean when it’s hard to find hard instances?
[In the provincial spirit of Italian newspapers, that often have headlines like “Typhoon in South-East Asia causes widespread destruction; what are the consequences for Italian exports?”, and of men...
View Article
