1. On lattices, learning with errors, random linear codes, and cryptography;O. Regev
2. Classical Hardness of Learning with Errors;Z. Brakerski
3. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract;C. Peikert
4. Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits;D. Boneh,2014
5. Efficient fully homomorphic encryption from (standard) LWE;Z. Brakerski