How it works: Typical zero-knowledge proofs require a demonstration of how to build what’s called a simulator, which can re-create the steps of the proof without actually knowing the secret solution. In Ilango’s new method, instead of explicitly constructing a simulator, he showed it can be enough to prove that mathematics cannot rule out the existence of such a simulator. Drawing on ideas related to mathematician Kurt Gödel’s incompleteness theorem, he designed a proof system where standard axioms of mathematics cannot demonstrate that a simulator doesn’t exist, meaning the protocol effectively preserves secrecy.
Future applications: This reframing could open new possibilities for designing cryptographic protocols that were previously impossible, experts say. If the approach holds up, effectively zero-knowledge proofs could enable more flexible privacy-preserving systems in banking, web security and building blockchains.
|
