A. Aggarwal, K. Gavin, T. Brennen, M. Lee, M. Santha et al., Quantum attacks on bitcoin, and how to protect against them. arXiv preprint, 2017.

M. R. Albrecht, C. Cid, J. Faugère, and L. Perret, Algebraic algorithms for LWE. Cryptology ePrint Archive, 1018.
DOI : 10.1145/2815111.2815158

URL : https://hal.archives-ouvertes.fr/hal-01072721

M. R. Albrecht, R. Fitzpatrick, and F. Göpfert, On the Efficacy of Solving LWE by Reduction to Unique-SVP, LNCS, vol.13, issue.8565, pp.293-310, 2014.
DOI : 10.1007/978-3-319-12160-4_18

A. , S. Arora, and R. Ge, New algorithms for learning in presence of errors, ICALP 2011, pp.403-415, 2011.

R. Martin and . Albrecht, On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL, EURO- CRYPT 2017, Part II, pp.103-129, 2017.

R. Martin, R. Albrecht, S. Player, and . Scott, On the concrete hardness of learning with errors, Journal of Mathematical Cryptology, vol.9, issue.3, pp.169-203, 2015.

W. Banaszczyk, Inequalities for convex bodies and polar reciprocal lattices inR n, Discrete & Computational Geometry, vol.7, issue.2, pp.217-231, 1995.
DOI : 10.1007/978-3-642-88330-9

A. Bcg-`-14abcg-`-bcg-`-14a.-eli-ben-sasson, C. Chiesa, M. Garman, I. Green, E. Miers et al., Zerocash: Decentralized anonymous payments from bitcoin, 2014 IEEE Symposium on Security and Privacy, pp.459-474, 2014.

A. Bcg-`-14bbcg-`-bcg-`-14b.-eli-ben-sasson, C. Chiesa, M. Garman, I. Green, E. Miers et al., Zerocash: Decentralized anonymous payments from Bitcoin, Cryptology ePrint Archive, vol.349349, 2014.

. Bci-`-13bci-`-bci-`-13.-nir, A. Bitansky, Y. Chiesa, R. Ishai, O. Ostrovsky et al., Succinct non-interactive arguments via linear interactive proofs, TCC 2013, pp.315-333, 2013.

D. Boneh and M. K. Franklin, Identity-based encryption from the Weil pairing, LNCS, vol.2139, pp.213-229, 2001.
DOI : 10.1137/s0097539701398521

URL : http://eprint.iacr.org/2001/090.ps.gz

M. Blum, P. Feldman, and S. Micali, Non-interactive zero-knowledge and its applications (extended abstract) NIZKs with an untrusted CRS: Security in the face of parameter subversion, 20th ACM STOC ASIACRYPT 2016, pp.103-112, 1988.

M. Bellare and O. Goldreich, On Defining Proofs of Knowledge, CRYPTO'92, pp.390-420, 1993.
DOI : 10.1007/3-540-48071-4_28

S. Bai and S. D. Galbraith, Lattice Decoding Attacks on Binary LWE, LNCS, vol.14, issue.8544, pp.322-337, 2014.
DOI : 10.1007/978-3-319-08344-5_21

URL : http://eprint.iacr.org/2013/839.pdf

D. Boneh, R. Gennaro, S. Goldfeder, and S. Kim, A lattice-based universal thresholdizer for cryptographic systems, Cryptology ePrint Archive, vol.251, 2017.

. Bgi-`-01bgi-`-bgi-`-01, O. Boaz-barak, R. Goldreich, S. Impagliazzo, A. Rudich et al., On the (im)possibility of obfuscating programs, LNCS, vol.2139, pp.1-18, 2001.

D. Boneh, Y. Ishai, A. Sahai, and D. J. Wu, Lattice-Based SNARGs and Their Application to More Efficient Obfuscation, EUROCRYPT 2017, Part II, pp.247-277, 2017.
DOI : 10.1007/3-540-09519-5_73

