The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption
Open accessAbstract
Fully Homomorphic Encryption (FHE) allows computing on encrypted data, enabling secure offloading of computation to untrusted servers. Though it provides ideal security, FHE is expensive when executed in software, 4 to 5 orders of magnitude slower than computing on unencrypted data. These overheads are a major barrier to FHE’s widespread adoption.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Learning Multiple Layers of Features from Tiny Images
Krizhevsky, A. (2024) · doi:10.57702/zp44cu3g · Cited by 23,395
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
Modular multiplication without trial division
Montgomery, P. L. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777282-x · Cited by 2,669
Somewhat Practical Fully Homomorphic Encryption.Preprint
Fan, J., & Vercauteren, F. (2012) · IACR Cryptology ePrint Archive · Cited by 2,597
Homomorphic Encryption for Arithmetic of Approximate Numbers
Cheon, J. H., Kim, A., Kim, M., & Song, Y. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70694-8_15 · Cited by 2,522 · cited 3×
“BGV [14], B/FV [13, 28], GSW [35], and CKKS [17] are popular FHE schemes.”
BackgroundOn Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_1 · Cited by 1,831
Self-citation(Leveled) fully homomorphic encryption without bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090262 · Cited by 1,782
A study of replacement algorithms for a virtual-storage computer
Belady, L. A. (1966) · IBM Systems Journal · doi:10.1147/sj.52.0078 · Cited by 1,659
Gentry, C., Sahai, A., & Waters, B. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_5 · Cited by 1,492
(Leveled) Fully Homomorphic Encryption without Bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2014) · ACM Transactions on Computation Theory · doi:10.1145/2633600 · Cited by 1,430
(2016) · International Conference on Machine Learning · Cited by 1,270
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
Brakerski, Z. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_50 · Cited by 1,252
Homomorphic Evaluation of the AES Circuit
Gentry, C., Halevi, S., & Smart, N. P. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_49 · Cited by 796
Halevi, S., & Shoup, V. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44371-2_31 · Cited by 559
A Decade of Lattice Cryptography
Peikert, C. (2016) · Foundations and TrendsŴ in Theoretical Computer Science · doi:10.1561/0400000074 · Cited by 504
Self-citationNVIDIA A100 Tensor Core GPU: Performance and Innovation
Choquette, J., Gandhi, W., Giroux, O., Stam, N., & Krashinsky, R. (2021) · IEEE Micro · doi:10.1109/mm.2021.3061394 · Cited by 410
Bootstrapping for Approximate Homomorphic Encryption
Cheon, J. H., Han, K., Kim, A., Kim, M., & Song, Y. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-78381-9_14 · Cited by 373
Garner, H. L. (1959) · Papers presented at the the March 3-5, 1959, western joint computer conference on XX - IRE-AIEE-ACM '59 (Western) · doi:10.1145/1457838.1457864 · Cited by 344
Low Latency Privacy Preserving InferencePreprint
Brutzkus, A., Elisha, O., & Gilad-Bachrach, R. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.10659 · Cited by 297
Pickerell, A. G., & Dornin, M. (1968) · University of California Press eBooks · doi:10.1525/9780520339668 · Cited by 266
Secure Logistic Regression Based on Homomorphic Encryption: Design and Evaluation
Kim, M., Song, Y., Wang, S., Xia, Y., & Jiang, X. (2018) · JMIR Medical Informatics · doi:10.2196/medinform.8805 · Cited by 257 · cited 1×
“For instance, we have described an implementation of key-switching, but there are others [34, 45] with different tradeoffs.”
BackgroundA Decade of Lattice Cryptography
Peikert, C. (2016) · now publishers, Inc. eBooks · doi:10.1561/9781680831139 · Cited by 256
Self-citationCompact Ring-LWE Cryptoprocessor
Roy, S. S., Vercauteren, F., Mentens, N., Chen, D. D., & Verbauwhede, I. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44709-3_21 · Cited by 255
HEAX: An Architecture for Computing on Encrypted Data
Riazi, M. S., Laine, K., Pelton, B., & Dai, W. (2020) · Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3373376.3378523 · Cited by 243
CHET: an optimizing compiler for fully-homomorphic neural-network inferencing
Dathathri, R., Saarikivi, O., Chen, H., Laine, K., Lauter, K., Maleki, S., Musuvathi, M., & Mytkowicz, T. (2019) · Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/3314221.3314628 · Cited by 235
Cheetah: Optimizing and Accelerating Homomorphic Encryption for Private Inference
Reagen, B., Choi, W.-S., Ko, Y., Lee, V. T., Lee, H.-H. S., Wei, G.-Y., & Brooks, D. M. (2021) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca51647.2021.00013 · Cited by 226
Logistic Regression on Homomorphic Encrypted Data at Scale
Han, K., Hong, S., Cheon, J. H., & Park, D. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33019466 · Cited by 194
FPGA-Based High-Performance Parallel Architecture for Homomorphic Computing on Encrypted Data
Sinha Roy, S., Turan, F., Jarvinen, K., Vercauteren, F., & Verbauwhede, I. (2019) · 2019 IEEE International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2019.00052 · Cited by 193
Gazelle: A Low Latency Framework for Secure Neural Network Inference
Juvekar, C., Vaikuntanathan, V., & Chandrakasan, A. P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.05507 · Cited by 164
EVA: an encrypted vector arithmetic language and compiler for efficient homomorphic computation
Dathathri, R., Kostova, B., Saarikivi, O., Dai, W., Laine, K., & Musuvathi, M. (2020) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3385412.3386023 · Cited by 158
Exploring the Feasibility of Fully Homomorphic Encryption
Wang, W., Hu, Y., Chen, L., Huang, X., & Sunar, B. (2013) · IEEE Transactions on Computers · doi:10.1109/tc.2013.154 · Cited by 154
Secure large-scale genome-wide association studies using homomorphic encryption
Blatt, M., Gusev, A., Polyakov, Y., & Goldwasser, S. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1918257117 · Cited by 150
HEAWS: An Accelerator for Homomorphic Encryption on the Amazon AWS FPGA
Turan, F., Roy, S. S., & Verbauwhede, I. M. R. (2020) · IEEE Transactions on Computers · doi:10.1109/tc.2020.2988765 · Cited by 149
High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers
Pöppelmann, T., Oder, T., & Güneysu, T. E. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-22174-8_19 · Cited by 147
Accelerating fully homomorphic encryption using GPU
Wang, W., Hu, Y., Chen, L., Huang, X., & Sunar, B. (2012) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec.2012.6408660 · Cited by 146
Provably efficient scheduling for languages with fine-grained parallelism
Blelloch, G. E., Gibbons, P. B., & Matias, Y. (1999) · Journal of the ACM · doi:10.1145/301970.301974 · Cited by 135
Implementation and Performance Evaluation of RNS Variants of the BFV Homomorphic Encryption Scheme
Badawi, A. A., Polyakov, Y., Aung, K. M. M., Veeravalli, B., & Rohloff, K. R. (2019) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2019.2902799 · Cited by 126
Mert, A. C., Öztürk, E., & Savaş, E. (2019) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2019.2943127 · Cited by 125
Practical Bootstrapping in Quasilinear Time
Alperin-Sheriff, J., & Peikert, C. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40041-4_1 · Cited by 120
Self-citationAccelerating Fully Homomorphic Encryption in Hardware
Doröz, Y., Öztürk, E., & Sunar, B. (2014) · IEEE Transactions on Computers · doi:10.1109/tc.2014.2345388 · Cited by 116
Buffets: An Efficient and Composable Storage Idiom for Explicit Decoupled Data Orchestration
Pellauer, M., Shao, Y. S., Clemons, J., Crago, N. C., Hegde, K., Venkatesan, R., Keckler, S. W., Fletcher, C. W., & Emer, J. (2019) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3297858.3304025 · Cited by 96
Designing an FPGA-Accelerated Homomorphic Encryption Co-Processor
Cousins, D. B., Rohloff, K. R., & Sumorok, D. (2016) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2016.2619669 · Cited by 70
High-Performance Ideal Lattice-Based Cryptography on 8-bit ATxmega Microcontrollers
Pöppelmann, T., Oder, T., & Güneysu, T. E. (2015) · Cited by 56
Accelerating leveled fully homomorphic encryption using GPU
Wang, W., Chen, Z., & Huang, X. (2014) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2014.6865755 · Cited by 38
Cousins, D. B., Rohloff, K. R., Peikert, C., et al. (2012) · doi:10.1109/hpec.2012.6408672 · Cited by 31
Self-citationAn FPGA co-processor implementation of Homomorphic Encryption
Cousins, D. B., Golusky, J., Rohloff, K. R., & Sumorok, D. (2014) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec.2014.7040950 · Cited by 30
A High-Speed Accelerator for Homomorphic Encryption using the Karatsuba Algorithm
Migliore, V., Seguin, C., Real, M. M., Lapôtre, V., Tisserand, A., Fontaine, C., Gogniat, G., & Tessier, R. (2017) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3126558 · Cited by 22
F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption (Extended Version)Preprint
Feldmann, A., Samardzic, N., Krastev, A., Devadas, S., Dreslinski, R., Eldefrawy, K., Genise, N., Peikert, C., & Sánchez, D. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.05371 · Cited by 19
Self-citationCheetah: Optimizations and Methods for PrivacyPreserving Inference via Homomorphic Encryption.Preprint
Reagen, B., Choi, W., Ko, Y., Lee, V. T., Wei, G.-Y., Lee, H.-H. S., & Brooks, D. M. (2020) · arXiv (Cornell University) · Cited by 11
A Novel Pipelined Algorithm and Modular Architecture for Non-Square Matrix Transposition
Zhang, B., Ma, Z., & Yu, F. N. (2020) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2020.3036183 · Cited by 10
Cited by
OpenFHE: Open-Source Fully Homomorphic Encryption Library
Al Badawi, A., Bates, J., Bergamaschi, F., Cousins, D. B., Erabelli, S., Genise, N., Halevi, S., Hunt, H., Kim, A., Lee, Y., et al. (2022) · Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography · doi:10.1145/3560827.3563379 · Cited by 281
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
Metadata
- Authors
- Samardzic, N., Feldmann, A., Krastev, A., Devadas, S., Dreslinski, R., Peikert, C., & Sanchez, D.
- Venue
- MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture
- Publisher
- ACM
- Published
- 2021-10-17
- Pages
- 238-252
- OpenAlex
- W3207326900
- Cited by
- 294
- References
- 52
- FWCI
- 19.13
- Type
- conference paper
- Language
- en
- Open access
- gold
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.