助理教授
密码学
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".
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 ]
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 ]
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 ]
Hardness of range avoidance and remote point for restricted circuits via cryptography [ STOC 2024 ]
毕梦达 Mengda Bi
李文杰 Wenjie Li
骆晗 Han Luo
季利恒 Liheng Ji
韩新淼 Xinmiao Han
Iterative decoding of low-density parity check codes [ pdf ]
Isogeny volcanoes [ pdf ]
Computational problems in supersingular elliptic curve isogenies [ pdf ]
Quantum linear systems algorithms: a primer [ pdf ]
Pseudorandom functions: three decades later [ pdf ]
Computing rational points on curves [ pdf ]
Another look at generic groups [ pdf ]
A pragmatic introduction to secure multi-party computation [ pdf ]
Unique game conjecture [ pdf ]
Elliptic curves, cryptography, and computation [ 2010 ECC workshop, link, pdf ]
Quantum computing and limits of the efficiently computable [ 2011 CMU Buhl lecture, link ]
Quantum computing, a great science in the making [ 2012 @Brown University, link ]
A history of the development of NTRU [ 2014 @Eurocrypt, link ]
Pairing in cryptography [ 2015 Simons crypto summer program lecture, link ]
Sphere packing, lattice packing, and related problems [ ICERM lattice, link ]
Algorand, the public ledger [ Avi60, link ] warning: 42:25, this is capitalism, not democracy; this is not good :(
6.876J Lattices (Fall 2015, link)
MA 779 Probability (Fall 2014)
CS 655 Networking (Fall 2013, link)
CS 537 Randomness (Fall 2013, link)
6.892 Computing on Encrypted Data (Fall 2013, link)
CS 512 Formal Method (Spring 2013, link)
CS 558 Network Security (Spring 2013)
8197 Analysis of Boolean Functions (Spring 2013, link)
CS 530 Complexity (Fall 2012)
CS 538 Cryptography (Fall 2012)
6.s898 The Evolution of a Proof (Fall 2012, link)
La double vie de Véronique
Amadeus
花样年华 (In the mood of love)
东邪西毒 (Ashes of time)
Андрей Рублёв
Trois couleurs: Bleu
Paris, Texas
Alice in the cities
Cléo de 5 à 7
Before sunrise
Before sunset
Before midnight
Close-up
Dead poets society
Dog day afternoon
Pociąg (Night train)
Through the olive trees
Persona
Seven samurai
爱情神话
Le bonheur
...
8 1/2 (get lost at some point)
La Dolce Vita (fall asleep for 30 mins)