Talk:Zero-knowledge proof

From CRYPTUTOR

• Along with completeness and soundness, list zero-knowledge property. Describe the definition of the zero-knowledge property (for all adversaries, there exists a simulator, ...). Say that in the standard notion of ZK proofs, the setting used is of standalone security.
• Say the when L corresponds to a "verifiable property", the language L is an NP language.
• In the graph 3-coloring example: say it is an NP-complete problem; while describing the protocol point to commitment article; describe why the protocol is zero-knowledge (Bob just sees two random distinct colors).