Mike Rosulek

Google (United States) — United States

Computer Science · Physical Sciences

30h-index4.2kcitations128works2.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Cryptography and Data Security(96), Privacy-Preserving Technologies in Data(41), Complexity and Algorithms in Graphs(39), Cryptographic Implementations and Security(35), Internet Traffic Analysis and Secure E-voting(15)

Publications128 total

Monitoring in the Dark: Privacy-Preserving Runtime Verification of Cyber-Physical Systems
arXiv (Cornell University)·2025Open Access
How to Tolerate Typos in Strong Asymmetric PAKE
Lecture notes in computer science·2025
Attribute-Based Signatures
2025· 8 cited
Lower Bounds for Garbled Circuits from Shannon-Type Information Inequalities
Lecture notes in computer science·2025
Verifiable Distributed Aggregation Functions
Proceedings on Privacy Enhancing Technologies·2023· 11 citedOpen Access
Malicious Secure, Structure-Aware Private Set Intersection
Lecture notes in computer science·2023· 15 cited
Topics in Cryptology – CT-RSA 2023
Lecture notes in computer science·2023· 1 citedOpen Access
A Complete Characterization of Security for Linicrypt Block Cipher Modes
2022· 2 cited
Structure-Aware Private Set Intersection, with Applications to Fuzzy Matching
Lecture notes in computer science·2022· 24 cited
Finding One Common Item, Privately
Lecture notes in computer science·2022· 2 cited
How to Obfuscate MPC Inputs
Lecture notes in computer science·2022· 2 cited
Compact and Malicious Private Set Intersection for Small Sets
2021Open Access
Subquadratic SNARGs in the Random Oracle Model.
IACR Cryptology ePrint Archive·2021
Oblivious Key-Value Stores and Amplification for Private Set Intersection.
IACR Cryptology ePrint Archive·2021· 1 cited
Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits
Lecture notes in computer science·2021· 66 cited
Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits.
IACR Cryptology ePrint Archive·2021
Oblivious Key-Value Stores and Amplification for Private Set Intersection
Lecture notes in computer science·2021· 104 cited
Batching Base Oblivious Transfers
Lecture notes in computer science·2021· 8 cited
Private Set Operations from Oblivious Switching
Lecture notes in computer science·2021· 36 cited
On the (Im)Practicality of Adversarial Perturbation for Image Privacy
Proceedings on Privacy Enhancing Technologies·2020· 42 citedOpen Access
page 1 of 7Next →

Frequent Co-authors

Payman Mohassel(11), Manoj Prabhakaran(9), Ni Trieu(8), Hemanta K. Maji(7), Peter Rindal(7), Vladimir Kolesnikov(6), Benny Pinkas(4), Gayathri Garimella(4), David Evans(3), Avishay Yanai(3), Rakesh B. Bobba(3), Charles V. Wright(3), Wu‐chi Feng(3), Tal Malkin(3), Jaspal Singh(3), Samee Zahur(2), Marshall Ball(2), Zhangxiang Hu(2), Brent Carmer(2), Ranjit Kumaresan(1)