Topics

* The Fiscal Theory of the Price Level

* Prof. Cochrane’s Blog

* The Fiscal Theory, as applied to Bitcoin and Ethereum

* Blockchains as Government more broadly

* Foreign token reserves?

* Fees paid as tokenized bonds?

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 check out my blog, and you can even follow me on Twitter. (Or on Bluesky).

This is a public episode. If you would like to discuss this with other subscribers or get access to bonus episodes, visit cronokirby.substack.com

Topics:

* Why I think the subfield of cryptographic proofs is interesting and worthwhile

* Why I keep coming back and thinking about it

* Why you want machines to check proofs (eventually)

* Some ideas for a new graphical proof language for protocols

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 check out my blog, and you can even follow me on Twitter. (Or on Bluesky).

This is a public episode. If you would like to discuss this with other subscribers or get access to bonus episodes, visit cronokirby.substack.com

Topics

* Generic groups.

* A trio of interesting papers:

* To Label, or Not To Label (in Generic Groups)

* The Algebraic Group Model

* An Analysis of the Algebraic Group Model

I should also mention that Léo Ducas had some similar ideas way back in 2009

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 check out my blog, and you can even follow me on Twitter. (Or on Mastodon).

This is a public episode. If you would like to discuss this with other subscribers or get access to bonus episodes, visit cronokirby.substack.com

Topics:

* An anecdote about idealized hash functions

* https://cronokirby.com/posts/2022/04/canettis-paradoxical-encryption-scheme/

* My preliminary thoughts on developing a theory of meta-cryptography using category theory.

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 check out my blog, and you can even follow me on Twitter. (Or on Mastodon).

This is a public episode. If you would like to discuss this with other subscribers or get access to bonus episodes, visit cronokirby.substack.com

Topics:

* A little bit about MPS.

* A little bit about Cait-Sith.

* Bulletin Boards for MPC.

* Applications of the bulletin board model.

* Robust Schnorr Signatures.

* Some deception around group reconstruction circuits.

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 check out my blog, and you can even follow me on Twitter. (Or on Mastodon).

This is a public episode. If you would like to discuss this with other subscribers or get access to bonus episodes, visit cronokirby.substack.com

Topics:

* What is Threshold ECDSA again?

* What is a CAIT-SITH?

* Simulating networked benchmarks

* API design for protocol libraries

* The advantage of key-independent preprocessing

* Planned improvements

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 check out my blog, and you can even follow me on Twitter. (Or on Mastodon).

This is a public episode. If you would like to discuss this with other subscribers or get access to bonus episodes, visit cronokirby.substack.com

* 1:10 Thoughts on why AI will not cause as much economic growth as people think

* 16:10 Why ML techniques would benefit from better integration with classical techniques

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. (Or on Mastodon).

This is a public episode. If you would like to discuss this with other subscribers or get access to bonus episodes, visit cronokirby.substack.com

Topics covered in this episode:

* 1:00 Legibility, and an overview of the rest of the episode.

* 2:50 What is fully homomorphic encryption (FHE)?

* 7:28 Some applications of FHE.

* 8:15 Contrasting this with MPC.

* 11:50 Why you shouldn’t need to care about implementation details for applications.

* 14:28 Why I’m annoyed when people conflate Machine Learning and computing.

* 23:20 The legibility problem, and why these kinds of conflations are inevitable.

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. (Or on Mastodon).

This is a public episode. If you would like to discuss this with other subscribers or get access to bonus episodes, visit cronokirby.substack.com

Topics covered in this episode:

* 2:20 Why I prefer alphabetical references to numeric ones.

* 8:42 Why round complexity in MPC is of limited utility.

* 23:25 Replacing identifiable aborts with bulletin boards?

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.

This is a public episode. If you would like to discuss this with other subscribers or get access to bonus episodes, visit cronokirby.substack.com

Topics covered in this episode:

* 4:05 The basic components of a signature.

* 6:00 A primer on cryptographic groups.

* 11:52 How ECDSA works.

* 25:55 Bringing ECDSA to the threshold setting.

* 29:29 Inversion from multiplication.

* 31:50 The big approaches to multiply numbers.

* 33:22 Homomorphic encryption in a nutshell.

* 40:30 Multiplication via Oblivious Transfer in a nutshell.

* 48:21 Back of the napkin comparison of the two approaches.

* 50:19 The difficulty of getting malicious security.

* 54:00 How to implement homomorphic encryption (and why I don’t like Paillier).

* 59:40 The Paillier lineage of papers.

* [Lindell17] https://eprint.iacr.org/2017/552

* [GG18] https://eprint.iacr.org/2019/114

* [GG20] https://eprint.iacr.org/2020/540

* [CGGMP] https://eprint.iacr.org/2021/060

* 1:06:50 The Dörner paper.

* [DKLS18] https://eprint.iacr.org/2018/499

* [DKLS19] https://eprint.iacr.org/2019/523

* 1:07:57 Tweaking generic MPC to handle group operations.

* Securing DNSSEC Keys via Threshold ECDSA From Generic MPC

* https://eprint.iacr.org/2019/889

* 1:10:45 Using triples to isolate the complexity into a pre-processing phase.

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.

This is a public episode. If you would like to discuss this with other subscribers or get access to bonus episodes, visit cronokirby.substack.com