| 2026 | EuroCrypt | Updatable Private Set Intersection from Symmetric-Key Techniques. | Junxin Liu, Peihan Miao, Mike Rosulek, Xinyi Shi, Jifeng Wang |
| 2026 | EuroCrypt | Conditionally Input-Revealing 2PC and Fuzzy Password-Authenticated Key Exchange. | David Richardson, Mike Rosulek, Jiayu Xu |
| 2025 | CRYPTO | Lower Bounds for Garbled Circuits from Shannon-Type Information Inequalities. | Jake Januzelli, Mike Rosulek, Lawrence Roy |
| 2025 | CRYPTO | How to Tolerate Typos in Strong Asymmetric PAKE. | Ian McQuoid, Mike Rosulek, Jiayu Xu |
| 2023 | CRYPTO | Malicious Secure, Structure-Aware Private Set Intersection. | Gayathri Garimella, Mike Rosulek, Jaspal Singh |
| 2022 | CRYPTO | Structure-Aware Private Set Intersection, with Applications to Fuzzy Matching. | Gayathri Garimella, Mike Rosulek, Jaspal Singh |
| 2022 | SCN | Finding One Common Item, Privately. | Tyler Beauregard, Janabel Xia, Mike Rosulek |
| 2022 | TCC | How to Obfuscate MPC Inputs. | Ian McQuoid, Mike Rosulek, Jiayu Xu |
| 2021 | ASIACRYPT | Batching Base Oblivious Transfers. | Ian McQuoid, Mike Rosulek, Lawrence Roy |
| 2021 | CCS | Compact and Malicious Private Set Intersection for Small Sets. | Mike Rosulek, Ni Trieu |
| 2021 | CRYPTO | Oblivious Key-Value Stores and Amplification for Private Set Intersection. | Gayathri Garimella, Benny Pinkas, Mike Rosulek, Ni Trieu, Avishay Yanai |
| 2021 | CRYPTO | Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits. | Mike Rosulek, Lawrence Roy |
| 2021 | PKC | Private Set Operations from Oblivious Switching. | Gayathri Garimella, Payman Mohassel, Mike Rosulek, Saeed Sadeghian, Jaspal Singh |
| 2020 | CCS | Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions. | Ian McQuoid, Mike Rosulek, Lawrence Roy |
| 2020 | CCS | Fast Database Joins and PSI for Secret Shared Data. | Payman Mohassel, Peter Rindal, Mike Rosulek |
| 2020 | EuroCrypt | PSI from PaXoS: Fast, Malicious Private Set Intersection. | Benny Pinkas, Mike Rosulek, Ni Trieu, Avishay Yanai |
| 2019 | ASIACRYPT | Scalable Private Set Union from Symmetric-Key Techniques. | Vladimir Kolesnikov, Mike Rosulek, Ni Trieu, Xiao Wang |
| 2019 | CCS | Secure Data Exchange: A Marketplace in the Cloud. | Ran Gilad-Bachrach, Kim Laine, Kristin E. Lauter, Peter Rindal, Mike Rosulek |
| 2019 | CRYPTO | SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension. | Benny Pinkas, Mike Rosulek, Ni Trieu, Avishay Yanai |
| 2019 | NDSS | Balancing Image Privacy and Usability with Thumbnail-Preserving Encryption. | Kimia Tajik, Akshith Gunasekaran, Rhea Dutta, Brandon Ellis, Rakesh B. Bobba, Mike Rosulek, Charles V. Wright, Wu-chi Feng |
| 2019 | TCC | Characterizing Collision and Second-Preimage Resistance in Linicrypt. | Ian McQuoid, Trevor Swope, Mike Rosulek |
| 2018 | CCS | TACHYON: Fast Signatures from Compact Knapsack. | Rouzbeh Behnia, Muslum Ozgur Ozmen, Attila A. Yavuz, Mike Rosulek |
| 2018 | CRYPTO | Optimizing Authenticated Garbling for Faster Secure Two-Party Computation. | Jonathan Katz, Samuel Ranellucci, Mike Rosulek, Xiao Wang |
| 2018 | FC | SWiM: Secure Wildcard Pattern Matching from OT Extension. | Vladimir Kolesnikov, Mike Rosulek, Ni Trieu |
| 2018 | TCC | On the Structure of Unconditional UC Hybrid Protocols. | Mike Rosulek, Morgan Shirley |
| 2017 | CCS | Practical Multi-party Private Set Intersection from Symmetric-Key Techniques. | Vladimir Kolesnikov, Naor Matania, Benny Pinkas, Mike Rosulek, Ni Trieu |
| 2017 | CCS | DUPLO: Unifying Cut-and-Choose for Garbled Circuits. | Vladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu, Roberto Trifiletti |
| 2017 | CCS | Approximate Thumbnail Preserving Encryption. | Byron Marohn, Charles V. Wright, Wu-chi Feng, Mike Rosulek, Rakesh B. Bobba |
| 2017 | CCS | Malicious-Secure Private Set Intersection via Dual Execution. | Peter Rindal, Mike Rosulek |
| 2017 | EuroCrypt | Non-interactive Secure 2PC in the Offline/Online and Batch Settings. | Payman Mohassel, Mike Rosulek |
| 2017 | EuroCrypt | Sublinear Zero-Knowledge Arguments for RAM Programs. | Payman Mohassel, Mike Rosulek, Alessandra Scafuro |
| 2017 | EuroCrypt | Improved Private Set Intersection Against Malicious Adversaries. | Peter Rindal, Mike Rosulek |
| 2017 | INDOCRYPT | Improvements for Gate-Hiding Garbled Circuits. | Mike Rosulek |
| 2016 | CCS | Garbling Gadgets for Boolean and Arithmetic Circuits. | Marshall Ball, Tal Malkin, Mike Rosulek |
| 2016 | CCS | Efficient Batched Oblivious PRF with Applications to Private Set Intersection. | Vladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, Ni Trieu |
| 2016 | CRYPTO | Linicrypt: A Model for Practical Cryptography. | Brent Carmer, Mike Rosulek |
| 2015 | CCS | Fast and Secure Three-party Computation: The Garbled Circuit Approach. | Payman Mohassel, Mike Rosulek, Ye Zhang |
| 2015 | CRYPTO | Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost. | Zhangxiang Hu, Payman Mohassel, Mike Rosulek |
| 2015 | EuroCrypt | How to Efficiently Evaluate RAM Programs with Malicious Security. | Arash Afshar, Zhangxiang Hu, Payman Mohassel, Mike Rosulek |
| 2015 | EuroCrypt | Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates. | Samee Zahur, Mike Rosulek, David Evans |
| 2015 | FIE | Vamonos: Embeddable visualizations of advanced algorithms. | Brent Carmer, Mike Rosulek |
| 2015 | TCC | Richer Efficiency/Security Trade-offs in 2PC. | Vladimir Kolesnikov, Payman Mohassel, Ben Riva, Mike Rosulek |
| 2014 | CRYPTO | FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR. | Vladimir Kolesnikov, Payman Mohassel, Mike Rosulek |
| 2013 | EuroCrypt | Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction. | S. Dov Gordon, Tal Malkin, Mike Rosulek, Hoeteck Wee |
| 2013 | TCC | Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities. | R. Amzi Jeffs, Mike Rosulek |
| 2012 | CRYPTO | Must You Know the Code of f to Securely Compute f? | Mike Rosulek |
| 2012 | CRYPTO | Universal Composability from Essentially Any Trusted Setup. | Mike Rosulek |
| 2012 | INDOCRYPT | A Unified Characterization of Completeness and Triviality for Secure Function Evaluation. | Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek |
| 2011 | TCC | Exploring the Limits of Common Coins Using Frontier Analysis of Protocols. | Hemanta K. Maji, Pichayoot Ouppaphan, Manoj Prabhakaran, Mike Rosulek |
| 2010 | CRYPTO | A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security. | Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek |
| 2009 | TCC | Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation. | Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek |
| 2008 | ASIACRYPT | Towards Robust Computation on Encrypted Data. | Manoj Prabhakaran, Mike Rosulek |
| 2008 | CRYPTO | Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations. | Manoj Prabhakaran, Mike Rosulek |
| 2008 | ICALP | Homomorphic Encryption with CCA Security. | Manoj Prabhakaran, Mike Rosulek |
| 2007 | CRYPTO | Rerandomizable RCCA Encryption. | Manoj Prabhakaran, Mike Rosulek |