August 5th, 2020 | 1 hr 2 mins
3 body problem, blockchain, blockchain game, ethereum, learning group, privacy, technology, video game, zero knowledge, zksnarks
In this week's episode, we chat with Brian Gu, a student at MIT and creator of the Dark Forest game. We chat about education in the space, blockchain based games and how Dark Forest was inspired. We then dig into how this game creates an incomplete information game space by using zkSNARKs to create a “cryptographic fog of war” and more!
July 22nd, 2020 | 56 mins 30 secs
blockchain, crypto, cryptography, findora, privacy tech, supersonic, zero knowledge, zkps
This week, we catch up with Benedikt Bunz and Ben Fisch, PhD students at Stanford, once again. In this episode, we dive deeper into Findora, a project that was co-founded by Ben (who is also the CTO) and where Benedikt works as the Head of Research. We look at what the Findora project is, discuss the "selective disclosure" concept at the heart of their constructions, explore the balance between transparency and privacy and describe what problems Findora aims to solve.
July 8th, 2020 | 29 mins 2 secs
blockchain, learning group, powers of tau, privacy, snarks, technology, trusted setup, zero knowledge
In this week's episode, Anna follows up on the trusted setup survey she did in her previous episode on the topic with this bonus interview with Tornado Cash. Tornado Cash's trusted setup, held in May 2020, was the largest to date with over 1000 participants.
April 15th, 2020 | 1 hr 4 mins
cryptography, european privacy, mixnets, nym, privacy technology, privacy-preserving, zero knowledge
In this episode, Anna catches up with Claudia Diaz, professor at KU Leuven and the Chief Science Officer at Nym Technology to learn about mixnets, the history of privacy technology and how there may be some opportunities for new privacy tech to emerge in this post-pandemic world.
April 8th, 2020 | 1 hr 4 mins
cryptography, fhe, homomorphic encryption, ibm research, mpc, technology, zero knowledge
In this episode, we chat with Flavio Bergamaschi from IBM research about his work on Fully Homomorphic Encryption (FHE). FHE allows for computation on encrypted data. First developed in 2009 at IBM, this tech has long been the considered only theoretically possible. However, as we learn in the interview, there have been strides made in the last few years and we are starting to see FHE technology being used in some real world applications.
April 1st, 2020 | 1 hr 8 mins
ecc, electric coin company, halo, recursive snarks, trusted setup, zcash, zero knowledge
In this episode, we catch up with Sean Bowe and Daira Hopwood from the Electric Coin Company (ECC) to chat about Halo, a recursive proof composition that doesn't require a trusted setup. We cover the efficiency techniques used in Halo such as "nested amortization", how the protocol was developed, what some of the key findings are, and how it fits in with the other recent SNARK-based protocols.
March 25th, 2020 | 54 mins 2 secs
blockchain, cryptographic vulnerability, cryptography, security, technical audit, whitepaper, zero knowledge
In this week's episode, we chat with Benjamin Perez from Trail of Bits about the evolution of the crypto tech auditing business, the new challenges that emerge in zero knowledge proof systems regarding security, some of the recent bugs and vulnerabilities found in zkp systems and more!
March 4th, 2020 | 1 hr 1 min
cryptography, isogenies, multi-party computation, polkadot, web3 foundation, zero knowledge, zero knowledge proofs
In this week's episode, we sit down with Alistair Stewart and Jeff Burges, researchers at the Web3 Foundation, to dig into what they are working on, what they are thinking about at the moment, and how zero knowledge proofs can be used throughout the Polkadot ecosystem.
January 29th, 2020 | 50 mins 51 secs
cryptography, fractal protocol, math, recursive snarks, uc berkeley, zero knowledge, zksnarks
This week, we explore the Fractal transparent SNARK construction with its authors Dev Ojha and Nick Spooner - both students of Alessandro Chiesa at UC Berkeley. In this episode, We explore how Fractal works, how it improves on some of the earlier work on Sonic and Marlin, how it borrows from but differentiates itself from STARKs, as well as what they discovered while working on this paper about recursive SNARKs and what makes that property possible.
January 15th, 2020 | 55 mins 29 secs
aztec protocol, cryptography, lagrange-bases, plonk, polynomial commitments, zero knowledge
In this week’s episode, we learn more about Plonk with Ariel Gabizon and Zac Williamson from Aztec. PLONK is an efficient, universal SNARK construction. We explore what distinguishes Plonk from some other other new constructions including their focus on Lagrange-bases to deconstruct complex problem statements into simple polynomial identities.