Fetching the paper…
Reading the bibliography…
Fully Homomorphic Encryption (FHE) is seeing increasing real-world deployment to protect data in use by allowing computation over encrypted data.
D. Boneh, R. Canetti, S. Halevi, and J. Katz, “Chosen-Ciphertext security from Identity-Based encryption,” SIAM J. Comput
2007
Earlier work this paper cites.
PhD thesis, Stanford University, 2009
C. Gentry, A fully homomorphic encryption scheme · 2009
Earlier work this paper cites.
O. Regev, “On lattices, learning with errors, random linear codes, and cryptography,” Journal of the ACM
2009
Earlier work this paper cites.
C. Gentry, “Fully homomorphic encryption using ideal lattices,” in Proceedings of the forty-first annual ACM symposium on Theory of computing
2009
Earlier work this paper cites.
R. Gennaro, C. Gentry, and B. Parno, “Non-interactive verifiable computing: Outsourcing computation to untrusted workers,” in Advances in Cryptology – CRYPTO 2010
2010
Earlier work this paper cites.
V. Lyubashevsky, C. Peikert, and O. Regev, “On ideal lattices and learning with errors over rings,” in Advances in Cryptology – EUROCRYPT 2010
2010
Earlier work this paper cites.
S. Benabbas, R. Gennaro, and Y. Vahlis, “Verifiable delegation of computation over large datasets,” in Advances in Cryptology – CRYPTO 2011
2011
Earlier work this paper cites.
Z. Brakerski and V. Vaikuntanathan, “Fully homomorphic encryption from Ring-LWE and security for key dependent messages,” in Advances in Cryptology – CRYPTO 2011
2011
Earlier work this paper cites.
Z. Zhang, T. Plantard, and W. Susilo, “Reaction attack on outsourced computing with fully homomorphic encryption schemes,” in Information Security and Cryptology - ICISC 2011
2012
Earlier work this paper cites.
J. Fan and F. Vercauteren, “Somewhat practical fully homomorphic encryption,” Cryptology ePrint Archive
2012
Earlier work this paper cites.
J. Loftus, A. May, N. P. Smart, and F. Vercauteren, “On CCA-Secure somewhat homomorphic encryption,” in Selected Areas in Cryptography
2012
Earlier work this paper cites.
Z. Brakerski, “Fully homomorphic encryption without modulus switching from classical GapSVP,” in Advances in Cryptology – CRYPTO 2012
2012
Earlier work this paper cites.
R. Gennaro and D. Wichs, “Fully homomorphic message authenticators,” in Advances in Cryptology - ASIACRYPT 2013
2013
Earlier work this paper cites.
D. Catalano and D. Fiore, “Practical homomorphic MACs for arithmetic circuits,” in Advances in Cryptology – EUROCRYPT 2013
2013
Earlier work this paper cites.
S. Goldwasser, Y. T. Kalai, R. A. Popa, V. Vaikuntanathan, and N. Zeldovich, “How to run turing machines on encrypted data,” in Advances in Cryptology – CRYPTO 2013
2013
Earlier work this paper cites.
E. Ben-Sasson, A. Chiesa, D. Genkin, E. Tromer, and M. Virza, “SNARKs for c: Verifying program executions succinctly and in zero knowledge,” Cryptology ePrint Archive
2013
Earlier work this paper cites.
S. Halevi and V. Shoup, “Algorithms in HElib,” in Advances in Cryptology – CRYPTO 2014
2014
Earlier work this paper cites.
Z. Brakerski, C. Gentry, and V. Vaikuntanathan, “(leveled) fully homomorphic encryption without bootstrapping,” ACM Trans. Comput. Theory
2014
Earlier work this paper cites.
D. Fiore, R. Gennaro, and V. Pastro, “Efficiently verifiable computation on encrypted data,” in Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security
2014
Earlier work this paper cites.
N. P. Smart and F. Vercauteren, “Fully homomorphic SIMD operations,” Designs, Codes and Cryptography. An International Journal
2014
Earlier work this paper cites.
M. Chenal and Q. Tang, “On key recovery attacks against existing somewhat homomorphic encryption schemes,” in Progress in Cryptology - LATINCRYPT 2014
2015
Earlier work this paper cites.
L. Ducas and D. Micciancio, “FHEW: Bootstrapping homomorphic encryption in less than a second,” in Advances in Cryptology – EUROCRYPT 2015
2015
Earlier work this paper cites.
J. Geater, “ARM® TrustZone®,” in Trusted Computing for Embedded Systems
2015
Earlier work this paper cites.
I. Chillotti, N. Gama, and L. Goubin, “Attacking FHE-based applications by software fault injections,” Cryptology ePrint Archive
2016
Earlier work this paper cites.
Z. Li, S. D. Galbraith, and C. Ma, “Preventing adaptive key recovery attacks on the GSW levelled homomorphic encryption scheme,” in Provable Security
2016
Earlier work this paper cites.
J. Lai, R. H. Deng, C. Ma, K. Sakurai, and J. Weng, “CCA-Secure Keyed-Fully homomorphic encryption,” in Public-Key Cryptography – PKC 2016
2016
Cited alongside, same era.
L. Ducas and D. Stehlé, “Sanitization of FHE ciphertexts,” in Advances in Cryptology – EUROCRYPT 2016
2016
Cited alongside, same era.
J. Groth, “On the size of Pairing-Based non-interactive arguments,” in Advances in Cryptology – EUROCRYPT 2016
2016
Cited alongside, same era.
H. Chen, K. Laine, and R. Player, “Simple encrypted arithmetic library - SEAL v2.1,” in Financial Cryptography and Data Security
2017
Cited alongside, same era.
J. H. Cheon, A. Kim, M. Kim, and Y. Song, “Homomorphic encryption for arithmetic of approximate numbers,” in Advances in Cryptology – ASIACRYPT 2017
2017
Cited alongside, same era.
K. Lauter, S. Kannepalli, K. Laine, and R. C. Moreno, “Password monitor: Safeguarding passwords in microsoft edge,” 2021
2021
Later among the works it cites.
P. Fauzi, M. N. Hovd, and H. Raddum, “On the IND-CCA1 security of FHE schemes,” Cryptology ePrint Archive
2021
Later among the works it cites.
K. Emura, “On the security of Keyed-Homomorphic PKE: Preventing key recovery attacks and ciphertext validity attacks,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
2021
Later among the works it cites.
A. Bois, I. Cascudo, D. Fiore, and D. Kim, “Flexible and efficient verifiable computation on encrypted data,” in Public-Key Cryptography – PKC 2021
2021
Later among the works it cites.
C. Ganesh, A. Nitulescu, and E. Soria-Vazquez, “Rinocchio: SNARKs for ring arithmetic,” Cryptology ePrint Archive
2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Canetti, S. Raghuraman, S. Richelson, and V. Vaikuntanathan, “Chosen-Ciphertext secure fully homomorphic encryption,” in Public-Key Cryptography – PKC 2017
2017
Cited alongside, same era.
K. Emura, G. Hanaoka, K. Nuida, G. Ohtake, T. Matsuda, and S. Yamada, “Chosen ciphertext secure keyed-homomorphic public-key cryptosystems,” Des. Codes Cryptogr
2018
Cited alongside, same era.
B. Wang, X. Wang, and R. Xue, “CCA1 secure FHE from PIO, revisited,” Cybersecurity
2018
Cited alongside, same era.
D. Evans, V. Kolesnikov, and M. Rosulek, “A pragmatic introduction to secure Multi-Party computation,” Foundations and Trends® in Privacy and Security
2018
Cited alongside, same era.
S. Li, X. Wang, and R. Zhang, “Privacy-Preserving homomorphic MACs with efficient verification,” in Web Services – ICWS 2018
2018
Cited alongside, same era.
E. Ben-Sasson, I. Bentov, Y. Horesh, and M. Riabzev, “Scalable, transparent, and post-quantum secure computational integrity,” Cryptology ePrint Archive
2018
Cited alongside, same era.
B. Bünz, J. Bootle, D. Boneh, A. Poelstra, P. Wuille, and G. Maxwell, “Bulletproofs: Short proofs for confidential transactions and more,” in 2018 IEEE Symposium on Security and Privacy (SP)
2018
Cited alongside, same era.
Later among the works it cites.
D. Natarajan, A. Loveless, W. Dai, and R. Dreslinski, “CHEX-MIX: Combining homomorphic encryption with trusted execution environments for two-party oblivious inference in the cloud,” Cryptology ePrint Archive
2021
Later among the works it cites.
S. Fei, Z. Yan, W. Ding, and H. Xie, “Security vulnerabilities of SGX and countermeasures: A survey,” ACM Comput. Surv
2021
Later among the works it cites.
L. B. Pulido-Gaytan, A. Tchernykh, J. M. Cortés-Mendoza, M. Babenko, and G. Radchenko, “A survey on privacy-preserving machine learning with fully homomorphic encryption,” in Latin American High Performance Computing Conference
2021
Later among the works it cites.
A. Kim, Y. Polyakov, and V. Zucca, “Revisiting homomorphic encryption schemes for finite fields,” Cryptology ePrint Archive
2021
Later among the works it cites.
F. Boemer, S. Kim, G. Seifu, F. D. de Souza, V. Gopal, and Others, “Intel HEXL (release 1.2).” https://github.com/intel/hexl , 2021
2021
Later among the works it cites.
O. Ozerk, C. Elgezen, A. C. Mert, E. Ozturk, and E. Savas, “Efficient number theoretic transform implementation on GPU for homomorphic encryption,” Cryptology ePrint Archive
2021
Later among the works it cites.
A. Al Badawi, J. Bates, F. Bergamaschi, D. B. Cousins, S. Erabelli, N. Genise, S. Halevi, H. Hunt, A. Kim, Y. Lee, Z. Liu, D. Micciancio, I. Quah, Y. Polyakov, S. R.v., K. Rohloff, J. Saylor, D. Suponitsky, M. Triplett, V. Vaikuntanathan, and V. Zucca, “OpenFHE: Open-Source fully homomorphic encryption library,” in Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography
2022
Later among the works it cites.
R. Geelen, M. Van Beirendonck, H. V. L. Pereira, B. Huffman, T. McAuley, B. Selfridge, D. Wagner, G. Dimou, I. Verbauwhede, F. Vercauteren, and D. W. Archer, “BASALISC: Flexible asynchronous hardware accelerator for fully homomorphic encryption,” 27 May 2022
2022
Later among the works it cites.
B. Chaturvedi, A. Chakraborty, A. Chatterjee, and D. Mukhopadhyay, “A practical full key recovery attack on TFHE and FHEW by inducing decryption errors,” Cryptology ePrint Archive
2022
Later among the works it cites.
S. Sato, K. Emura, and A. Takayasu, “Keyed-Fully homomorphic encryption without indistinguishability obfuscation,” Cryptology ePrint Archive
2022
Later among the works it cites.
S. Chatel, C. Knabenhans, A. Pyrgelis, and J.-P. Hubaux, “Verifiable encodings for secure homomorphic analytics,” July 2022
2022
Later among the works it cites.
Accessed: 2022-11-2
“Intel® software guard extensions (intel® SGX).” https://www.intel.com/content/www/us/en/architecture-and-technology/software-guard-extensions.html · 2022
Later among the works it cites.
C. Marcolla, V. Sucasas, M. Manzano, R. Bassoli, F. H. P. Fitzek, and N. Aaraj, “Survey on fully homomorphic encryption, theory and applications.” Mar. 2022
2022
Later among the works it cites.
K. Kluczniak, “Circuit privacy for FHEW/TFHE-Style fully homomorphic encryption in practice,” Cryptology ePrint Archive
2022
Later among the works it cites.
F. Bourse and M. Izabachène, “Plug-and-play sanitization for TFHE,” Cryptology ePrint Archive
2022
Later among the works it cites.
Accessed: 2022-12-2
A. Gabizon, Z. J. Aztec, and A. O. Williamson, “PlonK: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge.” https://eprint.iacr.org/2019/953.pdf , 2022 · 2022
Later among the works it cites.
B. Chen, B. Bünz, D. Boneh, and Z. Zhang, “HyperPlonk: Plonk with Linear-Time prover and High-Degree custom gates,” Cryptology ePrint Archive
2022
Later among the works it cites.
arkworks contributors, “ arkworks
2022
Later among the works it cites.
B. Li, D. Micciancio, M. Schultz, and J. Sorrell, “Securing approximate homomorphic encryption using differential privacy,” Cryptology ePrint Archive
2022
Later among the works it cites.
A. Viand, C. Knabenhans, and A. Hithnawi, “Verifiable fully homomorphic encryption.” https://arxiv.org/abs/2301.07041v1, 2023 · 2023
Closest in time.