This quarter we will read, present and discuss a number of recent research papers in cryptography. Class meets every Wednesday 9-10am in CSE 4258.
IACR Cryptology ePrint Archive
Jan 10: Introduction
Jan 17: Improving TFHE: faster packed homomorphic operations and efficient circuit boostrapping
(Chillotti, Gama, Georgieva, Izabachene - Asiacrypt 2017)
Presenter: Daniele Micciancio
Jan 24: Fully Homomorphic Encryption from the Finite Field Isomorphism Problem
(Doroz, Hoffstein, Pipher, Silverman, Sunar, Whyte, Zhang - PKC 2018)
Presenter: Michael Borkowski
Jan 31: Shortest Vector from Lattice Sieving: a Few Dimensions for Free
(Ducas - Eurocrypt 2018)
Presenter: Jessica Sorrell
Feb 7: Scrypt is Maximally Memory-Hard
(Alwen, Chen, Pietrzak, Reyzin, Tessaro - Eurocrypt 2017)
Presenter: Joseph Jaeger
Feb 14: Private Puncturable PRFs From Standard Lattice Assumptions
(Boneh, Kim, Montgomery - Eurocrypt 2017)
Presenter: Baiyu Li
Feb 21: Verifiable Computation: From Polynomials and Graphs to Databases and RAM Programs (Special Seminar)
Speaker: Charalampos Papamanthou (U. Maryland)
Feb 28: Multi-Key Searchable Encryption, Revisited
(Hamlin, shelat, Weiss, Wichs - PKC 2018)
Presenter: Ruth Ng
March 7: Ligero: Lightweight Sublinear Arguments Without a Trusted Setup
(Ames, Hazay, Ishai, Venkitasubramaniam - ACM CCS 2017)
Presenter: Peyman Razaghi (Qualcomm)
March 14: On the Bit Security of Cryptographic Primitives
(Micciancio, Walter - Eurocrypt 2018)
Presenter: Nick Genise