Harvesting credentials in trust negotiation as an honest-but-curious adversary. - Lars E. Olson 001; Michael J. Rosulek; Marianne Winslett (WPES, 2007)

Rerandomizable RCCA Encryption. - Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 2007)

Towards Robust Computation on Encrypted Data. - Manoj Prabhakaran 001; Mike Rosulek (ASIACRYPT, 2008)

Cryptographic Complexity of Multi-party Computation Problems: Classifications and Separations. - Manoj Prabhakaran 001; Mike Rosulek (Electron. Colloquium Comput. Complex., 2008)

Attribute-Based Signatures: Achieving Attribute-Privacy and Collusion-Resistance. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 2008)

Complexity of Multiparty Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 2008)

Homomorphic Encryption with CCA Security. - Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 2008)

Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (TCC, 2009)

Cryptographic Complexity Classes and Computational Intractability Assumptions. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (Electron. Colloquium Comput. Complex., 2009)

The Structure of Secure Multi-Party Computation - Michael J. Rosulek (2009)

A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (CRYPTO, 2010)

A Zero-One Law for Deterministic 2-Party Secure Computation. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 2010)

Attribute-Based Signatures. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 2010)

Exploring the Limits of Common Coins Using Frontier Analysis of Protocols. - Hemanta K. Maji; Pichayoot Ouppaphan; Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 2011)

Universal Composability from Essentially Any Trusted Setup. - Mike Rosulek (IACR Cryptol. ePrint Arch., 2011)

A Unified Characterization of Completeness and Triviality for Secure Function Evaluation. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (INDOCRYPT, 2012)

Must you know the code of f to securely compute f? - Mike Rosulek (IACR Cryptol. ePrint Arch., 2012)

Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities. - R. Amzi Jeffs; Mike Rosulek (TCC, 2013)

Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction. - S. Dov Gordon; Tal Malkin; Mike Rosulek; Hoeteck Wee (IACR Cryptol. ePrint Arch., 2013)

Complexity of Multi-Party Computation Functionalities. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (IACR Cryptol. ePrint Arch., 2013)

Complexity of Multi-Party Computation Functionalities. - Hemanta K. Maji; Manoj Prabhakaran 001; Mike Rosulek (Secure Multi-Party Computation, 2013)

How to Efficiently Evaluate RAM Programs with Malicious Security. - Arash Afshar; Zhangxiang Hu; Payman Mohassel; Mike Rosulek (IACR Cryptol. ePrint Arch., 2014)

FleXOR: Flexible garbling for XOR gates that beats free-XOR. - Vladimir Kolesnikov; Payman Mohassel; Mike Rosulek (IACR Cryptol. ePrint Arch., 2014)

Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits using Half Gates. - Samee Zahur; Mike Rosulek; David Evans 001 (IACR Cryptol. ePrint Arch., 2014)

Vamonos: Embeddable visualizations of advanced algorithms. - Brent Carmer; Mike Rosulek (FIE, 2015)

Secure Your Data and Compute on It, Too. - Mike Rosulek (XRDS, 2015)

Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized Cost. - Zhangxiang Hu; Payman Mohassel; Mike Rosulek (IACR Cryptol. ePrint Arch., 2015)

Richer Efficiency/Security Trade-offs in 2PC. - Vladimir Kolesnikov; Payman Mohassel; Ben Riva; Mike Rosulek (IACR Cryptol. ePrint Arch., 2015)

Fast and Secure Three-party Computation: The Garbled Circuit Approach. - Payman Mohassel; Mike Rosulek; Ye Zhang (IACR Cryptol. ePrint Arch., 2015)

Faster Malicious 2-Party Secure Computation with Online/Offline Dual Execution. - Peter Rindal; Mike Rosulek (USENIX Security Symposium, 2016)

Garbling Gadgets for Boolean and Arithmetic Circuits. - Marshall Ball; Tal Malkin; Mike Rosulek (IACR Cryptol. ePrint Arch., 2016)

Linicrypt: A Model for Practical Cryptography. - Brent Carmer; Mike Rosulek (IACR Cryptol. ePrint Arch., 2016)

Secure Data Exchange: A Marketplace in the Cloud. - Ran Gilad-Bachrach; Kim Laine; Kristin E. Lauter; Peter Rindal; Mike Rosulek (IACR Cryptol. ePrint Arch., 2016)

