Mike Rosulek
Assistant Professor
School of EECS
Oregon State University

I am a computer scientist interested in cryptography and security. BS from Iowa State University ↝ PhD from University of Illinois ↝ Assistant Prof at University of Montana (2009-2013) ↝ Assistant Prof at Oregon State (2013-present). I am the only faculty member at Oregon State University whose name contains the substring "OSU".

News

May 2018
Paper on authenticated garbling accepted to Crypto 2018. Paper on private contact discovery accepted to PETS 2018.
Apr 2018
I will be delivering a lecture series on 2PC techniques at the crypt@b-it summer school. Come to Germany for a week in July and learn 2PC!
Dec 2017
Slides from Indocrypt tutorial and gate-hiding GC paper now posted.
Nov 2017
Paper on wildcard pattern matching accepted to Financial Cryptography 2018.
Oct 2017
Paper on gate-hiding garbled circuits accepted to Indocrypt 2017. CCS workshop paper on thumbnail-preserving encryption now on eprint.
Sep 2017
This quarter I'm teaching an honors section and traditional section of CS 321, Theory of computation.
Aug 2017
OSU takeover of ACM CCS 2017 has been successful: 3 papers for me (malicious PSI, Duplo, multi-party PSI), 5 for my group members, 6 for Oregon State! Addendum Sep 2017: plus 1 paper at a CCS-affiliated workshop
Jul 2017
I will be on the program committee for Eurocrypt 2018, so get your best results in order for the Sep 19 deadline!
May 2017
Paper on UC hybrid protocols now on eprint.
Mar 2017
I'll be on the program committees for CCS 2017 and Indocrypt 2017. Please submit your best work!
Jan 2017
Hat trick! 3 papers accepted to Eurocrypt 2017! (ZK for RAM programs, malicious PSI, non-interactive 2PC)

Teaching

This quarter (Winter 2018) I am teaching CS 427/519 (Intro to Cryptography).

Typically I teach CS 321 (Theory of Computation) in fall, CS 427 (Intro to Cryptography) in winter, and CS 517 (Computational Complexity) in spring.

Textbook

I am writing an undergraduate textbook on cryptography called The Joy of Cryptography. The book is / will be free, thanks to support from Oregon State's open textbook initiative.

Mentoring

Current advisees:
Long-term visitors:
Former advisees:

Research

My main research focus is on cryptographic protocols for secure computation. These tools allow parties to perform computations on private data, so that they learn the outcome of the computation but nothing else. I am interested in both theoretical and practical aspects of secure computation techniques.

More specifically, my recent research has focused on:

My research is supported by the NSF, including an NSF CAREER award, and faculty research awards from Google and Visa Research.

Publications

More bibliographic information is also available on my Google scholar page and DBLP page. For most publications I include a link to a free version of the article; however, some papers are behind paywalls. Send me email if you would like a copy of paywalled publications.

