Fully homomorphic encryption using ideal lattices
Abstract
We propose a fully homomorphic encryption scheme -- i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in three steps. First, we provide a general result -- that, to construct an encryption scheme that permits evaluation of arbitrary circuits, it suffices to construct an encryption scheme that can evaluate (slightly augmented versions of) its own decryption circuit; we call a scheme that can evaluate its (augmented) decryption circuit bootstrappable.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Homomorphic encryption, secure multiparty compute, and trusted execution environments allow collaborative computations to be performed with untrusted parties while maintaining confidentiality of the inputs.
“Homomorphic encryption58, secure multiparty compute59, and trusted execution environments (TEEs)60,61 allow for collaborative computations to be performed with untrusted parties while maintaining confidentiality of the inputs to the computation.”
From Federated learning enables big data for rare cancer boundary detection (2022) · cites this paper as [58]
Backdoor detection algorithms rely on the statistical difference between latent representations of backdoor-enabled and clean inputs in the poisoned model.
“These algorithms rely on the statistical difference between the latent representations of backdoor-enabled and clean (benign) inputs in the poisoned model.”
From Privacy and Robustness in Federated Learning: Attacks and Defenses (2024) · cites this paper as [128]
Cites
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · see citing works
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012 · see citing works
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059 · see citing works
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250 · see citing works
Factoring polynomials with rational coefficients
Lenstra, A. K., Lenstra, H. W., & Lovász, L. (1982) · Mathematische Annalen · doi:10.1007/bf01457454 · Cited by 4,061 · see citing works
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060603 · Cited by 2,383 · see citing works
NTRU: A ring-based public key cryptosystem
Hoffstein, J., Pipher, J., & Silverman, J. H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054868 · Cited by 1,947 · see citing works
(1978) · Cited by 1,875 · see citing works
Evaluating 2-DNF Formulas on Ciphertexts
Boneh, D., Goh, E.-J., & Kobbi Nissim, B. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30576-7_18 · Cited by 1,679 · see citing works
Divertible protocols and atomic proxy cryptography
Blaze, M., Bleumer, G., & Strauss, M. J. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054122 · Cited by 1,609 · see citing works
Generating hard instances of lattice problems (extended abstract)
Ajtai, M. (1996) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/237814.237838 · Cited by 1,434 · see citing works
On Lovász’ lattice reduction and the nearest lattice point problem
Babai, L. (1986) · COMBINATORICA · doi:10.1007/bf02579403 · Cited by 957 · see citing works
Probabilistic encryption & how to play mental poker keeping secret all partial information
Goldwasser, S., & Micali, S. M. (1982) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800070.802212 · Cited by 884 · see citing works
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Barrington, D. A. M. (1986) · Symposium on the Theory of Computing · doi:10.1145/12130.12131 · Cited by 837 · see citing works
A new public-key cryptosystem as secure as factoring
Okamoto, T., & Uchiyama, S. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054135 · Cited by 674 · see citing works
A hierarchy of polynomial time lattice basis reduction algorithms
Schnorr, C. P. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90064-8 · Cited by 659 · see citing works
A public-key cryptosystem with worst-case/average-case equivalence
Ajtai, M., & Dwork, C. (1997) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/258533.258604 · Cited by 649 · see citing works
Lossy Trapdoor Functions and Their Applications
Peikert, C., & Waters, B. R. (2008) · SIAM Journal on Computing · doi:10.1137/080733954 · Cited by 640 · see citing works
On the Security of Joint Signature and Encryption
An, J. H., Dodis, Y., & Rabin, T. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46035-7_6 · Cited by 572 · see citing works
Foundations of secure computation
DeMillo, R. A., Lipton, R. J., Dobkin, D., & Jones, A. K. (1978) · SMARTech Repository (Georgia Institute of Technology) · Cited by 462 · see citing works
Verifiable secret-ballot elections
Benaloh, J. (1987) · Cited by 380 · see citing works
A new public key cryptosystem based on higher residues
Naccache, D., & Stern, J. (1998) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/288090.288106 · Cited by 350 · see citing works
Relaxing Chosen-Ciphertext Security
Canetti, R., Krawczyk, H., & Nielsen, J. B. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45146-4_33 · Cited by 303 · see citing works
Circular-Secure Encryption from Decision Diffie-Hellman
Boneh, D., Halevi, S., Hamburg, M., et al. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85174-5_7 · Cited by 293 · see citing works
Generalized Compact Knapsacks Are Collision Resistant
Lyubashevsky, V., & Micciancio, D. (2006) · Lecture notes in computer science · doi:10.1007/11787006_13 · Cited by 282 · see citing works
Non-interactive cryptocomputing for NC/sup 1/
Sander, T., Young, A. L., & Yung, M. M. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sffcs.1999.814630 · Cited by 276 · see citing works
Encryption-Scheme Security in the Presence of Key-Dependent Messages
Black, J., Rogaway, P., & Shrimpton, T. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36492-7_6 · Cited by 250 · see citing works
Evaluating Branching Programs on Encrypted Data
Ishai, Y., & Paskin-Cherniavsky, A. (2007) · Springer eBooks · doi:10.1007/978-3-540-70936-7_31 · Cited by 231 · see citing works
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
Peikert, C., & Rosen, A. (2006) · Lecture notes in computer science · doi:10.1007/11681878_8 · Cited by 230 · see citing works
The rise and fall of knapsack cryptosystems
Odlyzko, A. M. (1991) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/042/1095552 · Cited by 188 · see citing works
Asymptotically Efficient Lattice-Based Digital Signatures
Lyubashevsky, V., & Micciancio, D. (2008) · Springer eBooks · doi:10.1007/978-3-540-78524-8_3 · Cited by 181 · see citing works
Quantum Algorithms for Some Hidden Shift Problems
van Dam, W., Hallgren, S., & Ip, L. (2006) · SIAM Journal on Computing · doi:10.1137/s009753970343141x · Cited by 175 · see citing works
Improving Lattice Based Cryptosystems Using the Hermite Normal Form
Micciancio, D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44670-2_11 · Cited by 174 · see citing works
Speeding Up Secret Computations with Insecure Auxiliary Devices
Matsumoto, T., Kato, K., & Imai, H. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_35 · Cited by 159 · see citing works
Micciancio, D. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181960 · Cited by 136 · see citing works
A Length-Flexible Threshold Cryptosystem with Applications
Damgård, I., & Jurik, M. J. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45067-x_30 · Cited by 122 · see citing works
Multi-bit Cryptosystems Based on Lattice Problems
Kawachi, A., Tanaka, K., & Xagawa, K. (2007) · Springer eBooks · doi:10.1007/978-3-540-71677-8_21 · Cited by 99 · see citing works
Key Recovery and Message Attacks on NTRU-Composite
Gentry, C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_12 · Cited by 97 · see citing works
Self-citationOn the multiplicative complexity of Boolean functions over the basis (∧,⊕,1)
Boyar, J., Peralta, R., & Pochuev, D. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(99)00182-6 · Cited by 92 · see citing works
Additively Homomorphic Encryption with d-Operand Multiplications
Melchor, C. A., Gaborit, P., & Herranz, J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7_8 · Cited by 90 · see citing works
Security under key-dependent inputs
Halevi, S., & Krawczyk, H. (2007) · Proceedings of the ACM Conference on Computer and Communications Security · doi:10.1145/1315245.1315303 · Cited by 74 · see citing works
Lattices that admit logarithmic worst-case to average-case connection factors
Peikert, C., & Rosen, A. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250860 · Cited by 69 · see citing works
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
Stinson, D. R. (2001) · Mathematics of Computation · doi:10.1090/s0025-5718-01-01310-2 · Cited by 65 · see citing works
Attacks on Protocols for Server-Aided RSA Computation
Pfitzmann, B., & Waidner, M. (2007) · Springer eBooks · doi:10.1007/3-540-47555-9_13 · Cited by 62 · see citing works
Lattice-based homomorphic encryption of vector spaces
Melchor, C. A., Castagnos, G., & Gaborit, P. (2008) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2008.4595310 · Cited by 56 · see citing works
Homomorphic Encryption with CCA Security
Prabhakaran, M., & Rosulek, M. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-70583-3_54 · Cited by 54 · see citing works
Minimal-Latency Secure Function Evaluation
Beaver, D. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45539-6_23 · Cited by 38 · see citing works
On the minimum distance of some quadratic residue codes (Corresp.)
Coppersmith, D., & Seroussi, G. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056861 · Cited by 32 · see citing works
The Béguin-Quisquater Server-Aided RSA Protocol from Crypto ’95 is not Secure
Nguyen, P., & Stern, J. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49649-1_29 · Cited by 30 · see citing works
A New Approach for Algebraically Homomorphic Encryption.
Armknecht, F., & Sadeghi, A. (2008) · MADOC (University of Mannheim) · Cited by 29 · see citing works
On the Insecurity of a Server-Aided RSA Protocol
Nguyễn, P. Q., & Shparlinski, I. E. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_2 · Cited by 28 · see citing works
Improved cryptographic hash functions with worst-case/average-case connection
Micciancio, D. (2002) · doi:10.1145/509907.509995 · Cited by 28 · see citing works
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
Maurer, U. M., & Raub, D. (2007) · Springer eBooks · doi:10.1007/978-3-540-76900-2_26 · Cited by 21 · see citing works
Polly Two : A New Algebraic Polynomial-based Public-Key Scheme
Ly, L. V. (2006) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-006-0010-0 · Cited by 21 · see citing works
Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem
Goldwasser, S., & Kharchenko, D. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30576-7_29 · Cited by 20 · see citing works
Esser, K. (1985) · Springer eBooks · doi:10.1007/978-3-642-61674-7_13 · Cited by 18 · see citing works
A Polly Cracker System Based on Satisfiability
Levy-dit-Vehel, F., & Perret, L. (2004) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-7865-4_11 · Cited by 13 · see citing works
Multi-round passive attacks on server-aided RSA protocols
Merkle, J. (2000) · Proceedings of the ACM Conference on Computer and Communications Security · doi:10.1145/352600.352616 · Cited by 8 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772 · see citing works
“Different flavours of HE exist, ranging from general fully homomorphic encryption (FHE) [176] to the more efficient leveled variants [79, 160, 80, 112], for which several implementations exist [3, 350, 4].”
BackgroundDecentralizing Privacy: Using Blockchain to Protect Personal Data
Zyskind, G., Nathan, O., & Pentland, A. '. (2015) · 2015 IEEE Security and Privacy Workshops · doi:10.1109/spw.2015.27 · Cited by 2,617 · see citing works
Multiparty Computation from Somewhat Homomorphic Encryption
Damgård, I., Pastro, V., Smart, N., & Zakarias, S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_38 · Cited by 1,331 · see citing works
Dynamic consent: a patient interface for twenty-first century research networks
Kaye, J., Whitley, E. A., Lund, D., Morrison, M., Teare, H., & Melham, K. (2015) · European Journal of Human Genetics · doi:10.1038/ejhg.2014.71 · Cited by 780 · see citing works
Securing Fog Computing for Internet of Things Applications: Challenges and Solutions
Ni, J., Zhang, K., Lin, X., & Shen, X. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2762345 · Cited by 659 · see citing works
Challenges in deploying machine learning: A survey of case studies
Paleyes, A., Urma, R.-G., & Lawrence, N. D. (2023) · ACM Computing Surveys · doi:10.1145/3533378 · Cited by 638 · see citing works
Survey on blockchain for Internet of Things
Wang, X., Zha, X., Ni, W., Liu, R. P., Guo, Y. J., Niu, X., & Zheng, K. (2019) · Computer Communications · doi:10.1016/j.comcom.2019.01.006 · Cited by 567 · see citing works
Federated learning review: Fundamentals, enabling technologies, and future applications
Banabilah, S., Aloqaily, M., Alsayed, E., Malik, N., & Jararweh, Y. (2022) · Information Processing & Management · doi:10.1016/j.ipm.2022.103061 · Cited by 556 · see citing works
Data security and privacy-preserving in edge computing paradigm: survey and open issues
Zhang, J., Chen, B., Zhao, Y., Cheng, X., & Hu, F. (2018) · IEEE Access · doi:10.1109/access.2018.2820162 · Cited by 514 · see citing works
Privacy and Robustness in Federated Learning: Attacks and Defenses
Lyu, L., Yu, H., Ma, X., Chen, C., Sun, L., Zhao, J., Yang, Q., & Yu, P. S. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3216981 · Cited by 548 · see citing works
Bitansky, N., Canetti, R., Chiesa, A., & Tromer, E. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090263 · Cited by 493 · see citing works
Demonstration of Blind Quantum Computing
Barz, S., Kashefi, E., Broadbent, A., Fitzsimons, J. F., Zeilinger, A., & Walther, P. (2012) · Science · doi:10.1126/science.1214707 · Cited by 475 · see citing works
Hardy, S., Henecka, W., Ivey-Law, H., Nock, R., Patrini, G., Smith, G., & Thorne, B. (2017) · arXiv · doi:10.48550/arxiv.1711.10677 · Cited by 431 · see citing works
Privacy-Preserving Solutions for Blockchain: Review and Challenges
Bernal Bernabe, J., Canovas, J. L., Hernandez-Ramos, J. L., Torres Moreno, R., & Skarmeta, A. (2019) · IEEE Access · doi:10.1109/access.2019.2950872 · Cited by 430 · see citing works
“without revealing private values is homomorphic encryption [102], originates from privacy homomorphism proposed by [120], where the encryption function has some properties that allow to operate over the ciphertext and obtain the same encrypted result, as if such operations had been performed”
BackgroundPrivacy Preserving Machine Learning with Homomorphic Encryption and Federated Learning
Fang, H., & Qian, Q. (2021) · Future Internet · doi:10.3390/fi13040094 · Cited by 424 · see citing works
Federated learning enables big data for rare cancer boundary detection
Pati, S., Baid, U., Edwards, B., Sheller, M., Wang, S.-H., Reina, G. A., Foley, P., Gruzdev, A., Karkada, D., Davatzikos, C., et al. (2022) · Nature Communications · doi:10.1038/s41467-022-33407-5 · Cited by 394 · see citing works
Forgetting personal data and revoking consent under the GDPR: Challenges and proposed solutions
Politou, E., Alepis, E., & Patsakis, C. (2018) · Journal of Cybersecurity · doi:10.1093/cybsec/tyy001 · Cited by 313 · see citing works
Big privacy: challenges and opportunities of privacy study in the age of big data
Yu, S. (2016) · IEEE Access · doi:10.1109/access.2016.2577036 · Cited by 307 · see citing works
Private predictive analysis on encrypted medical data
Bos, J. W., Lauter, K., & Naehrig, M. (2014) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2014.04.003 · Cited by 283 · see citing works
Illuminating the dark spaces of healthcare with ambient intelligence
Haque, A., Milstein, A., & Fei-Fei, L. (2020) · Nature · doi:10.1038/s41586-020-2669-y · Cited by 274 · see citing works
A Systematic Review of Homomorphic Encryption and Its Contributions in Healthcare Industry
Munjal, K., & Bhatia, R. (2023) · Complex & Intelligent Systems · doi:10.1007/s40747-022-00756-z · Cited by 269 · see citing works
PPFA: Privacy Preserving Fog-Enabled Aggregation in Smart Grid
Lyu, L., Nandakumar, K., Rubinstein, B., Jin, J., Bedo, J., & Palaniswami, M. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2803782 · Cited by 240 · see citing works
Privacy-Preserving Federated Learning Using Homomorphic Encryption
Park, J., & Lim, H. (2022) · Applied Sciences · doi:10.3390/app12020734 · Cited by 223 · see citing works
When Machine Learning Meets Privacy in 6G: A Survey
Sun, Y., Liu, J., Wang, J., Cao, Y., & Kato, N. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.3011561 · Cited by 211 · see citing works
Privacy-Preserving Patient Similarity Learning in a Federated Environment: Development and Analysis
Lee, J., Sun, J., Wang, F., Wang, S., Jun, C.-H., & Jiang, X. (2018) · JMIR Medical Informatics · doi:10.2196/medinform.7744 · Cited by 196 · see citing works
Homomorphic Encryption for Machine Learning in Medicine and Bioinformatics
Wood, A., Najarian, K., & Kahrobaei, D. (2021) · ACM Computing Surveys · doi:10.1145/3394658 · Cited by 179 · see citing works
Realizing the potential of blockchain technologies in genomics
Ozercan, H. I., Ileri, A. M., Ayday, E., & Alkan, C. (2018) · Genome Research · doi:10.1101/gr.207464.116 · Cited by 143 · see citing works
Deriving genomic diagnoses without revealing patient genomes
Jagadeesh, K. A., Wu, D. J., Birgmeier, J. A., Boneh, D., & Bejerano, G. (2017) · Science · doi:10.1126/science.aam9710 · Cited by 134 · see citing works
Privacy in Internet of Things: From Principles to Technologies
Li, C., & Palanisamy, B. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2864168 · Cited by 130 · see citing works
A Survey of Virtual Machine Management in Edge Computing
Tao, Z., Xia, Q., Hao, Z., Li, C., Ma, L., Yi, S., & Li, Q. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2927919 · Cited by 114 · see citing works
InPrivate Digging: Enabling Tree-based Distributed Data Mining with Differential Privacy
Zhao, L., Ni, L., Hu, S., Chen, Y., Zhou, P., Xiao, F., & Wu, L. (2018) · IEEE INFOCOM 2018 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2018.8486352 · Cited by 108 · see citing works
Privacy in Deep Learning: A Survey
Mireshghallah, F., Taram, M., Vepakomma, P., Singh, A., Raskar, R., & Esmaeilzadeh, H. (2020) · arXiv · doi:10.48550/arxiv.2004.12254 · Cited by 106 · see citing works
Security, Privacy, and Usability in Continuous Authentication: A Survey
Baig, A. F., & Eskeland, S. (2021) · Sensors · doi:10.3390/s21175967 · Cited by 98 · see citing works
A Medical Healthcare System for Privacy Protection Based on IoT
Gong, T., Huang, H., Li, P., Zhang, K., & Jiang, H. (2015) · 2015 Seventh International Symposium on Parallel Architectures, Algorithms and Programming (PAAP) · doi:10.1109/paap.2015.48 · Cited by 103 · see citing works
On Security in Publish/Subscribe Services: A Survey
Esposito, C., & Ciampi, M. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2364616 · Cited by 55 · see citing works
Secure Data Aggregation with Fully Homomorphic Encryption in Large-Scale Wireless Sensor Networks
Li, X., Chen, D., Li, C., & Wang, L. (2015) · Sensors · doi:10.3390/s150715952 · Cited by 41 · see citing works
FPT: A Fixed-Point Accelerator for Torus Fully Homomorphic Encryption
Van Beirendonck, M., D'Anvers, J.-P., Turan, F., & Verbauwhede, I. (2023) · Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3576915.3623159 · Cited by 38 · see citing works
Homomorphic encryption in mobile multi cloud computing
Louk, M., & Lim, H. (2015) · 2015 International Conference on Information Networking (ICOIN) · doi:10.1109/icoin.2015.7057954 · Cited by 36 · see citing works
Kumari, K. A., Sharma, A., Chakraborty, C., & Ananyaa, M. (2022) · Big Data · doi:10.1089/big.2021.0012 · Cited by 36 · see citing works
Ali, S., Wadho, S. A., Yichiet, A., Gan, M. L., & Lee, C. K. (2024) · Egyptian Informatics Journal · doi:10.1016/j.eij.2024.100519 · Cited by 32 · see citing works
Reaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes
Zhang, Z., Plantard, T., & Susilo, W. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-31912-9_28 · Cited by 27 · see citing works
From Algorithm to Hardware: A Survey on Efficient and Safe Deployment of Deep Neural Networks
Geng, X., Wang, Z., Chen, C., Xu, Q., Xu, K., Jin, C., Gupta, M., Yang, X., Chen, Z., Sabry Aly, M. M., et al. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3394494 · Cited by 26 · see citing works
HEAX: An Architecture for Computing on Encrypted Data
Riazi, M. S., Laine, K., Pelton, B., & Dai, W. (2019) · arXiv · doi:10.48550/arxiv.1909.09731 · Cited by 26 · see citing works
Guo, H., Meese, C., Li, W., Shen, C.-C., & Nejad, M. (2023) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2023.3318990 · Cited by 26 · see citing works
A Survey on Secure Computation Based on Homomorphic Encryption in Vehicular Ad Hoc Networks
Sun, X., Yu, F. R., Zhang, P., Xie, W., & Peng, X. (2020) · Sensors · doi:10.3390/s20154253 · Cited by 23 · see citing works
Islam, N., & Zulkernine, M. (2025) · arXiv · doi:10.48550/arxiv.2503.01089 · Cited by 1 · see citing works
“Despite various advances, high computational costs and complexity associated with HE still persist when integrating in PPML [2].”
- Authors
- Gentry, C.
- Affiliations
- Stanford University (US)
- Corresponding author
- Gentry, Craig
- ORCID
- Gentry, Craig
- Venue
- Proceedings of the forty-first annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2009-05-31
- Pages
- 169-178
- OpenAlex
- W2031533839
- Cited by
- 6,806
- References
- 58
- Citations by year
- 2026: 382 · 2025: 636 · 2024: 499 · 2023: 476 · 2022: 424 · 2021: 467 · 2020: 472 · 2019: 430 · 2018: 407 · 2017: 416 · 2016: 403 · 2015: 448 · 2014: 384 · 2013: 360 · 2012: 274
- FWCI
- 140.64
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM Symposium on Theory of Computing (STOC) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
- Keywords
- fully homomorphic encryption, ideal lattices, bootstrapping, lattice-based cryptography
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
