The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Efficient Multi-Key Homomorphic Encryption with Packed Ciphertexts with Application to Oblivious Neural Network Inference
Abstract
Homomorphic Encryption (HE) is a cryptosystem which supports computation on encrypted data. Ló pez-Alt et al. (STOC 2012) proposed a generalized notion of HE, called Multi-Key Homomorphic Encryption (MKHE), which is capable of performing arithmetic operations on ciphertexts encrypted under different keys. In this paper, we present multi-key variants of two HE schemes with packed ciphertexts. We present new relinearization algorithms which are simpler and faster than previous method by Chen et al. (TCC 2017). We then generalize the bootstrapping techniques for HE to obtain multi-key fully homomorphic encryption schemes. We provide a proof-of-concept implementation of both MKHE schemes using Microsoft SEAL. For example, when the dimension of base ring is 8192, homomorphic multiplication between multi-key BFV (resp. CKKS) ciphertexts associated with four parties followed by a relinearization takes about 116 (resp. 67) milliseconds. Our MKHE schemes have a wide range of applications in secure computation between multiple data providers. As a benchmark, we homomorphically classify an image using a pre-trained neural network model, where input data and model are encrypted under different keys. Our implementation takes about 1.8 seconds to evaluate one convolutional layer followed by two fully connected layers on an encrypted image from the MNIST dataset.
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
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806 · cited 2×
“Previous work had different goals and solutions depending on the underlying schemes but they are basically following the Gentry’s technique [24] – homomorphic evaluation of the decryption circuit.”
BackgroundCompleteness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
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 7×
“The CKKS scheme [16] is a leveled HE scheme with support for approximate fixed-point arithmetic.”
MethodInfluentialSelf-citationSecureML: A System for Scalable Privacy-Preserving Machine Learning
Mohassel, P., & Zhang, Y. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.12 · Cited by 1,936 · cited 1×
“Another model was proposed where the data owners secret-share their data with a small number of independent servers, who perform an MPC to generate the computation result [23, 44].”
Background(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
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
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
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
López-Alt, A., Tromer, E., & Vaikuntanathan, V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214086 · Cited by 910
On the concrete hardness of Learning with Errors
Albrecht, M. R., Player, R., & Scott, S. (2015) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2015-0016 · Cited by 861
Oblivious Neural Network Predictions via MiniONN Transformations
Liu, J., Juuti, M., Lu, Y., & Asokan, N. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134056 · Cited by 691
Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
Chillotti, I., Gama, N., Georgieva, M., & Izabachène, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53887-6_1 · Cited by 684
Halevi, S., & Shoup, V. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44371-2_31 · Cited by 559
Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
Damgård, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., & Smart, N. P. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40203-6_1 · Cited by 458
Secure Outsourced Matrix Computation and Application to Neural Networks
Jiang, X., Kim, M., Lauter, K., & Song, Y. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243837 · Cited by 313
Self-citationTwo Round Multiparty Computation via Multi-key FHE
Mukherjee, P., & Wichs, D. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-49896-5_26 · Cited by 308
Overdrive: Making SPDZ Great Again
Keller, M., Pastro, V., & Rotaru, D. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-78372-7_6 · Cited by 275
Multi-identity and Multi-key Leveled FHE from Learning with Errors
Clear, M., & McGoldrick, C. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-48000-7_31 · Cited by 219
Halevi, S., & Shoup, V. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46800-5_25 · Cited by 202
Privacy-preserving distributed linear regression on high-dimensional data
Gascón, A., Schoppmann, P., Balle, B., Raykova, M., Doerner, J., Zahur, S., & Evans, D. (2017) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2017-0053 · Cited by 193
Global-Scale Secure Multiparty Computation
Wang, X., Ranellucci, S., & Katz, J. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3133979 · Cited by 186
Faster Homomorphic Linear Transformations in HElib
Halevi, S., & Shoup, V. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-96884-1_4 · Cited by 177
Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
Brakerski, Z., & Perlman, R. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53018-4_8 · Cited by 170
Improved Bootstrapping for Approximate Homomorphic Encryption
Chen, H., Chillotti, I., & Song, Y. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-17656-3_2 · Cited by 169
Self-citationMulti-key FHE from LWE, Revisited
Peikert, C., & Shiehian, S. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53644-5_9 · Cited by 150
Batched Multi-hop Multi-key FHE from Ring-LWE with Compact Ciphertext Extension
Chen, L., Zhang, Z., & Wang, X. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70503-3_20 · Cited by 98
Efficient Multi-Key FHE With Short Extended Ciphertexts and Directed Decryption Protocol
Li, N., Zhou, T., Yang, X., Han, Y., Liu, W., & Tu, G. (2019) · IEEE Access · doi:10.1109/access.2019.2913943 · Cited by 24
Cited by
Privacy‐preserving federated learning based on multi‐key homomorphic encryption
Ma, J., Naas, S., Sigg, S., & Lyu, X. (2022) · International Journal of Intelligent Systems · doi:10.1002/int.22818 · Cited by 421
Privacy-Enhanced Federated Learning Against Poisoning Adversaries
Liu, X., Li, H., Xu, G., Chen, Z., Huang, X., & Lu, R. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2021.3108434 · Cited by 351
Contact Tracing Mobile Apps for COVID-19: Privacy Considerations and Related Trade-offs
Cho, H., Ippolito, D., & Yu, Y. W. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.11511 · Cited by 350
VeriFL: Communication-Efficient and Fast Verifiable Aggregation for Federated Learning
Guo, X., Liu, Z., Li, J., Gao, J., Hou, B., Dong, C., & Baker, T. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2020.3043139 · Cited by 314
Privacy-Preserving Federated Transfer Learning for Driver Drowsiness Detection
Zhang, L., Saito, H., Yang, L., & Wu, J. (2022) · IEEE Access · doi:10.1109/access.2022.3192454 · Cited by 54
Metadata
- Authors
- Chen, H., Dai, W., Kim, M., & Song, Y.
- Venue
- Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2019-11-06
- Volume
- 2019
- Pages
- 395-412
- OpenAlex
- W2954783273
- Cited by
- 256
- References
- 26
- FWCI
- 8.41
- Type
- conference paper
- Language
- en
- Open access
- closed
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.