Mike Rosulek
Mike Rosulek
Associate Professor, Oregon State University
Geverifieerd e-mailadres voor eecs.oregonstate.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Attribute-based signatures
HK Maji, M Prabhakaran, M Rosulek
Cryptographers’ track at the RSA conference, 376-392, 2011
628*2011
Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits using Half Gates
S Zahur, M Rosulek, D Evans
Advances in Cryptology-EUROCRYPT 2015, 220-250, 2015
363*2015
Efficient batched oblivious PRF with applications to private set intersection
V Kolesnikov, R Kumaresan, M Rosulek, N Trieu
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016
1312016
FleXOR: Flexible garbling for XOR gates that beats free-XOR
V Kolesnikov, P Mohassel, M Rosulek
Annual Cryptology Conference, 440-457, 2014
1002014
Fast and secure three-party computation: The garbled circuit approach
P Mohassel, M Rosulek, Y Zhang
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications …, 2015
892015
A pragmatic introduction to secure multi-party computation
D Evans, V Kolesnikov, M Rosulek
Foundations and Trends® in Privacy and Security 2 (2-3), 2017
862017
Practical multi-party private set intersection from symmetric-key techniques
V Kolesnikov, N Matania, B Pinkas, M Rosulek, N Trieu
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
732017
Improved private set intersection against malicious adversaries
P Rindal, M Rosulek
Annual International Conference on the Theory and Applications of …, 2017
722017
Rerandomizable RCCA encryption
M Prabhakaran, M Rosulek
Annual International Cryptology Conference, 517-534, 2007
682007
Malicious-secure private set intersection via dual execution
P Rindal, M Rosulek
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
592017
Faster malicious 2-party secure computation with online/offline dual execution
P Rindal, M Rosulek
25th {USENIX} Security Symposium ({USENIX} Security 16), 297-314, 2016
562016
Complexity of multi-party computation problems: The case of 2-party symmetric secure function evaluation
HK Maji, M Prabhakaran, M Rosulek
Theory of Cryptography Conference, 256-273, 2009
532009
Spot-light: Lightweight private set intersection from sparse ot extension
B Pinkas, M Rosulek, N Trieu, A Yanai
Annual International Cryptology Conference, 401-431, 2019
502019
Homomorphic encryption with CCA security
M Prabhakaran, M Rosulek
International Colloquium on Automata, Languages, and Programming, 667-678, 2008
492008
Garbling gadgets for boolean and arithmetic circuits
M Ball, T Malkin, M Rosulek
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016
452016
PIR-PSI: scaling private contact discovery
D Demmler, P Rindal, M Rosulek, N Trieu
Proceedings on Privacy Enhancing Technologies 2018 (4), 159-178, 2018
402018
How to efficiently evaluate RAM programs with malicious security
A Afshar, Z Hu, P Mohassel, M Rosulek
Annual International Conference on the Theory and Applications of …, 2015
392015
Cryptographic complexity of multi-party computation problems: Classifications and separations
M Prabhakaran, M Rosulek
Annual International Cryptology Conference, 262-279, 2008
382008
A zero-one law for cryptographic complexity with respect to computational UC security
HK Maji, M Prabhakaran, M Rosulek
Annual Cryptology Conference, 595-612, 2010
36*2010
PSI from PaXoS: fast, malicious private set intersection
B Pinkas, M Rosulek, N Trieu, A Yanai
Annual International Conference on the Theory and Applications of …, 2020
302020
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20