Mike Rosulek

From MaRDI portal
Person:775979

Available identifiers

zbMath Open rosulek.mikeMaRDI QIDQ775979

List of research outcomes

PublicationDate of PublicationType
Malicious secure, structure-aware private set intersection2024-02-02Paper
How to obfuscate MPC inputs2023-08-14Paper
Finding one common item, privately2023-07-25Paper
Structure-aware private set intersection, with applications to fuzzy matching2023-06-12Paper
Batching base oblivious transfers2023-05-12Paper
Oblivious key-value stores and amplification for private set intersection2022-04-22Paper
Three halves make a whole? Beating the half-gates lower bound for garbled circuits2022-03-31Paper
PSI from PaXoS: fast, malicious private set intersection2022-03-23Paper
Private set operations from oblivious switching2021-12-21Paper
SWiM: secure wildcard pattern matching from OT extension2021-03-17Paper
Optimizing authenticated garbling for faster secure two-party computation2020-06-30Paper
Scalable private set union from symmetric-key techniques2020-05-05Paper
Characterizing collision and second-preimage resistance in Linicrypt2020-04-30Paper
SpOT-light: lightweight private set intersection from sparse OT extension2020-03-09Paper
On the structure of unconditional UC hybrid protocols2018-12-06Paper
Improvements for gate-hiding garbled circuits2018-04-26Paper
Reconciling non-malleability with homomorphic encryption2017-10-12Paper
Non-interactive Secure 2PC in the Offline/Online and Batch Settings2017-06-23Paper
Improved Private Set Intersection Against Malicious Adversaries2017-06-13Paper
Sublinear Zero-Knowledge Arguments for RAM Programs2017-06-13Paper
Linicrypt: A Model for Practical Cryptography2016-11-09Paper
Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost2015-12-10Paper
How to Efficiently Evaluate RAM Programs with Malicious Security2015-09-30Paper
Richer Efficiency/Security Trade-offs in 2PC2015-07-06Paper
A Unified Characterization of Completeness and Triviality for Secure Function Evaluation2014-08-20Paper
FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR2014-08-07Paper
Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction2013-05-31Paper
Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities2013-03-18Paper
Must You Know the Code of f to Securely Compute f?2012-09-25Paper
Universal Composability from Essentially Any Trusted Setup2012-09-25Paper
Exploring the Limits of Common Coins Using Frontier Analysis of Protocols2011-05-19Paper
Attribute-Based Signatures2011-02-11Paper
A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security2010-08-24Paper
Rerandomizable RCCA Encryption2009-03-10Paper
Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation2009-03-03Paper
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations2009-02-10Paper
Towards Robust Computation on Encrypted Data2009-02-10Paper
Homomorphic Encryption with CCA Security2008-08-19Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Mike Rosulek