# Cryptography Reading List: Winter 2023

March 30, 2023The reading list is back! I’ve decided to follow a quarterly schedule, so you’ll see one of these posts every three months. I also realized I won’t be able to share everything (peer review, unreleased CTF challenges), but hopefully each post will provide a snapshot of my current research interests.

**Hard-core bits.** I spent some time studying the Goldreich-Levin Theorem, aka hard-core bits from one-way functions. I actually learned the proof at UCLA, but it was nice to grok the ideas from coding theory.

- Foundations of Cryptography: Volume 1, Basic Tools
- Pairwise Independence and Derandomization
- List Decoding: Algorithms and Applications

**MPC.** I’m currently working through Pragmatic MPC with a reading group, and most recently I’ve been learning about garbled circuit optimizations.

- Secure Two-Party Computation is Practical
- Fast Garbling of Circuits Under Standard Assumptions
- Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits using Half Gates
- Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits
- Garbling Gadgets for Boolean and Arithmetic Circuits

**Other stuff.**