# graph isomorphism Published articles for graph isomorphism. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## Zero-Knowledge: Definitions and Theory DevFeed: [Zero-Knowledge: Definitions and Theory]() Original publisher: [Read original article]() Published: 2016-09-19T09:00:00Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Zero-knowledge proof](), [Graphs](), [Protocol (disambiguation)](), [class]() Tags: [graph-isomorphism](), [np](), [permutation](), [protocol](), [theory](), [zero-knowledge]() ### AI overview This article explains definitions and theory behind zero-knowledge proofs. It contrasts graph isomorphism and 3-coloring protocols, focusing on their interaction between prover and verifier, cryptographic assumptions, transcript distributions, and simulation. ### Source excerpt The next Monday, when the fathers were all back at work, we kids were playing in a field. One kid says to me, "See that bird? What kind of bird is that?" I said, "I haven't the slightest idea what kind of a bird it is." He says, "It's a brown-throated thrush. Your father doesn't teach you anything!" But it was the opposite. He had already taught me: "See that bird? ## Zero Knowledge Proofs for NP DevFeed: [Zero Knowledge Proofs for NP]() Original publisher: [Read original article]() Published: 2016-08-01T08:00:53Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Zero-knowledge proof](), [zero-knowledge](), [Cryptography](), [Algorithms](), [Code]() Tags: [algorithm](), [boolean](), [circuit](), [computational-complexity](), [cryptography](), [graph-isomorphism](), [interactive](), [mathematics](), [np](), [np-hard](), [one-way-functions](), [programming](), [python](), [random-number-generators](), [variables](), [zero-knowledge]() ### AI overview This tutorial explains how zero-knowledge proofs extend beyond graph isomorphism to problems in NP, using cryptography to let a prover convince a verifier without revealing the secret knowledge behind the claim. It introduces examples including boolean formulas, subset sums, graph 3-coloring, and boolean circuits, and describes an implementation of a proof for graph 3-colorability. ### Source excerpt Last time, we saw a specific zero-knowledge proof for graph isomorphism. This introduced us to the concept of an interactive proof, where you have a prover and a verifier sending messages back and forth, and the prover is trying to prove a specific claim to the verifier. A zero-knowledge proof is a special kind of interactive proof in which the prover has some secret piece of knowledge that makes it very easy to verify a disputed claim is true. ## Zero Knowledge Proofs -- A Primer DevFeed: [Zero Knowledge Proofs -- A Primer]() Original publisher: [Read original article]() Published: 2016-07-05T08:00:29Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Zero-knowledge proof](), [zero-knowledge](), [Graphs](), [Algorithm]() Tags: [algorithm](), [complexity-theory](), [cryptography](), [graph](), [graph-isomorphism](), [mathematics](), [programming](), [python](), [simulator](), [zero-knowledge]() ### AI overview This primer explains zero-knowledge proofs through the graph isomorphism problem. It introduces the roles of the prover, verifier, and simulator, and describes graph isomorphism using vertex-label permutations. ### Source excerpt In this post we'll get a strong taste for zero knowledge proofs by exploring the graph isomorphism problem in detail. In the next post, we'll see how this relates to cryptography and the bigger picture. The goal of this post is to get a strong understanding of the terms "prover," "verifier," and "simulator," and "zero knowledge" in the context of a specific zero-knowledge proof. Then next time we'll see how the same concepts (though not the same proof) generalizes to a cryptographically interesting setting. ## A Quasipolynomial Time Algorithm for Graph Isomorphism: The Details DevFeed: [A Quasipolynomial Time Algorithm for Graph Isomorphism: The Details]() Original publisher: [Read original article]() Published: 2015-11-12T09:00:00Z Content type: article Language: en Sources: [Jeremy Kun]() Topics: [Graphs](), [Algorithms, Complexity](), [graph theory](), [Computer science](), [math]() Tags: [algorithm](), [automorphism-groups](), [babai](), [breakthrough](), [complexity](), [computer-science](), [divide-and-conquer](), [graph-isomorphism](), [group-theory](), [johnson-graph](), [mathematics](), [permutation-groups](), [quasipolynomial](), [research]() ### AI overview This research-level blog post explains Laszlo Babai's claimed quasipolynomial-time algorithm for the Graph Isomorphism problem. Later updates report that an error was found, changing the result to sub-exponential time, followed by a claimed workaround restoring the quasipolynomial-time claim. ### Source excerpt Update 2017-01-09: Laci claims to have found a workaround to the previously posted error, and the claim is again quasipolynoimal time! Updated arXiv paper to follow. Update 2017-01-04: Laci has posted an update on his paper. The short version is that one small step of his analysis was not quite correct, and the result is that his algorithm is sub-exponential, but not quasipolynomial time. The fact that this took over a year to sort out is a testament to the difficulty of the mathematics and the skill of the mathematicians involved.