You are currently browsing the tag archive for the 'Graph Isomorphism' tag.
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.
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 protocol for proving quadratic residuosity. (We shall prove that the protocol is zero knowledge next time.)
Summary
Today we introduce the notion of zero knowledge proof and design a zero knowledge protocol for the graph isomorphism problem.
Recent Comments