About me
I am a postdoctoral scholar at Stanford University's Computer Science Department, hosted by Prof. Dan Boneh.
My main area of research is cryptography, its applications, and its relations with other foundational aspects of computation.
I am a Protocol Labs Postdoctoral Fellow and a Rothschild Postdoctoral Fellow.
Before joining Stanford, I completed my Ph.D. in Computer Science at the Hebrew University's School of Computer Science and Engineering, where I was fortunate to be advised by Prof. Gil Segev.
During my Ph.D. I was an Adams Fellow of the Israel Academy of Sciences and Humanities.
Contact
Office: Gates Computer Science Building, Room 188
Email: lrotem at cs.stanford.edu
Publications
- Dan Boneh, Aditi Partap, and Lior Rotem
Post-Quantum Single Secret Leader Election (SSLE) From Publicly Re-randomizable Commitments
ACM Advances in Financial Technologies (AFT), 2023.
Also presented at the Science of Blockchain Conference (SBC), 2023.
[PDF] - Dan Boneh, Aditi Partap, and Lior Rotem
Proactive Refresh for Accountable Threshold Signatures
[PDF] - Lior Rotem
Revisiting the Uber Assumption in the Algebraic Group Model: Fine-Grained Bounds in Hidden-Order Groups and Improved Reductions in Bilinear Groups
Information-Theoretic Cryptography (ITC), 2022.
[PDF] - Lior Rotem and Gil Segev
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff
Information-Theoretic Cryptography (ITC), 2022.
[PDF] - Lior Rotem
Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions
Theory of Cryptography Conference (TCC) 2021.
[PDF] - Lior Rotem and Gil Segev
Non-Malleable Vector Commitments via Local-Equivocability
Theory of Cryptography Conference (TCC) 2021.
Journal of Cryptology, 2023.
[PDF] - Lior Rotem and Gil Segev
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols
Advances in Cryptology - CRYPTO, 2021.
[PDF] - Lior Rotem and Gil Segev
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions
Theory of Cryptography Conference (TCC), 2020.
[PDF] - Lior Rotem and Gil Segev
Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions
Advances in Cryptology - CRYPTO, 2020.
[PDF] - Lior Rotem, Gil Segev, and Ido Shahaf
Generic-Group Delay Functions Require Hidden-Order Groups
Advances in Cryptology - EUROCRYPT, 2020.
[PDF] - Moni Naor, Lior Rotem, and Gil Segev
Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery
Information-Theoretic Cryptography (ITC), 2020.
[PDF] - Lior Rotem and Gil Segev
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal
Advances in Cryptology - CRYPTO, 2018.
[PDF] - Lior Rotem and Gil Segev
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier?
Theory of Cryptography Conference (TCC), 2018.
Journal of Cryptology, 2021.
[PDF] - Moni Naor, Lior Rotem, and Gil Segev
The Security of Lazy Users in Out-of-Band Authentication
Theory of Cryptography Conference (TCC), 2018.
ACM Transactions on Privacy and Security (TOPS), 2020.
[PDF] - Ran Cohen, Iftach Haitner, Eran Omri, and Lior Rotem
From Fairness to Full Security in Multiparty Computation
Security and Cryptography for Networks (SCN), 2018.
Journal of Cryptology, 2021.
[PDF] - Ran Cohen, Iftach Haitner, Eran Omri, and Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast
Theory of Cryptography Conference (TCC), 2016.
Journal of Cryptology, 2018.
[PDF]
Teaching
- CS355: Topics in Cryptography - Instructor
[Spring 2023] - 67392: Introduction to Cryptography and Software Security - Instructor
[Spring 2021/22] - 67392: Introduction to Cryptography and Software Security - Recitation instructor
[Spring 2018/19] [Spring 2019/20] [Spring 2020/21]