
Photo by Dr. Tiantian Gong.
Zeyu Liu
PhD Student
Yale University
Research Interests
Private Computation
Metadata Privacy
Post-Quantum Cryptography
About
I am on the academic job market in 2026–2027, seeking a faculty position starting in Fall 2027.
Please feel free to contact me about relevant opportunities. I’d be happy to hear from you!
My research develops cryptographic foundations and efficient protocols for private computation and communication, focusing on fully homomorphic encryption (FHE), metadata privacy, and post-quantum cryptography.
- I am a PhD student at Yale University, Yale Applied Cryptography Laboratory (YACL), and luckily being advised by Prof. Ben Fisch.
- I also had an amazing experience visiting CMU in Summer 2025, kindly hosted by Prof. Aayush Jain.
- Before coming to Yale, I obtained my Master’s degree at Columbia University, where I was fortunate to be jointly advised by Prof. Tal Malkin and Prof. Eran Tromer.
- During my Master’s study, I also worked part time as a researcher at Duality Technologies Inc., where I was fortunate to be supervised by Dr. Yuriy Polyakov.
- Before that, I obtained my Bachelor’s degree in CS and Math at UCLA.
- If you are interested, please also check out my bunny, Baoliu.
I’m happy to chat about research or anything else you’d like to discuss. Feel free to reach out!
Selected Publications
View All →Authors are generally listed alphabetically, as customary in cryptography. For papers with non-alphabetical author order, * denotes first or co-first authorship.
New Techniques for Fast and Shallow FHE Bootstrapping and Beyond
Annual International Cryptology Conference (CRYPTO) • 2026URL
SIMD HSS and aHMAC from Interval Encoding with Application to One-Bit-Per-Gate Garbling
Annual International Cryptology Conference (CRYPTO) • 2026URL
UnifOMR: Oblivious Message Retrieval with Near-optimal Concrete Efficiency
ACM Conference on Computer and Communications Security (CCS), to appear • 2026URL
Relect: Single Secret Leader Election via FHE with Reduced Computation and Communication and Transparent Setup
ACM Conference on Computer and Communications Security (CCS), to appear • 2026URL
InstantOMR: Oblivious Message Retrieval with Low Latency and Optimal Parallelizability
USENIX Security Symposium (USENIX Security) • 2026URL
Multi-Server Doubly Efficient PIR in the Classical Model and Beyond
Theory of Cryptography Conference (TCC) • 2025URL
Lattice-based Multi-message Multi-recipient KEM/PKE with Malicious Security
International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT) • 2025URL
IND-CPA-D of Relaxed Functional Bootstrapping: A New Attack, A General Fix, and A Stronger Model
ACM Conference on Computer and Communications Security (CCS) • 2025URL
Scalable Private Signaling
IEEE Computer Security Foundations Symposium (CSF) • 2025URL
Finding Balance in Unbalanced PSI: A New Construction from Single-Server PIR
IACR Communications in Cryptology (CiC) • 2025URL
Permissionless Verifiable Information Dispersal (Data Availability for Bitcoin Rollups)
IEEE Symposium on Security and Privacy (S&P) • 2025URL
Snake-Eye Resistant PKE from LWE for Oblivious Message Retrieval and Robust Encryption
Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) • 2025URL
Rational Secret Sharing with Competition
Financial Cryptography and Data Security (FC) • 2025URL
Relaxed Functional Bootstrapping: A New Perspective on BGV/BFV Bootstrapping
International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT) • 2024URL
ThorPIR: Single Server PIR via Homomorphic Thorp Shuffles
ACM Conference on Computer and Communications Security (CCS) • 2024URL
PerfOMR: Oblivious Message Retrieval with Reduced Communication and Computation
USENIX Security Symposium (USENIX Security) • 2024URL
Group Oblivious Message Retrieval
IEEE Symposium on Security and Privacy (S&P) • 2024URL
Amortized Functional Bootstrapping in Less than 7 ms, with Õ(1) Polynomial Multiplications
International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT) • 2023URL
Orbweaver: Succinct Linear Functional Commitments from Lattices
Annual International Cryptology Conference (CRYPTO) • 2023URL
Large-Precision Homomorphic Sign Evaluation Using FHEW/TFHE Bootstrapping
International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT) • 2022URL
XSPIR: Efficient Symmetrically Private Information Retrieval from Ring-LWE
European Symposium on Research in Computer Security (ESORICS) • 2022URL
Oblivious Message Retrieval
Annual International Cryptology Conference (CRYPTO) • 2022URL
Talks
Oblivious Message Retrieval: Foundations and Recent Advances
- Stanford University Security Seminar (upcoming)
- Duke University (upcoming)
- Northwestern University Cryptography Reading Group
- SJTU Cryptography Reading Group
- FHE.org meetup
Oblivious Message Retrieval / Group Oblivious Message Retrieval
- Brown University Cryptography Reading Group
- MIT CSAIL Security Seminar
- CRYPTO 2022 / IEEE S&P 2024
Snake-Eye Resistant PKE from LWE for Oblivious Message Retrieval and Robust Encryption
- NTNU Cryptography Reading Group
- CMU CyLab Crypto Seminar
- Boston Crypto Day
- Purdue Crypto Reading Group
- NYU Crypto Reading Group
PerfOMR: Oblivious Message Retrieval with Reduced Communication and Computation
- USENIX Security 2024
New Techniques for Fast and Shallow FHE Bootstrapping and Beyond
- NYU Security Seminar
- CRYPTO 2026
IND-CPA-D of Relaxed Functional Bootstrapping: A New Attack, A General Fix, and A Stronger Model
- UCAS Cryptography Reading Group
- ACM CCS 2025
Relaxed Functional Bootstrapping: A New Perspective on BGV and BFV Bootstrapping
- FHE.org Meetup
- ASIACRYPT 2024
- NYU Crypto Reading Group
Amortized Functional Bootstrapping in Less than 7 ms, with Õ(1) Polynomial Multiplications
- ASIACRYPT 2023
- NYC Crypto Day
- Ant Research FHE Seminar
Large-Precision Homomorphic Sign Evaluation Using FHEW/TFHE Bootstrapping
- ASIACRYPT 2022
- Duality Research Seminar
Laminate: Succinct SIMD-Friendly Verifiable FHE
- NIST Workshop on Multi-Party Threshold Schemes 2026
SIMD HSS and aHMAC from Interval Encoding with Application to One-Bit-Per-Gate Garbling
- Columbia University Cryptography Reading Group
ThorPIR: Single Server PIR via Homomorphic Thorp Shuffles
- ACM CCS 2024
Permissionless Verifiable Information Dispersal (Data Availability for Bitcoin Rollups)
- IEEE S&P 2025
- Penn’s Security and Privacy Lab Seminar
Scalable Private Signaling
- CSF 2025
Teaching Experience Summary
View All →- Received the Andrew P. Kosoresow Memorial Award for Excellence in Teaching and Service in 2022 for the course Introduction to Cryptography at Columbia University.
- Guest lectured in 3 cryptography courses at Yale and CMU. Served as a teaching assistant eight times across five courses at Yale and Columbia.
- Mentored graduate and undergraduate research on private computation and communication. See Teaching and Mentoring for students and joint publications.
Academic Services
- Conference Program Committees: ASIACRYPT 2026; PKC 2026.
- FHE Community Program Committees: FHE.org 2027; WAHC 2026.
- Reviewer: EUROCRYPT 2025–2027; CRYPTO 2022–2026; IEEE S&P 2024–2026; SODA 2027; FOCS 2026; USENIX Security 2026; ASIACRYPT 2024–2025; TCC 2023, 2025; ACM CCS 2025; Financial Cryptography 2025; TCHES 2025; PKC 2024; SCN 2022.