4 ms·
I first heard of ZKPs in the context of mathematical theorems rather than cryptographic protocols, probably sometime in the late '80s I think and probably from
by tzs 5y ago
I first heard of ZKPs in the context of mathematical theorems rather than cryptographic protocols, probably sometime in the late '80s I think and probably from an article in the MAA's "Focus" magazine.
If I remember correctly the article said that it is possible for any given mathematical theorem and proof it is possible to produce a graph such that (1) the proof is correct if and only if the graph has a Hamiltonian circuit, and (2) you can show people the graph and prove to them that it is such a graph for that theorem.
The article then gave a ZKP scheme for showing that you know a Hamiltonian circuit on a given graph.
Putting it all together then someone who claimed to have a proof of the Riemann Hypothesis or Goldbach's Conjecture or any other famous unsolved mathematical problem could produce the corresponding graph, and produce a ZKP that they know a Hamiltonian circuit for that graph, and we'd have to accept that they have in fact solved the problem.
I wonder what would happen if someone actually did that for one of the Millennium Prize Problems [1] or some other high profile problem that has a substantial reward behind it? When offering prizes for proofs nowadays should you include a clause in the rules that states to win the prize you have to publish a conventional proof?
[1] https://en.wikipedia.org/wiki/Millennium_Prize_Problems https://en.wikipedia.org/wiki/Millennium_Prize_Problems