Zero-knowledge protocols are ways of proving ‘I have this secret’ without giving it away. Example is the cave with a magic door to get through the passage and come out the other side, or something.
You can use this to prove you know a graph isomorphism:
f applied to G1. f here is the secret.f.Person X is none the wiser what function f is.
Many schemes have been proposed for identification based on the (supposed) computation intractability of various NP-complete problem types.
(Yes, that is spelt right)
This is where it goes wrong, apparently.
Stuff about finding these problems. I actually have no idea how this relates to zero knowledge proofs. I don’t think it does…
It mentions that annealing sometimes doesn’t find a solution because it can get stuck in local optimisations or whatever.
Then talks about how search techniques have computational dynamics too (e.g. timing attacks can be applied sort of to search problems. I don’t quite know how as it didn’t make sense). Apparently the process of doing the search has more information than the final state (result) of the search; to do with where the bits get stuck.
Comments
blog comments powered by Disqus