Ro's HomepageHi, I'm Rohit (or Ro)!
I'm a PhD candidate in the Applied Cryptography Group at Stanford University, advised by Dan Boneh.
I'm broadly interested in applied zero-knowledge proofs, advanced encryption schemes, and multi-party computation. Feel free to explore my work below!
Prior to this, I majored in computer science and mathematics at UCLA, where I was fortunate to be mentored by Rafail Ostrovsky.
See what else I've been up to on my personal page.
Publications & Preprints
Efficient Batch Threshold Encryption Using Partial Fraction Techniques
CRYPTO 2026Dan Boneh, Rohit Nema, Arnab Roy, Ertem Nusret Tas
Partial Fraction Techniques for Cryptography
EUROCRYPT 2026Charanjit S. Jutla, Rohit Nema, Arnab Roy
Linear Secret-shared Shuffle with Malicious Security
CRYPTO 2026Samuel Dittmer, Rohit Nema, Rafail Ostrovsky
Game of Trust: How Trustworthy Does Your Blockchain Think You Are?
Petros Drineas, Rohit Nema, Rafail Ostrovsky, Vassilis Zikas
Linear-time 2-party secure merge from additively homomorphic encryption
JCSS 2023Brett Hemenway Falk, Rohit Nema, Rafail Ostrovsky
A Linear-Time 2-Party Secure Merge Protocol
CSCML 2022Brett Hemenway Falk, Rohit Nema, Rafail Ostrovsky
Teaching
CS 355: Advanced Topics in Cryptography
Instructor Spring 2026Upper undergraduate or graduate course in cryptography. Covers several topics such as foundations, cryptanalysis, elliptic curves, zero-knowledge proofs, multi-party computation, lattices, et cetera. Formal security definitions and proofs. Co-taught with Trisha Datta and Aditi Partap.
CS 355: Applied Zero Knowledge Proofs
Assistant Spring 2025In-depth coverage of how SNARKs work and how to use them in practice. Problem sets and programming assignment. Co-organized recitation to strengthen topics covered in class.
CS 355: Advanced Topics in Cryptography
Assistant Spring 2024