Optimizing Authenticated Garbling for Faster Secure Two-Party Computation
Jonathan Katz, Samuel Ranellucci, Mike Rosulek, Xiao Wang
Crypto 2018 article
PIR-PSI: Scaling Private Contact Discovery
Daniel Demmler, Peter Rindal, Mike Rosulek, Ni Trieu
PETS 2018 article
SWiM: Secure Wildcard Pattern Matching From OT Extension
Vladimir Kolesnikov, Mike Rosulek, Ni Trieu
Financial Cryptography 2018 article code
Improvements for Gate-Hiding Garbled Circuits
Mike Rosulek
Indocrypt 2017 article slides
Approximate Thumbnail Preserving Encryption
Byron Marohn, Charles V Wright, Wu-chi Feng, Mike Rosulek, Rakesh Bobba
Workshop on Multimedia Privacy and Security 2017 article
Malicious-Secure Private Set Intersection via Dual Execution
Peter Rindal & Mike Rosulek
CCS 2017 article code
Practical Multi-party Private Set Intersection from Symmetric-Key Techniques
Vladimir Kolesnikov, Naor Matania, Benny Pinkas, Mike Rosulek, Ni Trieu
CCS 2017 article code
DUPLO: Unifying Cut-and-Choose for Garbled Circuits
Vladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu, Roberto Trifiletti
CCS 2017 article code
Improved Private Set Intersection against Malicious Adversaries
Peter Rindal & Mike Rosulek
Eurocrypt 2017 article code
Non-Interactive Secure 2PC in the Offline/Online and Batch Settings
Payman Mohassel & Mike Rosulek
Eurocrypt 2017 article
Sublinear Zero-Knowledge Arguments for RAM Programs
Payman Mohassel, Mike Rosulek, Alessandra Scafuro
Eurocrypt 2017 article
Reconciling Non-malleability with Homomorphic Encryption
Manoj Prabhakaran & Mike Rosulek
Journal of Cryptology 2017 article
Efficient Batched Oblivious PRF with Applications to Private Set Intersection
Vladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, Ni Trieu
CCS 2016 article code
Garbling Gadgets for Boolean and Arithmetic Circuits
Marshall Ball, Tal Malkin, Mike Rosulek
CCS 2016 article slides
Linicrypt: A Model for Practical Cryptography
Brent Carmer & Mike Rosulek
CRYPTO 2016 article code slides
Faster Malicious 2-party Secure Computation with Online/Offline Dual Execution
Peter Rindal & Mike Rosulek
USENIX Security 2016 article code slides
Fast and Secure Three-party Computation: The Garbled Circuit Approach
Payman Mohassel, Mike Rosulek, Ye Zhang
CCS 2015 article
Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized Cost
Zhangxiang Hu, Payman Mohassel, Mike Rosulek
CRYPTO 2015 article
Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits using Half Gates
Samee Zahur, Mike Rosulek, David Evans
Eurocrypt 2015 article
How to Efficiently Evaluate RAM Programs with Malicious Security
Arash Afshar, Zhangxiang Hu, Payman Mohassel, Mike Rosulek
Eurocrypt 2015 article slides
Richer Efficiency/Security Tradeoffs in 2PC
Vladimir Kolesnikov, Payman Mohassel, Ben Riva, Mike Rosulek
TCC 2015 article slides
FleXOR: Flexible garbling for XOR gates that beats free-XOR
Vladimir Kolesnikov, Payman Mohassel, Mike Rosulek
CRYPTO 2014 article slides video
Multi-Party Computation for Polynomials and Branching Programs without Simultaneous Interaction
Dov Gordon, Tal Malkin, Mike Rosulek, Hoeteck Wee
Eurocrypt 2013 article
Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities
R. Amzi Jeffs & Mike Rosulek
TCC 2013 article
A Unified Characterization of Completeness and Triviality for Secure Function Evaluation
Hemanta Maji, Manoj Prabhakaran, Mike Rosulek
Indocrypt 2012 article
Must you know the code of f  to securely compute f?
Mike Rosulek
CRYPTO 2012 article slides video
Universal Composability from Essentially Any Trusted Setup
Mike Rosulek
CRYPTO 2012 article slides video
Complexity of Multi-Party Computation Functionalities
Hemanta Maji, Manoj Prabhakaran, Mike Rosulek
Book chapter article
Exploring the Limits of Common Coins Using Frontier Analysis of Protocols
Hemanta Maji, Pichayoot Ouppaphan, Manoj Prabhakaran, Mike Rosulek
TCC 2011 article
Attribute-Based Signatures
Hemanta Maji, Manoj Prabhakaran, Mike Rosulek
CT-RSA 2011 article
A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security
Hemanta Maji, Manoj Prabhakaran, Mike Rosulek
CRYPTO 2010 article
Cryptographic Complexity Classes and Computational Intractability Assumptions
Hemanta Maji, Manoj Prabhakaran, Mike Rosulek
ICS 2010 article
Complexity of Multiparty Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
Hemanta Maji, Manoj Prabhakaran, Mike Rosulek
TCC 2009 article
Towards Robust Computation on Encrypted Data
Manoj Prabhakaran & Mike Rosulek
Asiacrypt 2008 article slides
Cryptographic Complexity of Multi-party Computation Problems: Classifications and Separations
Manoj Prabhakaran & Mike Rosulek
CRYPTO 2008 article slides
Homomorphic Encryption with CCA Security
Manoj Prabhakaran & Mike Rosulek
ICALP 2008 article slides
Harvesting Credentials in Trust Negotiation as an Honest-But-Curious Adversary
Lars Olson, Mike Rosulek, Marianne Winslett
WPES 2007 article
Rerandomizable RCCA Encryption
Manoj Prabhakaran & Mike Rosulek
CRYPTO 2007 article slides

Unpublished manuscripts & other writings

Characterizing Collision and Second-Preimage Resistance in Linicrypt
Ian McQuoid, Trevor Swope, Mike Rosulek
Manuscript 2018 article
On the Structure of Unconditional UC Hybrid Protocols
Mike Rosulek & Morgan Shirley
Manuscript 2017 article
Efficient Maliciously Secure Two Party Computation for Mixed Programs
Arash Afshar, Payman Mohassel, Mike Rosulek
Manuscript 2017 article
Secure Data Exchange: A Marketplace in the Cloud
Ran Gilad-Bachrach, Kim Laine, Kristin Lauter, Peter Rindal, Mike Rosulek
Manuscript 2016 article
Secure Your Data and Compute on It, Too
Mike Rosulek
XRDS: Crossroads, the ACM Magazine for Students, 2015 article
Correspondences regarding cryptography between John Nash and the NSA
John Nash
Transcribed & typeset by Mike Rosulek pdf originals
The Structure of Secure Multi-Party Computation
Mike Rosulek
University of Illinois PhD dissertation, 2009 pdf

Selected talks

Garbled Circuits for Secure Computation
Indocrypt Tutorial, December 2017 slides
Towards Optimal Garbled Circuit Constructions
Allerton Conference, October 2015 slides
A Brief History of Practical Garbled Circuit Optimizations
Simons Institute workshop on Securing Computation, June 2015 slides video
Zero-Knowledge Proofs, with Applications to Sudoku and Where's Waldo
Educational talk, University of Montana, December 2008 slides

Other Things

Projects

An Annotated Bibliography of Practical Secure Computation
A reference for researchers in secure computationwebsite
Vamonos
A browser-based platform for algorithm visualizationwebsite

Professional Service

I have served on the following program committees (reverse chronological):

S&P (Oakland) 2019, TCC 2018, Crypto 2018, Eurocrypt 2018, Indocrypt 2017, CCS 2017, CRYPTO 2016, PETS 2015, ACNS 2015, Eurocrypt 2014, TCC 2014, TCC 2012, PKC 2011

I serve as communications secretary for the International Association for Cryptologic Research.

Miscellany

I have a personal website (never updated), a Flickr page, a Github page, and one Youtube video.