quantum computers can break the discreet log problem. If you have a quantum computer, then the two newer families sort of fall down. As long as you have a hash function that is post quantum secure, there's at least hope for these other family of systems based on interactive oracle proofs and similar things. There's even some theoretical substantiation of a having families based on collision resistint hashes being safe to quantum computers.
In this week’s episode, Anna catches up with Eli Ben Sasson to talk about the latest from StarkWare, the explosion of new research within the zero knowledge space and the origin of new mathematical ideas.
Recorded right after the StarkWare Sessions in tel aviv, and during a period of incredible development in new cryptographic zk techniques and protocol proposals.
Here are some of the papers and ideas we cover:
As mentioned in the intro, the Zero Knowledge Summit is happening on Oct 26th in San Francisco
If you are a dev, researcher or founder working on these topics and want to attend, please submit your application here: https://forms.gle/bZvaywbvCe2dnBkD7
Here are some impressions from the last one!
If you like what we do:
Follow us on Twitter - @zeroknowledgefm
Join us on Telegram - https://t.me/joinchat/B_81tQ57-ThZg8yOSx5gjA
Support our Gitcoin Grant - https://gitcoin.co/grants/38/zero-knowledge-podcast
Support us on Patreon - https://www.patreon.com/zeroknowledge
Or directly here:
ETH: 0xC0FFEE1B5083230a5154F55f253B6b6ae8F29B1a
BTC: 1cafekGa3podM4fBxPSQc6RCEXQNTK8Zz