Error Correcting Codes & Information Theory with Ron Rothblum
Zero Knowledge
00:00
The Limits of Hash Functions
In the early work, we needed to assume that some sort of encryption scheme was optimally hard. Nowadays, we can based it on an assumption called learning with errors. The thing I was curious as an innocent theoretician is what can we say about Boolean circuits? Right? So we have hash functions, SHA or whatnot that are natively described asBoolean circuits. And in this setting, they indeed achieved a linear time prover.
Transcript
Play full episode
