Fetching the paper…
Reading the bibliography…
Recent advances in cryptography promise to enable secure statistical computation on encrypted data, whereby a limited set of operations can be carried out without the need to first decrypt.
Garner, H. L. (1959), ‘The residue number system’, IEEE Transactions on Electronic Computers
1959
Earlier work this paper cites.
Rivest, R. L., Adleman, L. and Dertouzos, M. L. (1978), ‘On data banks and privacy homomorphisms’, Foundations of Secure Computation
1978
Earlier work this paper cites.
Rivest, R. L., Shamir, A. and Adleman, L. (1978), ‘A method for obtaining digital signatures and public-key cryptosystems’, Communications of the ACM
1978
Earlier work this paper cites.
Goldwasser, S. and Micali, S. (1982), Probabilistic encryption & how to play mental poker keeping secret all partial information, in
1982
Earlier work this paper cites.
ElGamal, T. (1985), A public key cryptosystem and a signature scheme based on discrete logarithms, in
1985
Earlier work this paper cites.
Knuth, D. E. (1997), The Art of Computer Programming, Volume 2: Seminumerical Algorithms
1997
Earlier work this paper cites.
Paillier, P. (1999), Public-key cryptosystems based on composite degree residuosity classes, in
1999
Earlier work this paper cites.
Daemen, J. and Rijmen, V. (2002), The design of Rijndael: AES-the advanced encryption standard
2002
Earlier work this paper cites.
Boneh, D., Goh, E. and Nissim, K. (2005), Evaluating 2-dnf formulas on ciphertexts, in
2005
Earlier work this paper cites.
Gentry, C. (2009), A fully homomorphic encryption scheme, PhD thesis, Stanford University. crypto.stanford.edu/craig
2009
Earlier work this paper cites.
Kaufman, D. J., Murphy-Bollinger, J., Scott, J. and Hudson, K. L. (2009), ‘Public opinion about the importance of privacy in biobank research’, American Journal of Human Genetics
2009
Earlier work this paper cites.
Regev, O. (2009), ‘On lattices, learning with errors, random linear codes, and cryptography’, Journal of the ACM (JACM)
2009
Earlier work this paper cites.
Wu, D. and Haven, J. (2012), ‘Using homomorphic encryption for large scale statistical analysis’
2009
Earlier work this paper cites.
Franz, M., Deiseroth, B., Hamacher, K., Jha, S., Katzenbeisser, S. and Schröder, H. (2010), Secure computations on non-integer values, in
2010
Earlier work this paper cites.
Gentry, C. (2010), ‘Computing arbitrary functions of encrypted data’, Communications of the ACM
2010
Earlier work this paper cites.
http://flintlib.org
Hart, W. B. (2010), Fast library for number theory: An introduction, in · 2010
Earlier work this paper cites.
Lyubashevsky, V., Peikert, C. and Regev, O. (2010), On ideal lattices and learning with errors over rings, in
2010
Earlier work this paper cites.
Minar, J. (2010), ‘libfhe’, https://github.com/rdancer/fhe/tree/master/libfhe
2010
Earlier work this paper cites.
Smart, N. P. and Vercauteren, F. (2010), Fully homomorphic encryption with relatively small key and ciphertext sizes, in
2010
Cited alongside, same era.
Stehlé, D. and Steinfeld, R. (2010), Faster fully homomorphic encryption, in
2010
Cited alongside, same era.
van Dijk, M., Gentry, C., Halevi, S. and Vaikuntanathan, V. (2010), Fully homomorphic encryption over the integers, in
2010
Cited alongside, same era.
Brakerski, Z. and Vaikuntanathan, V. (2011 a
2011
Cited alongside, same era.
Brakerski, Z. and Vaikuntanathan, V. (2011 b
2011
Cited alongside, same era.
Eddelbuettel, D., François, R., Allaire, J. J., Chambers, J., Bates, D. and Ushey, K. (2011), ‘Rcpp: Seamless R and C++ integration’, Journal of Statistical Software
Graepel, T., Lauter, K. and Naehrig, M. (2012), ML Confidential: Machine learning on encrypted data, in
2012
Later among the works it cites.
Version 6.0.0a. http://gmplib.org/
Granlund, T. and the GMP development team (2012), GNU MP: The GNU Multiple Precision Arithmetic Library · 2012
Later among the works it cites.
Bos, J. W., Lauter, K., Loftus, J. and Naehrig, M. (2013), Improved security for a ring-based fully homomorphic encryption scheme, in
2013
Later among the works it cites.
Gentry, C., Sahai, A. and Waters, B. (2013), Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based, in
2013
Later among the works it cites.
Sen, J. (2013), Homomorphic encryption: Theory & application, in
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
Gentry, C. and Halevi, S. (2011), Implementing gentry’s fully-homomorphic encryption scheme, in
2011
Cited alongside, same era.
Lauter, K., Naehrig, M. and Vaikuntanathan, V. (2011), Can homomorphic encryption be practical?, in
2011
Cited alongside, same era.
Lindner, R. and Peikert, C. (2011), Better key sizes (and attacks) for LWE-based encryption, in
2011
Cited alongside, same era.
Naehrig, M., Lauter, K. and Vaikuntanathan, V. (2011), Can homomorphic encryption be practical?, in
2011
Cited alongside, same era.
Pathak, M., Rane, S., Sun, W. and Raj, B. (2011), Privacy preserving probabilistic inference with hidden Markov models, in
2011
Cited alongside, same era.
Perl, H., Brenner, M. and Smith, M. (2011), ‘Scarab library’, https://hcrypt.com/scarab-library/
2011
Cited alongside, same era.
Silverberg, A. (2013), ‘Fully homomorphic encryption for mathematicians’, Women in Numbers 2: Research Directions in Number Theory
2013
Later among the works it cites.
R package version 4.3.3. http://CRAN.R-project.org/package=RcppParallel
Allaire, J. J., François, R., Intel Inc. and Geelnard, M. (2014), RcppParallel: Parallel programming tools for Rcpp · 2014
Later among the works it cites.
R package version 0.2. http://www.louisaslett.com/HomomorphicEncryption/
Aslett, L. J. M. (2014), HomomorphicEncryption: Fully Homomorphic Encryption · 2014
Later among the works it cites.
Brakerski, Z. and Vaikuntanathan, V. (2014), Lattice-based fhe as secure as pke, in
2014
Later among the works it cites.
Halevi, S. and Shoup, V. (2014 a
2014
Later among the works it cites.
Halevi, S. and Shoup, V. (2014 b
2014
Later among the works it cites.
Lauter, K., López-Alt, A. and Naehrig, M. (2014), ‘Private computation on encrypted genomic data’, Microsoft Research, technical report MSR-TR-2014-93
2014
Later among the works it cites.
Lepoint, T. (2014), ‘A proof-of-concept implementation of the homomorphic evaluation of SIMON using FV and YASHE leveled homomorphic cryptosystems’, https://github.com/tlepoint/homomorphic-simon
2014
Later among the works it cites.
Lepoint, T. and Naehrig, M. (2014), A comparison of the homomorphic encryption schemes FV and YASHE, in
2014
Later among the works it cites.
R Core Team (2014), R: A Language and Environment for Statistical Computing
2014
Later among the works it cites.
Smart, N. P. and Vercauteren, F. (2014), ‘Fully homomorphic SIMD operations’, Designs, codes and cryptography
2014
Later among the works it cites.
Aslett, L. J. M., Esperança, P. M. and Holmes, C. C. (2015), Encrypted statistical machine learning: new privacy preserving methods, Technical report, University of Oxford
2015
Closest in time.