A. T. Acar, M. Belenkiy, M. Bellare, and D. Cash, Cryptographic Agility and Its Relation to Circular Encryption, pp.403-422, 2010.
DOI : 10.1007/978-3-642-13190-5_21

URL : http://research.microsoft.com/pubs/121045/117.pdf

C. F. Armknecht, C. Boyd, K. Carr, A. Gjosteen, C. A. Jaschke et al., A Guide to Fully Homomorphic Encryption, 2016.

S. [. Albrecht, L. Bai, and . Ducas, A Subfield Lattice Attack on Overstretched NTRU Assumptions, pp.153-178, 2016.
DOI : 10.1007/978-1-4612-1934-7

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

M. J. Alwen, P. Barbosa, R. Farshim, S. D. Gennaro, S. Gordon et al., On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption, pp.65-84, 2013.
DOI : 10.1007/978-3-642-45239-0_5

W. [. Atallah and . Du, Secure Multi-party Computational Geometry, International Workshop on Algorithms and Data Structures, pp.165-179, 2001.
DOI : 10.1007/3-540-44634-6_16

URL : http://www.cis.syr.edu/~wedu/Research/paper/wads2001.ps

E. [. Ayday, J. De-cristofaro, G. Hubaux, and . Tsudik, The Chills and Thrills of Whole Genome Sequencing, Computer, pp.1-20, 2013.
DOI : 10.1109/MC.2013.333

URL : http://arxiv.org/pdf/1306.1264

C. [. Alperin-sheriff and . Peikert, Faster Bootstrapping with Polynomial Error, pp.297-314, 2014.
DOI : 10.1007/978-3-662-44371-2_17

M. [. Boneh and . Franklin, An Efficient Public Key Traitor Tracing Scheme, pp.338-353, 1999.
DOI : 10.1007/3-540-48405-1_22

URL : https://link.springer.com/content/pdf/10.1007%2F3-540-48405-1_22.pdf

M. [. Boneh and . Franklin, Identity-Based Encryption from the Weil Pairing, pp.213-229, 2001.
DOI : 10.1137/s0097539701398521

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

]. D. Bgh-+-13a, C. Boneh, S. Gentry, F. Halevi, D. J. Wang et al., Private Database Queries Using Somewhat Homomorphic Encryption, Proceedings of the 11th International Conference on Applied Cryptography and Network Security, ACNS'13, pp.102-118, 2013.

]. Z. Bgh13b, C. Brakerski, S. Gentry, and . Halevi, Packed Ciphertexts in LWE- Based Homomorphic Encryption, Public-Key Cryptography ? PKC 2013, pp.1-13

C. [. Brakerski, V. Gentry, and . Vaikuntanathan, Fully Homomorphic Encryption Without Bootstrapping, Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS '12, pp.309-325
DOI : 10.1145/2633600

URL : http://people.csail.mit.edu/vinodv/6892-Fall2013/BGV.pdf

. A. Bhw15, S. Bishop, B. Hohenberger, . [. Waters, K. Bos et al., New Circular Security Counterexamples from Decision Linear and Learning with Errors Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme, pp.776-800, 2015.

K. [. Bos, M. Lauter, and . Naehrig, Private predictive analysis on encrypted medical data, Journal of Biomedical Informatics, vol.50, 2013.
DOI : 10.1016/j.jbi.2014.04.003

URL : https://doi.org/10.1016/j.jbi.2014.04.003

Z. Brakerski, A. Langlois, C. Peikert, O. Regev, and D. Stehlé, Classical hardness of learning with errors, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC '13, pp.575-584, 2013.
DOI : 10.1145/2488608.2488680

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

A. [. Bösch, P. Peter, W. Hartel, and . Jonker, SOFIR: Securely outsourced Forensic image recognition, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.2694-2698, 2014.
DOI : 10.1109/ICASSP.2014.6854089

]. Z. Bra12 and . Brakerski, Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP, pp.868-886, 2012.

G. [. Boneh, B. Segev, and . Waters, Targeted malleability, Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on, ITCS '12, pp.350-366
DOI : 10.1145/2090236.2090264

]. Z. Bv11a, V. Brakerski, and . Vaikuntanathan, Efficient Fully Homomorphic Encryption from (Standard) LWE, Proceedings of the 2011 IEEE 52Nd Annual Symposium on Foundations of Computer Science, pp.97-106, 2011.

]. Z. Bv11b, V. Brakerski, and . Vaikuntanathan, Fully Homomorphic Encryption from ring-LWE and Security for Key-Dependent Messages, Proceedings of the 31st Annual Conference on Advances in Cryptology, pp.505-524, 2011.

V. [. Brakerski and . Vaikuntanathan, Lattice-based FHE as secure as PKE, Proceedings of the 5th conference on Innovations in theoretical computer science, ITCS '14, pp.1-12, 2014.
DOI : 10.1145/2554797.2554799

URL : http://dspace.mit.edu/bitstream/1721.1/90959/1/V_Lattice-based.pdf

S. A. Canteaut, C. Carpov, T. Fontaine, M. Lepoint, P. Naya-plasencia et al., How to Compress Homomorphic Ciphertexts, Research Report, vol.113, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01237297

J. J. Cheon, J. Coron, M. S. Kim, T. Lee, M. Lepoint et al., Batch Fully Homomorphic Encryption over the Integers, Multiparty Computation from Threshold Homomorphic Encryption, pp.315-335, 2001.
DOI : 10.1007/978-3-642-38348-9_20

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

L. [. Cramer, C. Ducas, O. Peikert, and . Regev, Recovering Short Generators of Principal Ideals in Cyclotomic Rings, pp.559-585
DOI : 10.1007/978-3-662-49896-5_20

URL : https://ir.cwi.nl/pub/24685/24685B.pdf

]. I. Cggi16a, N. Chillotti, M. Gama, M. Georgieva, and . Izabachène, Faster Fully Homomorphic Encryption: Bootstrapping in less than 0.1 Seconds, IACR Cryptology ePrint Archive, 2016.

]. I. Cggi16b, N. Chillotti, M. Gama, M. Georgieva, and . Izabachène, A Homomorphic LWE Based E-voting Scheme, pp.245-265, 2016.

A. [. Conway and . Jones, Trigonometric diophantine equations (On vanishing sums of roots of unity), Acta Arithmetica, vol.30, issue.3, pp.229-240, 1976.
DOI : 10.4064/aa-30-3-229-240

URL : https://www.impan.pl/shop/publication/transaction/download/product/101027?download.pdf

[. Coron, T. Lepoint, and M. Tibouchi, Scale-Invariant Fully Homomorphic Encryption over the Integers, pp.311-328, 2014.
DOI : 10.1007/978-3-642-54631-0_18

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

M. [. Cicuta and . Mehta, Probability density of determinants of random matrices, Journal of Physics A: Mathematical and General, vol.33, issue.45, p.8029, 2000.
DOI : 10.1088/0305-4470/33/45/302

URL : http://arxiv.org/pdf/cond-mat/0011136v1.pdf

C. [. Clear and . Mcgoldrick, Multi-identity and Multi-key Leveled FHE from Learning with Errors, pp.630-656, 2015.
DOI : 10.1007/978-3-662-48000-7_31

URL : http://eprint.iacr.org/2014/798.pdf

[. Coron, A. Mandal, D. Naccache, and M. Tibouchi, Fully Homomorphic Encryption over the Integers with Shorter Public Keys, pp.487-504, 2011.
DOI : 10.1007/978-3-642-22792-9_28

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

. Cmo-+-14-]-x, C. Cao, M. O. Moore, N. Neill, E. O. Hanley et al., High- Speed Fully Homomorphic Encryption Over the Integers, pp.169-180, 2014.

P. [. Chen and . Nguyen, Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers, Proceedings of the 31st Annual International Conference on Theory and Applications of Cryptographic Techniques, EUROCRYPT'12, pp.502-519, 2012.
DOI : 10.1007/978-3-642-29011-4_30

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

[. Coron, D. Naccache, and M. Tibouchi, Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers, pp.446-464, 2012.
DOI : 10.1007/978-3-642-29011-4_27

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

]. C. Coc01 and . Cocks, An Identity Based Encryption Scheme Based on Quadratic Residues, pp.360-363, 2001.

N. [. Costache and . Smart, Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?, pp.325-340, 2016.
DOI : 10.1007/978-3-319-29485-8_19

URL : https://eprint.iacr.org/2015/889.pdf

S. [. Dahab, E. Galbraith, and . Morais, Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes, pp.283-296, 2015.
DOI : 10.1007/978-3-319-17470-9_17

D. [. Ducas and . Micciancio, FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second, pp.617-640, 2015.
DOI : 10.1007/978-3-662-46800-5_24

URL : https://ir.cwi.nl/pub/23686/23686B.pdf

D. [. Ducas and . Stehlé, Sanitization of FHE Ciphertexts, Proceedings of the 35th Annual International Conference on Advances in Cryptology ? EUROCRYPT 2016, pp.294-310
DOI : 10.1007/978-3-662-49890-3_12

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

]. J. Eve99 and . Evertse, The number of solutions of linear equations in roots of unity, Acta Arithmetica, vol.89, issue.1, pp.45-51, 1999.

R. [. Fiore, V. Gennaro, and . Pastro, Efficiently Verifiable Computation on Encrypted Data, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, CCS '14, pp.844-855, 2014.
DOI : 10.1137/0218012

URL : http://eprint.iacr.org/2014/202.pdf

]. S. Fsf-+-13, R. Fau, C. Sirdey, C. Fontaine, G. Aguilar-melchor et al., Towards Practical Program Execution over Fully Homomorphic Encryption Schemes, Proceedings of the 2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 3PGCIC '13, pp.284-290, 2013.

F. [. Fan and . Vercauteren, Somewhat Practical Fully Homomorphic Encryption, Cryptology ePrint Archive, 2012.

]. C. Gen09a and . Gentry, Computing on Encrypted Data, Proceedings of the 8th International Conference on Cryptology and Network Security, CANS '09, pp.477-477, 2009.

]. C. Gen09b and . Gentry, A Fully Homomorphic Encryption Scheme, p.3382729, 2009.

]. C. Gen09c and . Gentry, Fully Homomorphic Encryption Using Ideal Lattices, Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing, STOC '09, pp.169-178, 2009.

]. C. Gen10a and . Gentry, Computing Arbitrary Functions of Encrypted Data, Commun . ACM, vol.53, issue.3, pp.97-105, 2010.

]. C. Gen10b and . Gentry, Toward Basing Fully Homomorphic Encryption on Worstcase Hardness, Proceedings of the 30th Annual Conference on Advances in Cryptology, CRYPTO'10, pp.116-137, 2010.

]. S. Ggh-+-13, C. Garg, S. Gentry, M. Halevi, A. Raykova et al., Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits, Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS '13, pp.40-49, 2013.

C. [. Gennaro, B. Gentry, and . Parno, Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers, pp.465-482, 2010.
DOI : 10.1007/978-3-642-14623-7_25

URL : https://link.springer.com/content/pdf/10.1007%2F978-3-642-14623-7_25.pdf

S. [. Gentry and . Halevi, Hierarchical Identity Based Encryption with Polynomially Many Levels, pp.437-456, 2009.
DOI : 10.1007/11426639_7

]. C. Gh11a, S. Gentry, and . Halevi, Fully Homomorphic Encryption Without Squashing Using Depth-3 Arithmetic Circuits, Proceedings of the 2011 IEEE 52Nd Annual Symposium on Foundations of Computer Science, pp.107-109, 2011.

]. C. Gh11b, S. Gentry, and . Halevi, Implementing Gentry's Fully-homomorphic Encryption Scheme, Proceedings of the 30th Annual International Conference on Theory and Applications of Cryptographic Techniques: Advances in Cryptology, pp.129-148, 2011.

S. [. Gentry, C. Halevi, N. P. Peikert, and . Smart, Ring Switching in BGV-Style Homomorphic Encryption, Proceedings of the 8th International Conference on Security and Cryptography for Networks, SCN'12, pp.19-37, 2012.
DOI : 10.1007/978-3-642-32928-9_2

S. [. Gentry, C. Halevi, N. P. Peikert, and . Smart, Field switching in BGV-style homomorphic encryption, Journal of Computer Security, vol.21, issue.5, pp.663-684, 2013.
DOI : 10.3233/JCS-130480

URL : https://eprint.iacr.org/2012/240.pdf

]. C. Ghs12a, S. Gentry, N. P. Halevi, and . Smart, Better Bootstrapping in Fully Homomorphic Encryption, Proceedings of the 15th International Conference on Practice and Theory in Public Key Cryptography, PKC'12, pp.1-16, 2012.

]. C. Ghs12b, S. Gentry, N. P. Halevi, and . Smart, Fully Homomorphic Encryption with Polylog Overhead, Proceedings of the 31st Annual International Conference on Theory and Applications of Cryptographic Techniques, EUROCRYPT'12, pp.465-482, 2012.

]. C. Ghs12c, S. Gentry, N. P. Halevi, and . Smart, Homomorphic Evaluation of the AES Circuit, pp.850-867, 2012.

S. [. Gentry, V. Halevi, and . Vaikuntanathan, A Simple BGN-Type Cryptosystem from LWE, Proceedings of Eurocrypt 2010, pp.506-522, 2010.
DOI : 10.1007/978-3-642-13190-5_26

URL : http://www.cs.toronto.edu/~vinodv/lwe-bgn.pdf

P. [. Gama and . Nguyen, Predicting Lattice Reduction, pp.31-51
DOI : 10.1007/978-3-540-78967-3_3

]. R. Gra06, . Gray, C. Toeplitz, C. Matrices, A. Gentry et al., Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based, Advances in Cryptology ? CRYPTO 2013, pp.155-239, 2006.

F. [. Goubin and . Prado, Blending FHE-NTRU Keys ??? The Excalibur Property, p.2016
DOI : 10.1145/2517488.2517497

]. I. Hai08 and . Haitner, Semi-honest to Malicious Oblivious Transfer: The Black-box Way, Proceedings of the 5th Conference on Theory of Cryptography, TCC'08, pp.412-426, 2008.

J. [. Hoffstein, J. H. Pipher, and . Silverman, NTRU: A ring-based public key cryptosystem, In Lecture Notes in Computer Science, pp.267-288, 1998.
DOI : 10.1007/BFb0054868

URL : http://www.ntru.com/technology/../NTRUFTPDocsFolder/ANTS97.ps.gz

G. [. Hohenberger, A. Rothblum, V. Shelat, and . Vaikuntanathan, Securely Obfuscating Re-Encryption, Journal of Cryptology, vol.27, issue.11, pp.694-719, 2011.
DOI : 10.1145/1968.1972

URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-70936-7_13.pdf

V. [. Halevi and . Shoup, Algorithms in HElib, Advances in Cryptology ? CRYPTO 2014, pp.554-571, 2014.
DOI : 10.1007/978-3-662-44371-2_31

V. [. Halevi and . Shoup, Bootstrapping for HElib, pp.641-670
DOI : 10.1007/978-3-662-46800-5_25

A. [. Jeckmans, P. Peter, and . Hartel, Efficient Privacy-Enhanced Familiarity-Based Recommender System, pp.400-417, 2013.
DOI : 10.1007/978-3-642-40203-6_23

]. D. Kah96 and . Kahn, The codebreakers : the story of secret writing, 1996.

K. [. Kim and . Lauter, Private genome analysis through homomorphic encryption, BMC Medical Informatics and Decision Making, vol.8469, issue.2, p.3, 2015.
DOI : 10.1109/TASSP.1980.1163372

URL : https://bmcmedinformdecismak.biomedcentral.com/track/pdf/10.1186/1472-6947-15-S5-S3?site=bmcmedinformdecismak.biomedcentral.com

P. [. Kamara, M. Mohassel, and . Raykova, Outsourcing Multi-Party Computation, Cryptology ePrint Archive Report, vol.272, 2011.

J. [. Kipnis, L. Patarin, . [. Goubin, K. Koppula, B. Ramchen et al., Unbalanced Oil and Vinegar Signature Schemes, Separations in Circular Security for Arbitrary Length Key Cycles, pp.206-222, 1999.
DOI : 10.1007/3-540-48910-X_15

URL : https://link.springer.com/content/pdf/10.1007%2F3-540-48910-X_15.pdf

B. [. Koppula and . Waters, Circular Security Counterexamples for Arbitrary Length Cycles from LWE, IACR Cryptology ePrint Archive, p.117, 2016.
DOI : 10.1007/978-3-662-53008-5_24

E. [. López-alt, V. Tromer, and . Vaikuntanathan, On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption, Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.1219-1234, 2012.
DOI : 10.1145/2213977.2214086

[. Lee, P. Chung, and M. Hwang, A Survey on Attribute-based Encryption Schemes of Access Control in Cloud Environments, I. J. Network Security, vol.15, issue.4, pp.231-240, 2013.

]. H. Len78 and . Lenstra, Vanishing Sums of Roots of Unity On Vanishing Sums of Roots of Unity, Math. Centre Tracts Journal of Algebra, vol.101, issue.2241, pp.249-26891, 1978.

A. [. Lauter, M. López-alt, and . Naehrig, Private Computation on Encrypted Genomic Data, pp.3-27, 2015.

A. [. Loftus, N. P. May, F. Smart, and . Vercauteren, On CCA-Secure Somewhat Homomorphic Encryption, pp.55-72, 2012.
DOI : 10.1007/978-3-642-13013-7_25

URL : https://eprint.iacr.org/2010/560.pdf

M. [. Lepoint and . Naehrig, A Comparison of the Homomorphic Encryption Schemes FV and YASHE, AFRICACRYPT 2014, pp.318-335, 2014.
DOI : 10.1007/978-3-319-06734-6_20

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

M. [. Lauter, V. Naehrig, and . Vaikuntanathan, Can Homomorphic Encryption Be Practical, Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, pp.113-124, 2011.

C. [. Lyubashevsky, O. Peikert, and . Regev, On ideal lattices and learning with errors over rings, Proc. of EUROCRYPT, pp.1-23, 2010.
DOI : 10.1145/2535925

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

C. [. Lyubashevsky, O. Peikert, . Regev, . Toolkit-for-ring-lwe, and . Cryptography, , pp.35-54, 2013.

]. G. Maz11 and . Maze, Natural density distribution of Hermite normal forms of integer matrices, Journal of Number Theory, vol.131, issue.12, pp.2398-2408, 2011.

]. D. Mic01 and . Micciancio, Improving Lattice Based Cryptosystems Using the Hermite Normal Form, pp.126-145, 2001.

]. D. Mic11 and . Micciancio, The Geometry of Lattice Cryptography, pp.185-210

C. [. Micciancio and . Peikert, Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller, EUROCRYPT, pp.700-718, 2012.
DOI : 10.1007/978-3-642-29011-4_41

O. [. Nguyen and . Regev, Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures, pp.271-288, 2006.

G. [. Ogura, T. Yamamoto, S. Kobayashi, and . Uchiyama, An Improvement of Key Generation Algorithm for Gentry???s Homomorphic Encryption Scheme, pp.70-83, 2010.
DOI : 10.1007/978-3-642-13013-7_25

]. C. Pei16 and . Peikert, A Decade of Lattice Cryptography. Found. Trends Theor, Comput. Sci, vol.10, issue.4, pp.283-424, 2016.

W. [. Pernet and . Stein, Fast computation of Hermite normal forms of random integer matrices, Journal of Number Theory, vol.130, issue.7, pp.1675-1683, 2010.
DOI : 10.1016/j.jnt.2010.01.017

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

E. [. Peter, S. Tews, and . Katzenbeisser, Efficiently Outsourcing Multiparty Computation Under Multiple Keys, IEEE Transactions on Information Forensics and Security, vol.8, issue.12, pp.2046-2058, 2013.
DOI : 10.1109/TIFS.2013.2288131

L. [. Rivest, M. L. Adleman, and . Dertouzos, On Data Banks and Privacy Homomorphisms. Foundations of secure computation, pp.169-177, 1978.

]. O. Reg05 and . Regev, On Lattices, Learning with Errors, Random Linear Codes, and Cryptography, STOC, pp.84-93, 2005.

]. O. Reg10 and . Regev, The learning with errors problem, pp.191-204, 2010.

]. A. Sha85 and . Shamir, Identity-Based Cryptosystems and Signature Schemes, Sil13] A. Silverberg. Fully Homomorphic Encryption for Mathematicians. Cryptology ePrint Archive, pp.47-53, 1985.

]. S. Sin99 and . Singh, The Code Book: The Secret History of Codes and Codebreaking, 1999.

R. [. Stehlé and . Steinfeld, Faster Fully Homomorphic Encryption, Advances in Cryptology -ASIACRYPT 2010, pp.377-394, 2010.
DOI : 10.1007/978-3-642-17373-8_22

]. P. Ss11a, N. P. Scholl, and . Smart, Improved Key Generation for Gentry's Fully Homomorphic Encryption Scheme, pp.10-22, 2011.

]. D. Ss11b, R. Stehlé, and . Steinfeld, Making NTRU as Secure as Worst-Case Problems over Ideal Lattices, pp.27-47, 2011.

]. J. Ste08 and . Steinberger, Minimal vanishing sums of roots of unity with large coefficients, Proceedings of the, pp.689-717, 2008.

F. [. Smart and . Vercauteren, Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes, pp.420-443, 2010.
DOI : 10.1007/978-3-642-13013-7_25

URL : https://link.springer.com/content/pdf/10.1007%2F978-3-642-13013-7_25.pdf

F. [. Smart and . Vercauteren, Fully homomorphic SIMD operations. Designs, Codes and Cryptography, pp.57-81, 2014.
DOI : 10.1007/s10623-012-9720-4

URL : http://eprint.iacr.org/2011/133.pdf

B. [. Sahai and . Waters, Fuzzy Identity-Based Encryption, pp.457-473, 2005.
DOI : 10.1007/11426639_27

C. [. Thomae and . Wolf, Solving Underdetermined Systems of Multivariate Quadratic Equations Revisited, pp.156-171, 2012.
DOI : 10.1007/978-3-642-30057-8_10

URL : https://link.springer.com/content/pdf/10.1007%2F978-3-642-30057-8_10.pdf

]. V. Vai12 and . Vaikuntanathan, How to Compute on Encrypted Data, pp.1-15

]. M. Van-dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, Fully Homomorphic Encryption over the Integers, Proceedings of the 29th Annual International Conference on Theory and Applications of Cryptographic Techniques, EUROCRYPT'10, pp.24-43, 2010.
DOI : 10.1007/978-3-642-13190-5_2

]. J. Van-de-pol and N. P. Smart, Estimating Key Sizes for High Dimensional Lattice-Based Systems, pp.290-303, 2013.
DOI : 10.1007/978-3-642-45239-0_17

. M. Vyy15, S. Varia, Y. Yakoubov, and . Yang, HEtest: A Homomorphic Encryption Testing Framework, pp.213-230, 2015.

M. Yasuda, T. Shimoyama, J. Kogure, K. Yokoyama, and T. Koshiba, Secure pattern matching using somewhat homomorphic encryption, Proceedings of the 2013 ACM workshop on Cloud computing security workshop, CCSW '13, pp.65-76, 2013.
DOI : 10.1145/2517488.2517497