B. , D. Boneh, Y. Ishai, A. Sahai, and D. J. Wu, Quasi-optimal snargs via linear multi-prover interactive proofs, Cryptology ePrint Archive Report, vol.133133, 2018.

D. Boneh and A. Silverberg, Applications of multilinear forms to cryptography, Contemporary Mathematics, vol.324, pp.71-90, 2002.
DOI : 10.1090/conm/324/05731

E. Ben-sasson, I. Bentov, Y. Horesh, and M. Riabzev, Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive, BV11. Zvika Brakerski and Vinod Vaikuntanathan. Efficient fully homomorphic encryption from (standard) LWE, pp.52-97, 2011.

C. I. Chillotti, N. Gama, M. Georgieva, and M. Izabachène, Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds, ASIACRYPT 2016, Part I, pp.3-33, 2016.
DOI : 10.1145/1060590.1060603

I. Damgård, Towards Practical Public Key Systems Secure Against Chosen Ciphertext attacks, CRYPTO'91, pp.445-456, 1992.
DOI : 10.1007/3-540-46766-1_36

G. Danezis, C. Fournet, J. Groth, and M. Kohlweiss, Square span programs with applications to succinct NIZK arguments ASI- ACRYPT 2014, Part I FHEW: Bootstrapping homomorphic encryption in less than a second, DM15. Léo Ducas and Daniele Micciancio EUROCRYPT 2015, pp.532-550, 2014.

D. Steven and . Galbraith, Space-efficient variants of cryptosystems based on learning with errors. preprint, 2013.

G. , R. Gennaro, C. Gentry, B. Parno, and M. Raykova, Quadratic span programs and succinct NIZKs without PCPs Coded-BKW: Solving LWE using lattice codes, EUROCRYPT 2013 GJS15. Qian Guo, Thomas Johansson, and Paul Stankovski CRYPTO 2015, pp.626-645, 2013.
DOI : 10.1007/978-3-642-38348-9_37

URL : http://eprint.iacr.org/2012/215.pdf

S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems, SIAM Journal on Computing, vol.18, issue.1, pp.186-208, 1989.
DOI : 10.1137/0218012

J. Groth, Short Pairing-Based Non-interactive Zero-Knowledge Arguments, ASIACRYPT 2010, pp.321-340, 2010.
DOI : 10.1007/978-3-642-17373-8_19

URL : http://www.brics.dk/%7Ejg/ShortNIZK.pdf

J. Kilian, A note on efficient zero-knowledge proofs and arguments (extended abstract) Karchmer and A. Wigderson. On span programs, 24th ACM STOC Proc. of the 8th IEEE Structure in Complexity Theory, pp.723-732, 1992.
DOI : 10.1145/129712.129782

URL : http://ww2.cs.fsu.edu/~mcdonald/docs/note-zkp.pdf

R. Lindner and C. Peikert, Better Key Sizes (and Attacks) for LWE-Based Encryption, CT-RSA 2011, pp.319-339, 2011.
DOI : 10.1007/3-540-45708-9_19

URL : http://www.cc.gatech.edu/~cpeikert/pubs/lwe-analysis.pdf

S. Micali, CS proofs (extended abstracts), 35th FOCS, pp.436-453, 1994.
DOI : 10.1109/sfcs.1994.365746

D. Micciancio and C. Peikert, Hardness of SIS and LWE with Small Parameters, CRYPTO 2013, pp.21-39, 2013.
DOI : 10.1007/978-3-642-40041-4_2

B. Parno, J. Howell, C. Gentry, and M. Raykova, Pinocchio, 2013 IEEE Symposium on Security and Privacy, pp.238-252, 2013.
DOI : 10.1007/978-1-4614-1460-5

R. and O. Regev, On lattices, learning with errors, random linear codes, and cryptography, 37th ACM STOC, pp.84-93, 2005.
DOI : 10.1145/1568318.1568324

URL : http://www.cs.tau.ac.il/~odedr/papers/qcrypto.pdf