Is the approach analogous to one way hash? But with mathematical statements?
Given that they can’t be proven, so it’s effectively unpredictable and “un-generatable” ?
zb3 [3 hidden]5 mins ago
> to create a powerful new tool in cryptography.
What is that new powerful tool in cryptography, then?
> He wanted to build zero-knowledge proofs that weren’t interactive. Thirty years earlier, Goldreich and Oren had established that such proofs are impossible.
I'm not sure what "interactive" means here, but I thought ZK-SNARKs were already non-interactive.
It seems the article has nothing to do with anything practical..
newsicanuse [3 hidden]5 mins ago
Typical of Quanta magazine
HoldOnAMinute [3 hidden]5 mins ago
How is this not security through obscurity?
majorchord [3 hidden]5 mins ago
If math is STO then I would argue passwords are also STO.
HN.zip
Given that they can’t be proven, so it’s effectively unpredictable and “un-generatable” ?
What is that new powerful tool in cryptography, then?
> He wanted to build zero-knowledge proofs that weren’t interactive. Thirty years earlier, Goldreich and Oren had established that such proofs are impossible.
I'm not sure what "interactive" means here, but I thought ZK-SNARKs were already non-interactive.
It seems the article has nothing to do with anything practical..
It's only secure until someone figures it out.