Efficient Batched Oblivious PRF with Applications to Private Set Intersection. - Vladimir Kolesnikov; Ranjit Kumaresan; Mike Rosulek; Ni Trieu (IACR Cryptol. ePrint Arch., 2016)

Faster Malicious 2-party Secure Computation with Online/Ofine Dual Execution. - Peter Rindal; Mike Rosulek (IACR Cryptol. ePrint Arch., 2016)

Improved Private Set Intersection against Malicious Adversaries. - Peter Rindal; Mike Rosulek (IACR Cryptol. ePrint Arch., 2016)

Efficient Maliciously Secure Two Party Computation for Mixed Programs. - Arash Afshar; Payman Mohassel; Mike Rosulek (IACR Cryptol. ePrint Arch., 2017)

Practical Multi-party Private Set Intersection from Symmetric-Key Techniques. - Vladimir Kolesnikov; Naor Matania; Benny Pinkas; Mike Rosulek; Ni Trieu (IACR Cryptol. ePrint Arch., 2017)

DUPLO: Unifying Cut-and-Choose for Garbled Circuits. - Vladimir Kolesnikov; Jesper Buus Nielsen; Mike Rosulek; Ni Trieu; Roberto Trifiletti (IACR Cryptol. ePrint Arch., 2017)

SWiM: Secure Wildcard Pattern Matching From OT Extension. - Vladimir Kolesnikov; Mike Rosulek; Ni Trieu (IACR Cryptol. ePrint Arch., 2017)

Approximate Thumbnail Preserving Encryption. - Byron Marohn; Charles V. Wright; Wu-chi Feng; Mike Rosulek; Rakesh B. Bobba (IACR Cryptol. ePrint Arch., 2017)

Non-Interactive Secure 2PC in the Offline/Online and Batch Settings. - Payman Mohassel; Mike Rosulek (IACR Cryptol. ePrint Arch., 2017)

Sublinear Zero-Knowledge Arguments for RAM Programs. - Payman Mohassel; Mike Rosulek; Alessandra Scafuro (IACR Cryptol. ePrint Arch., 2017)

Malicious-Secure Private Set Intersection via Dual Execution. - Peter Rindal; Mike Rosulek (IACR Cryptol. ePrint Arch., 2017)

Improvements for Gate-Hiding Garbled Circuits. - Mike Rosulek (IACR Cryptol. ePrint Arch., 2017)

On the Structure of Unconditional UC Hybrid Protocols. - Mike Rosulek; Morgan Shirley (IACR Cryptol. ePrint Arch., 2017)

Reconciling Non-malleability with Homomorphic Encryption. - Manoj Prabhakaran 001; Mike Rosulek (J. Cryptol., 2017)

A Pragmatic Introduction to Secure Multi-Party Computation. - David Evans 001; Vladimir Kolesnikov; Mike Rosulek (Found. Trends Priv. Secur., 2018)

TACHYON: Fast Signatures from Compact Knapsack. - Rouzbeh Behnia; Muslum Ozgur Ozmen; Attila A. Yavuz; Mike Rosulek (IACR Cryptol. ePrint Arch., 2018)

Optimizing Authenticated Garbling for Faster Secure Two-Party Computation. - Jonathan Katz; Samuel Ranellucci; Mike Rosulek; Xiao Wang 012 (IACR Cryptol. ePrint Arch., 2018)

Characterizing Collision and Second-Preimage Resistance in Linicrypt. - Ian McQuoid; Trevor Swope; Mike Rosulek (IACR Cryptol. ePrint Arch., 2018)

PIR-PSI: Scaling Private Contact Discovery. - Daniel Demmler; Peter Rindal; Mike Rosulek; Ni Trieu (Proc. Priv. Enhancing Technol., 2018)

Garbled Neural Networks are Practical. - Marshall Ball; Brent Carmer; Tal Malkin; Mike Rosulek; Nichole Schimanski (IACR Cryptol. ePrint Arch., 2019)

Scalable Private Set Union from Symmetric-Key Techniques. - Vladimir Kolesnikov; Mike Rosulek; Ni Trieu; Xiao Wang 012 (IACR Cryptol. ePrint Arch., 2019)

Fast Database Joins for Secret Shared Data. - Payman Mohassel; Peter Rindal; Mike Rosulek (IACR Cryptol. ePrint Arch., 2019)

SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension. - Benny Pinkas; Mike Rosulek; Ni Trieu; Avishay Yanai (IACR Cryptol. ePrint Arch., 2019)

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 (IACR Cryptol. ePrint Arch., 2019)

Cheaper Private Set Intersection via Differentially Private Leakage. - Adam Groce; Peter Rindal; Mike Rosulek (Proc. Priv. Enhancing Technol., 2019)

Fast Database Joins and PSI for Secret Shared Data. - Payman Mohassel; Peter Rindal; Mike Rosulek (CCS, 2020)

Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions. - Ian McQuoid; Mike Rosulek; Lawrence Roy (IACR Cryptol. ePrint Arch., 2020)

PSI from PaXoS: Fast, Malicious Private Set Intersection. - Benny Pinkas; Mike Rosulek; Ni Trieu; Avishay Yanai (IACR Cryptol. ePrint Arch., 2020)

Practical Privacy-Preserving K-means Clustering. - Payman Mohassel; Mike Rosulek; Ni Trieu (Proc. Priv. Enhancing Technol., 2020)

Private Set Operations from Oblivious Switching. - Gayathri Garimella; Payman Mohassel; Mike Rosulek; Saeed Sadeghian; Jaspal Singh (Public Key Cryptography (2), 2021)

Private Set Operations from Oblivious Switching. - Gayathri Garimella; Payman Mohassel; Mike Rosulek; Seyed Saeed Sadeghian; Jaspal Singh (IACR Cryptol. ePrint Arch., 2021)

Oblivious Key-Value Stores and Amplification for Private Set Intersection. - Gayathri Garimella; Benny Pinkas; Mike Rosulek; Ni Trieu; Avishay Yanai (IACR Cryptol. ePrint Arch., 2021)

Batching Base Oblivious Transfers. - Ian McQuoid; Mike Rosulek; Lawrence Roy (IACR Cryptol. ePrint Arch., 2021)

Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits. - Mike Rosulek; Lawrence Roy (IACR Cryptol. ePrint Arch., 2021)

Compact and Malicious Private Set Intersection for Small Sets. - Mike Rosulek; Ni Trieu (IACR Cryptol. ePrint Arch., 2021)

On the (Im)Practicality of Adversarial Perturbation for Image Privacy. - Arezoo Rajabi; Rakesh B. Bobba; Mike Rosulek; Charles V. Wright; Wu-chi Feng (Proc. Priv. Enhancing Technol., 2021)

Finding One Common Item, Privately. - Tyler Beauregard; Janabel Xia; Mike Rosulek (IACR Cryptol. ePrint Arch., 2022)

Structure-Aware Private Set Intersection, With Applications to Fuzzy Matching. - Gayathri Garimella; Mike Rosulek; Jaspal Singh (IACR Cryptol. ePrint Arch., 2022)

A Complete Characterization of Security for Linicrypt Block Cipher Modes. - Tommy Hollenberg; Mike Rosulek; Lawrence Roy (IACR Cryptol. ePrint Arch., 2022)

How to Obfuscate MPC Inputs. - Ian McQuoid; Mike Rosulek; Jiayu Xu 001 (IACR Cryptol. ePrint Arch., 2022)

Practical Privacy-Preserving Authentication for SSH. - Lawrence Roy; Stanislav Lyakhov; Yeongjin Jang; Mike Rosulek (IACR Cryptol. ePrint Arch., 2022)

Malicious Secure, Structure-Aware Private Set Intersection. - Gayathri Garimella; Mike Rosulek; Jaspal Singh (IACR Cryptol. ePrint Arch., 2023)

Verifiable Distributed Aggregation Functions. - Hannah Davis; Christopher Patton; Mike Rosulek; Phillipp Schoppmann (Proc. Priv. Enhancing Technol., 2023)

Fuzzy PSI via Oblivious Protocol Routing. - David Richardson; Mike Rosulek; Jiayu Xu 001 (IACR Cryptol. ePrint Arch., 2024)

Lower Bounds for Garbled Circuits from Shannon-Type Information Inequalities. - Jake Januzelli; Mike Rosulek; Lawrence Roy (IACR Cryptol. ePrint Arch., 2025)

Monitoring in the Dark: Privacy-Preserving Runtime Verification of Cyber-Physical Systems. - Charles Koll; Preston Tan Hang; Mike Rosulek; Houssam Abbas (CoRR, 2025)