Mike Rosulek

Affiliations:
  • Oregon State University, School of EECS, Corvallis, OR, USA


According to our database1, Mike Rosulek authored at least 81 papers between 2007 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Monitoring in the Dark: Privacy-Preserving Runtime Verification of Cyber-Physical Systems.
CoRR, May, 2025

Minicrypt PRFs Do Not Admit Black-Box Oblivious Evaluations.
IACR Cryptol. ePrint Arch., 2025

How to Tolerate Typos in Strong Asymmetric PAKE.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Lower Bounds for Garbled Circuits from Shannon-Type Information Inequalities.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Fuzzy PSI via Oblivious Protocol Routing.
IACR Cryptol. ePrint Arch., 2024

2023
Verifiable Distributed Aggregation Functions.
IACR Cryptol. ePrint Arch., 2023

Malicious Secure, Structure-Aware Private Set Intersection.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Practical Privacy-Preserving Authentication for SSH.
Proceedings of the 31st USENIX Security Symposium, 2022

How to Obfuscate MPC Inputs.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Finding One Common Item, Privately.
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

A Complete Characterization of Security for Linicrypt Block Cipher Modes.
Proceedings of the 35th IEEE Computer Security Foundations Symposium, 2022

Structure-Aware Private Set Intersection, with Applications to Fuzzy Matching.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
On the (Im)Practicality of Adversarial Perturbation for Image Privacy.
Proc. Priv. Enhancing Technol., 2021

Private Set Operations from Oblivious Switching.
IACR Cryptol. ePrint Arch., 2021

Private Set Operations from Oblivious Switching.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Oblivious Key-Value Stores and Amplification for Private Set Intersection.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Compact and Malicious Private Set Intersection for Small Sets.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

Batching Base Oblivious Transfers.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
PSI from PaXoS: Fast, Malicious Private Set Intersection.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Fast Database Joins and PSI for Secret Shared Data.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
Practical Privacy-Preserving K-means Clustering.
IACR Cryptol. ePrint Arch., 2019

Fast Database Joins for Secret Shared Data.
IACR Cryptol. ePrint Arch., 2019

Cheaper Private Set Intersection via Differentially Private Leakage.
IACR Cryptol. ePrint Arch., 2019

Garbled Neural Networks are Practical.
IACR Cryptol. ePrint Arch., 2019

Characterizing Collision and Second-Preimage Resistance in Linicrypt.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Balancing Image Privacy and Usability with Thumbnail-Preserving Encryption.
Proceedings of the 26th Annual Network and Distributed System Security Symposium, 2019

SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Secure Data Exchange: A Marketplace in the Cloud.
Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop, 2019

Scalable Private Set Union from Symmetric-Key Techniques.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
PIR-PSI: Scaling Private Contact Discovery.
IACR Cryptol. ePrint Arch., 2018

A Pragmatic Introduction to Secure Multi-Party Computation.
Found. Trends Priv. Secur., 2018

On the Structure of Unconditional UC Hybrid Protocols.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

SWiM: Secure Wildcard Pattern Matching from OT Extension.
Proceedings of the Financial Cryptography and Data Security, 2018

Optimizing Authenticated Garbling for Faster Secure Two-Party Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

TACHYON: Fast Signatures from Compact Knapsack.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Reconciling Non-malleability with Homomorphic Encryption.
J. Cryptol., 2017

Efficient Maliciously Secure Two Party Computation for Mixed Programs.
IACR Cryptol. ePrint Arch., 2017

Improvements for Gate-Hiding Garbled Circuits.
Proceedings of the Progress in Cryptology - INDOCRYPT 2017, 2017

Improved Private Set Intersection Against Malicious Adversaries.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Sublinear Zero-Knowledge Arguments for RAM Programs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Non-interactive Secure 2PC in the Offline/Online and Batch Settings.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Malicious-Secure Private Set Intersection via Dual Execution.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

Approximate Thumbnail Preserving Encryption.
Proceedings of the 2017 on Multimedia Privacy and Security, 2017

DUPLO: Unifying Cut-and-Choose for Garbled Circuits.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

Practical Multi-party Private Set Intersection from Symmetric-Key Techniques.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Faster Malicious 2-party Secure Computation with Online/Ofine Dual Execution.
IACR Cryptol. ePrint Arch., 2016

Faster Malicious 2-Party Secure Computation with Online/Offline Dual Execution.
Proceedings of the 25th USENIX Security Symposium, 2016

Linicrypt: A Model for Practical Cryptography.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Efficient Batched Oblivious PRF with Applications to Private Set Intersection.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

Garbling Gadgets for Boolean and Arithmetic Circuits.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Secure Your Data and Compute on It, Too.
XRDS, 2015

Richer Efficiency/Security Trade-offs in 2PC.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Vamonos: Embeddable visualizations of advanced algorithms.
Proceedings of the 2015 IEEE Frontiers in Education Conference, 2015

Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

How to Efficiently Evaluate RAM Programs with Malicious Security.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Fast and Secure Three-party Computation: The Garbled Circuit Approach.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013
Complexity of Multi-Party Computation Functionalities.
Proceedings of the Secure Multi-Party Computation, 2013

Complexity of Multi-Party Computation Functionalities.
IACR Cryptol. ePrint Arch., 2013

Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction.
Proceedings of the Advances in Cryptology, 2013

2012
A Unified Characterization of Completeness and Triviality for Secure Function Evaluation.
Proceedings of the Progress in Cryptology, 2012

Universal Composability from Essentially Any Trusted Setup.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Must You Know the Code of f to Securely Compute f?
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011
Exploring the Limits of Common Coins Using Frontier Analysis of Protocols.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Attribute-Based Signatures.
Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

2010
A Zero-One Law for Deterministic 2-Party Secure Computation.
IACR Cryptol. ePrint Arch., 2010

Cryptographic Complexity Classes and Computational Intractability Assumptions.
Proceedings of the Innovations in Computer Science, 2010

A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security.
Proceedings of the Advances in Cryptology, 2010

2009
The Structure of Secure Multi-Party Computation
PhD thesis, 2009

Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

2008
Complexity of Multiparty Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation.
IACR Cryptol. ePrint Arch., 2008

Attribute-Based Signatures: Achieving Attribute-Privacy and Collusion-Resistance.
IACR Cryptol. ePrint Arch., 2008

Homomorphic Encryption with CCA Security.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations.
Proceedings of the Advances in Cryptology, 2008

Towards Robust Computation on Encrypted Data.
Proceedings of the Advances in Cryptology, 2008

2007
Harvesting credentials in trust negotiation as an honest-but-curious adversary.
Proceedings of the 2007 ACM Workshop on Privacy in the Electronic Society, 2007

Rerandomizable RCCA Encryption.
Proceedings of the Advances in Cryptology, 2007


  Loading...