👨🏽‍🎓 Short Bio

I’m a PhD student in Computer Science at UC Berkeley. I’m very fortunate to be advised by Sanjam Garg.

Mission. I believe privacy should be a given, not something people need to actively assess or manage. I want to make privacy-preserving technology accessible to all by designing and building tools with privacy at their core.

Research interests. I mostly work on secure messaging, though I’m broadly interested in the theory and application of cryptographic protocols. Beyond secure messaging, I’ve looked into practical secret sharing and blockchain forensics.

Feel free to email me at fairoze@berkeley.edu!

📢 News

May 19, 2022: Our paper on the security of the Double Ratchet will appear at CRYPTO 2022!
Apr 25, 2022: Our paper on MEV extraction on Ethereum will appear at WEIS 2022!
Apr 17, 2022: I’ll be interning with Microsoft’s Cryptography and Privacy group over the summer!

Old News

Sep 15, 2021: Our paper on robust asynchronous secret sharing will appear at NDSS 2022!
Apr 7, 2021: I’ll be starting my PhD in Computer Science at UC Berkeley in August!
Feb 17, 2021: Our paper on robust asynchronous secret sharing is up on ePrint.

📝 Papers

A More Complete Analysis of the Signal Double Ratchet Algorithm [pdf]
Alexander Bienstock, Jaiden Fairoze, Sanjam Garg, Pratyay Mukherjee, and Srinivasan Raghuraman
Annual International Cryptology Conference (CRYPTO), Aug 2022.

Extracting Godl [sic] from the Salt Mines: Ethereum Miners Extracting Value [pdf]
Julien Piet, Jaiden Fairoze, and Nicholas Weaver
Workshop on the Economics of Information Security (WEIS), Jun 2022.

hbACSS: How to Robustly Share Many Secrets [pdf]
Thomas Yurek, Licheng Luo, Jaiden Fairoze, Aniket Kate, and Andrew Miller
Network and Distributed System Security Symposium (NDSS), Feb 2022.

Clone Detection in Secure Messaging: Improving Post-Compromise Security in Practice [pdf]
Cas Cremers, Jaiden Fairoze, Benjamin Kiesl, and Aurora Naska
Conference on Computer and Communications Security (CCS), Nov 2020.