Back to homepage

Plan

Our reading group foscuses on learning background in Cryptography and Lattice Theory.
The idea is to prepare background for research students to start reading papers in Lattice Crypto.
The seminar starts from October 08, 2019 and is organized twice a week and every participant
takes turn to present the designed materials such as chapters, survey or papers.

You are welcome to join our seminar. Please contact me or Dr. Partha Sarathi Roy.

Schedule

Date Time Place Contents References Speaker
Oct 08, 2019 10:30-12:00 Automata [S]-Chapter 1 Priyanka
Oct 10, 2019 10:30-12:00 Automata (con't) [S]-Chapter 2 Priyanka
Oct 15, 2019 10:30-12:00 Turing machine [S]-Chapter 3,4 Huy
Oct 17, 2019 10:30-12:00 Turing machine (con't) [S]-Chapter 5,6 Huy
Oct 22, 2019 10:30-12:00 Computational complexity [S]-Chapter 7 Partha
Oct 24 2019 10:30-12:00 Computational complexity (con't) [S]-Chapter 10 Partha
----------- ----------- ----------- -----------
Nov 04 2019 10:30-12:30 15-107 Introduction to Lattices [R] - Lecture 1 Priyanka
Nov 07 2019 10:30-12:30 15-107 LLL Algorithm [R] - Lecture 2 Dung
Nov 11 2019 10:30-12:30 15-107 Babai's Nearest Plane Algorithm [R] - Lecture 3 Huy
Nov 14 2019 10:30-12:30 15-107 Dual lattices [R] Lecture 9 Partha
Nov 18 2019 10:30-12:30 15-107 Gaussian Distribution [MR04] Dung
Nov 21 2019 11:30-13:30 15-107 SIS & Worst-case to average-case reduction [R] - Lecture 12 Partha
Nov 25 2019 10:30-12:30 15-107 LWE [V] Lecture 1-4 Partha
Nov 28 2019 9:00-11:00 15-107 Ring-SIS/LWE [V] Lecture 5,6 Dung
Dec 02 2019 10:30-12:30 19-2104 MP-LWE [RSSS17] Huy
Dec 05 2019 10:30-12:30 Break
Dec 09 2019 10:30-12:30 Break
Dec 12 2019 10:30-12:30 19-2104 GPV08 [GPV08] Priyanka
Dec 16 2019 10:30-12:30 19-2104 ABB10 [ABB10] Huy
Dec 19 2019 10:30-12:30 19-2104 CHKP10 [CHKP10] Dung
Dec 23 2019 10:30-12:30 19-2104 MP12 [MP12] Partha

References

[S] Michael Sipser: Introduction to the theory of computation, third edition, Cengage Learning, 2013
[V] Vinod Vaikuntanathan: Lectures on Learning with Errors and Post-Quantum Cryptography, MIT 2018
[R] Oded Regev: Lectures on Lattices in Computer Science, Tel Aviv University, 2009
[MR04] Daniele Micciancio and Oded Regev: Worst-Case to Average-Case Reductions Based on Gaussian Measures. SIAM J. Comput. 37(1): 267-302 (2007)
[SD] Noah Stephens-Davidowitz: Mini course on lattices
[GPV08] Craig Gentry, Chris Peikert, Vinod Vaikuntanathan: Trapdoors for hard lattices and new cryptographic constructions. STOC 2008: 197-206
[ABB10] Shweta Agrawal, Dan Boneh, Xavier Boyen: Efficient Lattice (H)IBE in the Standard Model. EUROCRYPT 2010: 553-572
[MP12] Daniele Micciancio, Chris Peikert: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. EUROCRYPT 2012: 700-718
[GM18] Nicholas Genise, Daniele Micciancio: Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus. EUROCRYPT (1) 2018: 174-203
[RSSS17] Miruna Rosca, Amin Sakzad, Damien Stehlé, Ron Steinfeld: Middle-Product Learning with Errors. CRYPTO (3) 2017: 283-297
[CHKP10] David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert: Bonsai Trees, or How to Delegate a Lattice Basis. EUROCRYPT 2010: 523-552