
Sign up to save your podcasts
Or


Topics covered in this episode:
* 1:42 Introduction to Zero-Knowledge Proofs.
* 7:07 What MPC in the head achieves, at a high level.
* 14:35 The efficiency of MPC in the head.
* 15:56 What is “MPC” anyways?
* 18:37 How MPC in the head works, at a high level.
* 20:38 An overview of the IKOS paper: the one that started it all.
* https://web.cs.ucla.edu/~rafail/PUBLIC/77.pdf (2007)
* “Zero-Knowledge from Secure Multiparty Computation” - Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai
* 31:05 The ZKBoo paper: making MPC in the head practical.
* https://eprint.iacr.org/2016/163
* “ZKBoo: Faster Zero-Knowledge for Boolean Circuits“ - Irene Giacomelli, Jesper Madsen, and Claudio Orlandi
* My implementation of ZKBoo: https://github.com/cronokirby/boo-hoo
* 41:22 The KKW paper: adding pre-processing to simulated MPC.
* https://eprint.iacr.org/2018/475
* “Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures” - Jonathan Katz, Vladimir Kolesnikov, and Xiao Wang
* 48:32 The core idea of the Limbo paper: verifying execution traces.
* https://eprint.iacr.org/2021/215
* “Limbo: Efficient Zero-knowledge MPCitH-based Arguments“ - Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, and Titouan Tanguy
* 51:07 What distinguishes Ligero from other MPC in the head systems: Sqrt(N) complexity.
* https://acmccs.github.io/papers/p2087-amesA.pdf
* “Ligero: Lightweight Sublinear Arguments without a trusted setup” - Scott Ames, Carmit Hazy, Yuval Ishai, an dMuthuramakrishnan Venkitasubramaniam
* 54:10 The “Rambo” paper: how to add RAM to ZK proof programs.
* https://eprint.iacr.org/2022/313.pdf
* “Efficient Proof of RAM Programs from Any Public-CoinZero-Knowledge System” - Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Titouan Tanguy, and Michiel Verbauwhede
* 1:03:10 My project, Rem-Boo
* https://github.com/cronokirby/rem-boo
If you enjoyed this episode, and want to get notified when the next one arrives, feel free to subscribe:
If you want even more updates, feel free to follow me on Twitter.
Topics in this episode:
* The recent breakage of SIDH
* https://ellipticnews.wordpress.com/2022/07/31/breaking-supersingular-isogeny-diffie-hellman-sidh/
* https://eprint.iacr.org/2022/975
* A taxonomy of different cryptographic constructions
* What constructions are better suited for standards? What about software?
* Why is it hard to provide protocols as a library?
* Why threat modelling and security properties will always be important
If you enjoyed this episode, and want to get notified when the next one arrives, feel free to subscribe:
If you want even more updates, feel free to follow me on Twitter.
Topics in this episode:
* The emerging threat of quantum computers and their impact on Cryptography
* How NIST’s standardization process works, briefly, and why you don’t need to trust NIST at all.
* How you might upgrade messaging protocols to the Post-Quantum age
* Implementing Post-Quantum key exchanges with deniable signatures
* How much metadata can a centralized E2E messaging server record?
If you enjoyed this episode, and want to get notified when the next one arrives, feel free to subscribe:
If you want even more updates, feel free to follow me on Twitter.
Topics in this episode
* Papers with long appendices
* Adding a boolean circuit backend to LLVM
* Composing STARKs with SNARKs, and how this compares to MPC in the head
If you enjoyed this episode, and want to get notified when the next one arrives, feel free to subscribe:
If you want even more updates, feel free to follow me on Twitter.
From the publisher's feed