陈一镭
助理教授
密码学
Biography
I am an assistant professor at Tsinghua University Institute for Interdisciplinary Information Science (IIIS). Before joining Tsinghua I was a researcher at VISA Research. In 2018 I got my Ph.D. from Boston University under the guidance of Professor Ran Canetti and Professor Leonid Reyzin. I attended college at Shanghai Jiao Tong University, where I was seduced to science by an interesting problem.
My research interest is cryptography. As cryptographers, our mission is to spread love with mystery. Occasionally I make comic slides to carry out my duty; see samples "Merkletree", "Napoleon", "Howareyou", "VAR", "KuleshovEffect".
Publications
My research focuses on cryptography, and its connection to complexity theory and other disciplines in computer science and mathematics. My main interests are making hard mathematical problems useful for privacy protection, and showing that some conjectured hard problems are in fact easy.
Fiat-Shamir: from practice to theory [ STOC 2019 ]
Fiat-Shamir for bounded-depth adversaries [ ITC 2026 ]
Fine-grained complexity via quantum natural proofs [ Random 2026 ]
Does Fiat-Shamir require a cryptographic hash function [ Crypto 2021 ]
Traitor-tracing from LWE made simple and attribute-based [ TCC 2018 ]
Constraint-hiding constrained PRFs for NC1 from LWE [ Eurocrypt 2017 ]
Cryptanalyses of candidate branching program obfuscators [ Eurocrypt 2017 ]
Matrix PRFs: constructions, attacks, and applications to obfuscation [ TCC 2019 ]
Adaptive succinct garbled RAM, or: how to delegate your database [ TCC 2016-B ]
On the correlation intractability of obfuscated pseudorandom functions [ TCC 2016-A ]
On removing rejection conditions in practical lattice-based signatures [ PQCrypto 2021 ]
Cryptanalysis of candidate obfuscators for affine determinant programs [ Eurocrypt 2022 ]
Approximate trapdoors for lattices and smaller hash-and-sign signatures [ Asiacrypt 2019 ]
LWE with quantum amplitudes: algorithm, hardness, and oblivious sampling [ Crypto 2025 ]
Fiat-Shamir & correlation intractability from strong KDM-secure encryption [ Eurocrypt 2018 ]
Continuous space-bounded non-malleable codes from stronger proof-of-space [ Crypto 2019 ]
Hard isogeny problems over RSA moduli and groups with infeasible inversion [ Asiacrypt 2019 ]
Quantum algorithms for variants of average-case lattice problems via filtering [ Eurocrypt 2022 ]
Universal computational extractors and multi-bit AIPO from lattice assumptions [ Eurocrypt 2025 ]
GGH15 beyond permutation branching programs: proofs, attacks, and candidates [ Crypto 2018 ]
Learning with alternating moduli, Arora-Ge over composite moduli, and weak PRFs [ Crypto 2026 ]
Public-key encryption and injective trapdoor functions from LWE with large noise rate [ SAC 2025 ]
Whitebox cryptography with device-binding from token-based obfuscation and more [ Cosade 2023 ]
Hardness of range avoidance and remote point for restricted circuits via cryptography [ STOC 2024 ]
QSETH strikes again: finer quantum lower bounds for lattice problem, ...... , and more [ Approx 2025 ]
AICrypto: a comprehensive benchmark for evaluating cryptography capabilities of LLMs [ ICML 2026 ]
CREBench: evaluating large language models in cryptographic binary reverse engineering [ COLM 2026 ]
Ph.D. Students
李文杰 Wenjie Li
骆晗 Han Luo
季利恒 Liheng Ji
陈思元 Siyuan Chen
陈铭意 Mingyi Chen
Master Students
毕梦达 Mengda Bi
韩新淼 Xinmiao Han
