Post-quantum cryptography

"How long do you want your messages to remain secret?"

1. Lattices in Computer Science
   School of Computer Science Tel Aviv University - by Oded Regev

2. Lattices, Learning with Errors and Post-Quantum Cryptography
   Massachusetts Institute of Technology (MIT) - by Vinod Vaikuntanathan

3.  Cryptography Made Simple - by Nigel P. Smart

4. CS 251: Blockchain Technologies
   Stanford School of Engineering

5. Blockchain Foundations

Stanford School of Engineering - by Dr. Dionysis Zindros and Prof. David Tse

Dr. Dionysis Zindro

• Trapdoor mechanisms

1. AP08 Generating shorter bases for hard random lattices

2. GVP08 Trapdoors for Hard Lattices and New Cryptographic Constructions

3. GVP08 How to Use a Short Basis: Trapdoors for Hard Lattices and New Cryptographic Constructions

4. MP12 Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

• Encryption 

1. CHKP10 - How to Delegate a Lattice Basis

2. ABB10 - Efficient Lattice (H)IBE in the Standard Model 

3. ABB10b - Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE

4. Singh14 - Efficient Lattice HIBE in the Standard Model with Shorter Public Parameters

5. 2011 - Fuzzy Identity-Based Encryption from Lattices

6. BGG+14 Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE, and Compact Garbled Circuits

7. 2/2016 Yamada - Adaptively Secure Identity-Based Encryption from Lattices with asymptotically Shorter Public Parameters

8. 8/2016 Katsumata - Yamada Partitioning via Non-Linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps

9. 2/2019 Improved Lattice-based CCA2-Secure PKE in the Standard Model

10. 9/2020 A Simple and Efficient CCA-Secure Lattice KEM in the Standard Model 

• Signature

1. Lattice-Based Identification Schemes Secure Under Active Attacks

2. Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures

3. Lattice signatures without trapdoors

4. Tightly-Secure Signatures From Lossy Identification Schemes

5. Lattice Signatures and Bimodal Gaussians

6. An improved compression technique for signatures based on learning with errors

7. Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings

8. CRYSTALS - Dilithium: Digital Signatures from Module Lattices

9. Forking Lemmas in the Ring Signatures' Scenario

10. Towards Practical Lattice-Based One-Time Linkable Ring Signatures

• Ring LWE

  1. LPR10 - On Ideal Lattices and Learning with Errors over Rings

  2. LPR13 - A Toolkit for Ring-LWE Cryptography