Mike Rosulek

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


According to our database1, Mike Rosulek authored at least 68 papers between 2007 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

Compact and Malicious Private Set Intersection for Small Sets.
IACR Cryptol. ePrint Arch., 2021

Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits.
IACR Cryptol. ePrint Arch., 2021

Batching Base Oblivious Transfers.
IACR Cryptol. ePrint Arch., 2021

Oblivious Key-Value Stores and Amplification for Private Set Intersection.
IACR Cryptol. ePrint Arch., 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

2020
Practical Privacy-Preserving K-means Clustering.
Proc. Priv. Enhancing Technol., 2020

PSI from PaXoS: Fast, Malicious Private Set Intersection.
IACR Cryptol. ePrint Arch., 2020

Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions.
IACR Cryptol. ePrint Arch., 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

2019
Cheaper Private Set Intersection via Differentially Private Leakage.
Proc. Priv. Enhancing Technol., 2019

Balancing Image Privacy and Usability with Thumbnail-Preserving Encryption.
IACR Cryptol. ePrint Arch., 2019

SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension.
IACR Cryptol. ePrint Arch., 2019

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

Scalable Private Set Union from Symmetric-Key Techniques.
IACR Cryptol. ePrint Arch., 2019

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

2018
PIR-PSI: Scaling Private Contact Discovery.
Proc. Priv. Enhancing Technol., 2018

Characterizing Collision and Second-Preimage Resistance in Linicrypt.
IACR Cryptol. ePrint Arch., 2018

Optimizing Authenticated Garbling for Faster Secure Two-Party Computation.
IACR Cryptol. ePrint Arch., 2018

TACHYON: Fast Signatures from Compact Knapsack.
IACR Cryptol. ePrint Arch., 2018

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

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

On the Structure of Unconditional UC Hybrid Protocols.
IACR Cryptol. ePrint Arch., 2017

Improvements for Gate-Hiding Garbled Circuits.
IACR Cryptol. ePrint Arch., 2017

Malicious-Secure Private Set Intersection via Dual Execution.
IACR Cryptol. ePrint Arch., 2017

Sublinear Zero-Knowledge Arguments for RAM Programs.
IACR Cryptol. ePrint Arch., 2017

Non-Interactive Secure 2PC in the Offline/Online and Batch Settings.
IACR Cryptol. ePrint Arch., 2017

Approximate Thumbnail Preserving Encryption.
IACR Cryptol. ePrint Arch., 2017

SWiM: Secure Wildcard Pattern Matching From OT Extension.
IACR Cryptol. ePrint Arch., 2017

DUPLO: Unifying Cut-and-Choose for Garbled Circuits.
IACR Cryptol. ePrint Arch., 2017

Practical Multi-party Private Set Intersection from Symmetric-Key Techniques.
IACR Cryptol. ePrint Arch., 2017

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

2016
Improved Private Set Intersection against Malicious Adversaries.
IACR Cryptol. ePrint Arch., 2016

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

Efficient Batched Oblivious PRF with Applications to Private Set Intersection.
IACR Cryptol. ePrint Arch., 2016

Secure Data Exchange: A Marketplace in the Cloud.
IACR Cryptol. ePrint Arch., 2016

Linicrypt: A Model for Practical Cryptography.
IACR Cryptol. ePrint Arch., 2016

Garbling Gadgets for Boolean and Arithmetic Circuits.
IACR Cryptol. ePrint Arch., 2016

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

2015
Fast and Secure Three-party Computation: The Garbled Circuit Approach.
IACR Cryptol. ePrint Arch., 2015

Richer Efficiency/Security Trade-offs in 2PC.
IACR Cryptol. ePrint Arch., 2015

Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized Cost.
IACR Cryptol. ePrint Arch., 2015

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

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

2014
Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits using Half Gates.
IACR Cryptol. ePrint Arch., 2014

FleXOR: Flexible garbling for XOR gates that beats free-XOR.
IACR Cryptol. ePrint Arch., 2014

How to Efficiently Evaluate RAM Programs with Malicious Security.
IACR Cryptol. ePrint Arch., 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

Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction.
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

2012
Must you know the code of f to securely compute f?
IACR Cryptol. ePrint Arch., 2012

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

2011
Universal Composability from Essentially Any Trusted Setup.
IACR Cryptol. ePrint Arch., 2011

Exploring the Limits of Common Coins Using Frontier Analysis of Protocols.
IACR Cryptol. ePrint Arch., 2011

2010
Attribute-Based Signatures.
IACR Cryptol. ePrint Arch., 2010

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

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

2009
Cryptographic Complexity Classes and Computational Intractability Assumptions.
Electron. Colloquium Comput. Complex., 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
Homomorphic Encryption with CCA Security.
IACR Cryptol. ePrint Arch., 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

Cryptographic Complexity of Multi-party Computation Problems: Classifications and Separations.
Electron. Colloquium Comput. Complex., 2008

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

2007
Rerandomizable RCCA Encryption.
IACR Cryptol. ePrint Arch., 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


  Loading...