Ethan Mook
I am a postdoctoral researcher at the University of Toronto where I am hosted by Akshay Srinivasam.
I recently finished my PhD at Northeastern University where I am advised by Daniel Wichs. Before that, I was an undergraduate student at the University of Michigan.
I am broadly interested in theoretical cryptography. My longest line of work is focused on secure RAM computation, that is, enabling efficient computation that includes private accesses to a public database. Aside from that line, I am also very interested in the foundations of cryptography, such as exploring the relationships of various cryptographic primitves, as well as proof systems and other advanced applications.
Email: ethan [at] ethanmook [dot] com
Publications
-
Black Box Crypto is Useless for Doubly Efficient PIR
Eurocrypt 2025
[eprint] -
Doubly Efficient Cryptography: Commitments, Arguments and RAM MPC
CRYPTO 2024
[eprint] -
Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE
CRYPTO 2024
[eprint] -
Laconic Function Evaluation, Functional Encryption and
Obfuscation for RAMs with Sublinear Computation
Eurocrypt 2024
[eprint] [slides] -
Doubly Efficient Private Information Retrieval and
Fully Homomorphic RAM Computation from Ring LWE
STOC 2023 (Best paper award)
[eprint] [slides] -
Post-Quantum Insecurity from LWE
TCC 2022
[eprint] [slides] [talk] -
Lattice (List) Decoding Near Minkowski's Inequality
IEEE Transactions on Information Theory, 68(2):863-870
[arxiv]