Author-hosted primer dated30June2008. Sections1.1.2–1.2, printedpp.6–8, give prover/verifier and quantified completeness/soundness definitions; Construction1.3, pp.9–10, gives the random-relabeling graph-non-isomorphism protocol. Construction2.3 and its following simulation discussion, printedpp.26–28, treat graph-isomorphism zero knowledge; section2.3, pp.32–34, treats proofs of knowledge.

Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3. Home

Incoming links (8)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version