Teaching
Lattices (Fall 2024)
Fundamentals of cryptography (Spring 2024)
Lattices (Fall 2023)
Fundamentals of cryptography (Spring 2023)
Lattices (Fall 2022)
Fundamentals of cryptography (Spring 2022)
Fundamentals of cryptography (Spring 2021)
Lattices (Fall 2024)
Fundamentals of cryptography (Spring 2024)
Lattices (Fall 2023)
Fundamentals of cryptography (Spring 2023)
Lattices (Fall 2022)
Fundamentals of cryptography (Spring 2022)
Fundamentals of cryptography (Spring 2021)
Ph.D. Students
毕梦达 Mengda Bi
李文杰 Wenjie Li
骆晗 Han Luo
季利恒 Liheng Ji
毕梦达 Mengda Bi
李文杰 Wenjie Li
骆晗 Han Luo
季利恒 Liheng Ji
Master Students
韩新淼 Xinmiao Han
韩新淼 Xinmiao Han
Program Committee
Crypto 2025, 2024, 2023
Theory of Cryptography Conference (TCC) 2024, 2022, 2021
Asiacrypt 2023, 2022, 2020, 2019
Eurocrypt 2020
Workshop on Encrypted Computing & Applied Homomorphic Cryptography (WAHC) 2023, 2022, 2021, 2020, 2019
Public Key Cryptography (PKC) 2024, 2018
IACR Communications in Cryptology 2024
Crypto 2025, 2024, 2023
Theory of Cryptography Conference (TCC) 2024, 2022, 2021
Asiacrypt 2023, 2022, 2020, 2019
Eurocrypt 2020
Workshop on Encrypted Computing & Applied Homomorphic Cryptography (WAHC) 2023, 2022, 2021, 2020, 2019
Public Key Cryptography (PKC) 2024, 2018
IACR Communications in Cryptology 2024
Papers I recommend
On computable numbers, with an application to the Entscheidungsproblem [ P. LMS, 1937 ]
Stein's method of bounding the error in the central limit theorem [ Berkeley Symposium on Statistics, 1972, link ]
New directions in cryptography [ IEEE transactions on information theory, 1976 ]
Secure communications over insecure channels [ C. ACM 1978, link ]
The RSA paper [ C. ACM 1978, link ]
Mental Poker [ The Mathematical Gardner 1981, link ]
Factoring polynomials with rational coefficients [ Math ann. 1982, link ]
Blind signatures for untraceable payments [ Crypto 1982, link ]
Protocols for secure communications [ FOCS 1982, link, link2 ]
Probabilistic encryption [ JoCSS 1984 ]
The knowledge complexity of interactive proof systems [ STOC 1985, link ]
Counting points on elliptic curves over finite fields [ Mathematics of computation 1985, the 1995 version ]
The Weil pairing, and its efficient calculation [ Manuscript 1986, link; J.Cryptography 2004 link ]
Barrington's theorem [ STOC 1986, link ]
Factoring integers with elliptic curves [ Math ann. 1987, link ]
On the randomness of Legendre and Jacobi sequences [ Crypto 1988, link ]
Constant depth circuits, Fourier transform, and learnability [ FOCS 1989, link ]
On the power of quantum computation [ FOCS 1994, link ]
Molecular computation of solutions to combinatorial problems [ Nature 1994, link ]
A framework for fast quantum mechanical algorithms [ STOC 1996, link ]
Generating hard instances of lattices problems [ STOC 1996, link ]
Hard homogeneous spaces [ Manuscript 1997, eprint 2006, link ]
Quantum computation by adiabatic evolution [ 2000, link ]
Zero-knowledge and code obfuscation [ Asiacrypt 2000, link ]
On the (im)possibility of obfuscating programs [ Crypto 2001, link ]
Quantum algorithms for some hidden shift problems [ SODA 2003, link ]
Applications of multilinear forms to cryptography [ Contemporary math 2003, link ]
The cryptographic impact of groups with infeasible inversion [ Master Thesis 2003, link ]
Adiabatic quantum state generation and statistical zero knowledge [ STOC 2003, link ]
Exponential algorithmic speedup by a quantum walk [ STOC 2003, link ]
On lattices, learning with errors, random linear codes, and cryptography [ STOC 2005, link ]
Counting lattice vectors [ 2005, link ]
Trapdoors for hard lattices and new cryptographic constructions [ STOC 2008, link ]
Bitcoin, a peer-to-peer electronic casino [ 2008, link ]
Quantum algorithm for linear systems of equations [ Physics review 2009, link ]
Quantum algorithms using the curvelet transform [ STOC 2009, link ]
A fully homomorphic encryption scheme [ PhD Thesis 2009, link ]
Efficient fully homomorphic encryption from standard LWE [ FOCS 2011, link ]
Candidate multilinear maps from ideal lattices [ Eurocrypt 2013, link ]
Candidate indistinguishability obfuscation and functional encryption for all circuits [ FOCS 2013, link ]
The sphere packing problem in dimension 8 [ Ann. Math 2017, link ]
Quantum recommendation systems [ ITCS 2017, link ]
A reverse Minkowski theorem [ STOC 2017, link ]
A discrete Fourier transform on lattices with quantum applications [ Qcrypt 2017, link ]
Cryptographic invariant map [ Mathcrypt 2018, link ]
Weil descent and cryptographic trilinear maps [ 2019, link ]
A simple explanation for the existence of adversarial examples of small Hamming distance [ 2019, link ]
Lattices with exponentially large kissing numbers [ 2019, link; turns out to be still open link ]
On one-way functions and Kolmogorov complexity [ FOCS 2020, link ]
NP-hardness of learning problems and partial MCSP [ FOCS 2022, link, slides ]
On computable numbers, with an application to the Entscheidungsproblem [ P. LMS, 1937 ]
Stein's method of bounding the error in the central limit theorem [ Berkeley Symposium on Statistics, 1972, link ]
New directions in cryptography [ IEEE transactions on information theory, 1976 ]
Secure communications over insecure channels [ C. ACM 1978, link ]
The RSA paper [ C. ACM 1978, link ]
Mental Poker [ The Mathematical Gardner 1981, link ]
Factoring polynomials with rational coefficients [ Math ann. 1982, link ]
Blind signatures for untraceable payments [ Crypto 1982, link ]
Protocols for secure communications [ FOCS 1982, link, link2 ]
Probabilistic encryption [ JoCSS 1984 ]
The knowledge complexity of interactive proof systems [ STOC 1985, link ]
Counting points on elliptic curves over finite fields [ Mathematics of computation 1985, the 1995 version ]
The Weil pairing, and its efficient calculation [ Manuscript 1986, link; J.Cryptography 2004 link ]
Barrington's theorem [ STOC 1986, link ]
Factoring integers with elliptic curves [ Math ann. 1987, link ]
On the randomness of Legendre and Jacobi sequences [ Crypto 1988, link ]
Constant depth circuits, Fourier transform, and learnability [ FOCS 1989, link ]
On the power of quantum computation [ FOCS 1994, link ]
Molecular computation of solutions to combinatorial problems [ Nature 1994, link ]
A framework for fast quantum mechanical algorithms [ STOC 1996, link ]
Generating hard instances of lattices problems [ STOC 1996, link ]
Hard homogeneous spaces [ Manuscript 1997, eprint 2006, link ]
Quantum computation by adiabatic evolution [ 2000, link ]
Zero-knowledge and code obfuscation [ Asiacrypt 2000, link ]
On the (im)possibility of obfuscating programs [ Crypto 2001, link ]
Quantum algorithms for some hidden shift problems [ SODA 2003, link ]
Applications of multilinear forms to cryptography [ Contemporary math 2003, link ]
The cryptographic impact of groups with infeasible inversion [ Master Thesis 2003, link ]
Adiabatic quantum state generation and statistical zero knowledge [ STOC 2003, link ]
Exponential algorithmic speedup by a quantum walk [ STOC 2003, link ]
On lattices, learning with errors, random linear codes, and cryptography [ STOC 2005, link ]
Counting lattice vectors [ 2005, link ]
Trapdoors for hard lattices and new cryptographic constructions [ STOC 2008, link ]
Bitcoin, a peer-to-peer electronic casino [ 2008, link ]
Quantum algorithm for linear systems of equations [ Physics review 2009, link ]
Quantum algorithms using the curvelet transform [ STOC 2009, link ]
A fully homomorphic encryption scheme [ PhD Thesis 2009, link ]
Efficient fully homomorphic encryption from standard LWE [ FOCS 2011, link ]
Candidate multilinear maps from ideal lattices [ Eurocrypt 2013, link ]
Candidate indistinguishability obfuscation and functional encryption for all circuits [ FOCS 2013, link ]
The sphere packing problem in dimension 8 [ Ann. Math 2017, link ]
Quantum recommendation systems [ ITCS 2017, link ]
A reverse Minkowski theorem [ STOC 2017, link ]
A discrete Fourier transform on lattices with quantum applications [ Qcrypt 2017, link ]
Cryptographic invariant map [ Mathcrypt 2018, link ]
Weil descent and cryptographic trilinear maps [ 2019, link ]
A simple explanation for the existence of adversarial examples of small Hamming distance [ 2019, link ]
Lattices with exponentially large kissing numbers [ 2019, link; turns out to be still open link ]
On one-way functions and Kolmogorov complexity [ FOCS 2020, link ]
NP-hardness of learning problems and partial MCSP [ FOCS 2022, link, slides ]
Websites/Lecture notes
Damien Stehle on Lattices [ site ]
Oded Regev Lattice Fall 2004 [ site ]
Scott Aaronson: quantum states from quantum money to blackholes [ pdf ]
Sanjeev Arora: A Theorist's toolkit [ site ]
Damien Stehle on Lattices [ site ]
Oded Regev Lattice Fall 2004 [ site ]
Scott Aaronson: quantum states from quantum money to blackholes [ pdf ]
Sanjeev Arora: A Theorist's toolkit [ site ]
Surveys
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 ]
The Riemann Hypothesis [ pdf, slides ]
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 ]
The Riemann Hypothesis [ pdf, slides ]
Talks related to cryptography
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 :(
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 :(
Courses taken
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)
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)
Best movies watched in the cinema
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)
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)