Get the latest tech news
Computer scientists combine two 'beautiful' proof methods
Three researchers have figured out how to craft a proof that spreads out information while keeping it perfectly secret.
In a paper that marks the culmination of seven years of work, Gur and two other computer scientists have finally combined the ideal versions of the two kinds of proof for an important class of problems. Goldwasser and Micali answered their own question with a resounding yes by inventing zero-knowledge proofs in a seminal 1985 paper, co-authored with the University of Toronto computer scientist Charles Rackoff. Then in 2017, a Berkeley graduate student named Nicholas Spooner(who’s now at Cornell University) began to suspect that techniques he’d helped develop for a related problem might also be useful for building perfect zero-knowledge PCPs.
Or read this on Hacker News
