Hao Chen
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.
Supplemental Material
- Martin Abadi, Ashish Agarwal, Paul Barham, Eugene Brevdo, Zhifeng Chen, Craig Citro, Greg S Corrado, Andy Davis, Jeffrey Dean, Matthieu Devin, et al. 2015. Tensorflow: Large-scale machine learning on heterogeneous distributed systems. https://www.tensorflow.org.Google Scholar
- Martin Albrecht, Melissa Chase, Hao Chen, Jintai Ding, Shafi Goldwasser, Sergey Gorbunov, Shai Halevi, Jeffrey Hoffstein, Kim Laine, Kristin Lauter, Satya Lokam, Daniele Micciancio, Dustin Moody, Travis Morrison, Amit Sahai, and Vinod Vaikuntanathan. 2018. Homomorphic Encryption Security Standard. Technical Report. HomomorphicEncryption.org, Toronto, Canada.Google Scholar
- Martin R Albrecht, Rachel Player, and Sam Scott. 2015. On the concrete hardness of learning with errors. Journal of Mathematical Cryptology, Vol. 9, 3 (2015), 169--203.Google ScholarCross Ref
- Jean-Claude Bajard, Julien Eynard, M Anwar Hasan, and Vincent Zucca. 2016. A full RNS variant of FV like somewhat homomorphic encryption schemes. In International Conference on Selected Areas in Cryptography. Springer, 423--442.Google Scholar
- Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the twentieth annual ACM symposium on Theory of computing. ACM, 1--10.Google ScholarDigital Library
- Zvika Brakerski. 2012. Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. In CRYPTO 2012, Reihaneh Safavi-Naini and Ran Canetti (Eds.). Lecture Notes in Computer Science, Vol. 7417. Springer, 868--886.Google ScholarDigital Library
- Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. 2012. (Leveled) fully homomorphic encryption without bootstrapping. In Proc. of ITCS. ACM, 309--325.Google ScholarDigital Library
- Zvika Brakerski and Renen Perlman. 2016. Lattice-based fully dynamic multi-key FHE with short ciphertexts. In Annual Cryptology Conference. Springer, 190--213.Google ScholarDigital Library
- Hao Chen, Ilaria Chillotti, and Yongsoo Song. 2019 a. Improved bootstrapping for approximate homomorphic encryption. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 34--54.Google ScholarDigital Library
- Hao Chen, Ilaria Chillotti, and Yongsoo Song. 2019 b. Multi-Key Homomophic Encryption from TFHE. Cryptology ePrint Archive, Report 2019/116. https://eprint.iacr.org/2019/116.Google Scholar
- Hao Chen, Ran Gilad-Bachrach, Kyoohyung Han, Zhicong Huang, Amir Jalali, Kim Laine, and Kristin Lauter. 2018. Logistic regression over encrypted data from fully homomorphic encryption. BMC medical genomics, Vol. 11, 4 (2018), 81.Google Scholar
- Hao Chen and Kyoohyung Han. 2018. Homomorphic Lower Digits Removal and Improved FHE Bootstrapping. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 315--337.Google Scholar
- Long Chen, Zhenfeng Zhang, and Xueqing Wang. 2017. Batched Multi-hop Multi-key FHE from Ring-LWE with Compact Ciphertext Extension. In Theory of Cryptography Conference. Springer, 597--627.Google ScholarDigital Library
- Jung Hee Cheon, Kyoohyung Han, Andrey Kim, Miran Kim, and Yongsoo Song. 2018a. Bootstrapping for Approximate Homomorphic Encryption. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 360--384.Google Scholar
- Jung Hee Cheon, Kyoohyung Han, Andrey Kim, Miran Kim, and Yongsoo Song. 2018b. A full RNS variant of approximate homomorphic encryption. In International Conference on Selected Areas in Cryptography. Springer.Google Scholar
- Jung Hee Cheon, Andrey Kim, Miran Kim, and Yongsoo Song. 2017. Homomorphic encryption for arithmetic of approximate numbers. In International Conference on the Theory and Application of Cryptology and Information Security. Springer, 409--437.Google ScholarCross Ref
- Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabachene. 2016. Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds. In Advances in Cryptology -- ASIACRYPT 2016. Springer, 3--33.Google ScholarCross Ref
- Francois Chollet et al. 2015. Keras. https://github.com/keras-team/keras.Google Scholar
- Michael Clear and Ciaran McGoldrick. 2015. Multi-identity and multi-key leveled FHE from learning with errors. In Annual Cryptology Conference. Springer, 630--656.Google ScholarDigital Library
- Ivan Damgård, Marcel Keller, Enrique Larraia, Valerio Pastro, Peter Scholl, and Nigel P Smart. 2013. Practical covertly secure MPC for dishonest majority--or: breaking the SPDZ limits. In European Symposium on Research in Computer Security. Springer, 1--18.Google ScholarCross Ref
- Léo Ducas and Daniele Micciancio. 2015. FHEW: Bootstrapping homomorphic encryption in less than a second. In Advances in Cryptology--EUROCRYPT 2015. Springer, 617--640.Google Scholar
- Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. Cryptology ePrint Archive, Report 2012/144. https://eprint.iacr.org/2012/144.Google Scholar
- Adrià Gascón, Phillipp Schoppmann, Borja Balle, Mariana Raykova, Jack Doerner, Samee Zahur, and David Evans. 2017. Privacy-preserving distributed linear regression on high-dimensional data. Proceedings on Privacy Enhancing Technologies, Vol. 2017, 4 (2017), 345--364.Google ScholarCross Ref
- Craig Gentry. 2009. Fully Homomorphic Encryption Using Ideal Lattices. In Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing (STOC '09). ACM, 169--178. https://doi.org/10.1145/1536414.1536440Google ScholarDigital Library
- Craig Gentry, Shai Halevi, and Nigel P. Smart. 2012a. Better bootstrapping in fully homomorphic encryption. In Public Key Cryptography--PKC 2012. Springer, 1--16.Google ScholarDigital Library
- Craig Gentry, Shai Halevi, and Nigel P. Smart. 2012b. Fully Homomorphic Encryption with Polylog Overhead. In EUROCRYPT 2012, David Pointcheval and Thomas Johansson (Eds.). Lecture Notes in Computer Science, Vol. 7237. Springer, 465--482.Google ScholarDigital Library
- Craig Gentry, Shai Halevi, and Nigel P. Smart. 2012c. Homomorphic Evaluation of the AES Circuit. In Advances in Cryptology - CRYPTO 2012 (Lecture Notes in Computer Science), Reihaneh Safavi-Naini and Ran Canetti (Eds.), Vol. 7417. Springer, 850--867.Google ScholarDigital Library
- Craig Gentry, Amit Sahai, and Brent Waters. 2013. Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In Advances in Cryptology--CRYPTO 2013. Springer, 75--92.Google ScholarCross Ref
- Ran Gilad-Bachrach, Nathan Dowlin, Kim Laine, Kristin Lauter, Michael Naehrig, and John Wernsing. 2016. CryptoNets: Applying neural networks to encrypted data with high throughput and accuracy. In International Conference on Machine Learning. 201--210.Google ScholarDigital Library
- Shai Halevi, Yuriy Polyakov, and Victor Shoup. 2019. An improved RNS variant of the BFV homomorphic encryption scheme. In Cryptographers' Track at the RSA Conference. Springer, 83--105.Google Scholar
- Shai Halevi and Victor Shoup. 2014. Algorithms in HElib. In Advances in Cryptology--CRYPTO 2014. Springer, 554--571.Google ScholarCross Ref
- Shai Halevi and Victor Shoup. 2015. Bootstrapping for HElib. In Advances in Cryptology--EUROCRYPT 2015. Springer, 641--670.Google ScholarCross Ref
- Shai Halevi and Victor Shoup. 2018. Faster homomorphic linear transformations in HElib. In Annual International Cryptology Conference. Springer, 93--120.Google ScholarDigital Library
- Xiaoqian Jiang, Miran Kim, Kristin Lauter, and Yongsoo Song. 2018. Secure outsourced matrix computation and application to neural networks. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. ACM, 1209--1222.Google ScholarDigital Library
- Chiraag Juvekar, Vinod Vaikuntanathan, and Anantha Chandrakasan. 2018. GAZELLE: A Low Latency Framework for Secure Neural Network Inference. In 27th USENIX Security Symposium (USENIX Security 18). USENIX Association, Baltimore, MD.Google ScholarDigital Library
- Marcel Keller, Valerio Pastro, and Dragos Rotaru. 2018. Overdrive: making SPDZ great again. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 158--189.Google ScholarCross Ref
- Andrey Kim, Yongsoo Song, Miran Kim, Keewoo Lee, and Jung Hee Cheon. 2018a. Logistic Regression Model Training based on the Approximate Homomorphic Encryption. BMC medical genomics, Vol. 11, 4 (2018), 83.Google Scholar
- Miran Kim, Yongsoo Song, Baiyu Li, and Daniele Micciancio. 2019. Semi-parallel logistic regression for GWAS on encrypted data. Cryptology ePrint Archive, Report 2019/294. https://eprint.iacr.org/2019/294.Google Scholar
- Miran Kim, Yongsoo Song, Shuang Wang, Yuhou Xia, and Xiaoqian Jiang. 2018b. Secure Logistic Regression Based on Homomorphic Encryption: Design and Evaluation. JMIR medical informatics, Vol. 6, 2 (2018).Google Scholar
- Yann LeCun. 1998. The MNIST database of handwritten digits. http://yann.lecun.com/exdb/mnist/ (1998).Google Scholar
- Ningbo Li, Tanping Zhou, Xiaoyuan Yang, Yiliang Han, Wenchao Liu, and Guangsheng Tu. 2019. Efficient Multi-Key FHE With Short Extended Ciphertexts and Directed Decryption Protocol. IEEE Access, Vol. 7 (2019), 56724--56732.Google ScholarCross Ref
- Jian Liu, Mika Juuti, Yao Lu, and N Asokan. 2017. Oblivious neural network predictions via minionn transformations. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM, 619--631.Google ScholarDigital Library
- Adriana López-Alt, Eran Tromer, and Vinod Vaikuntanathan. 2012. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing. ACM, 1219--1234.Google ScholarDigital Library
- Payman Mohassel and Yupeng Zhang. 2017. SecureML: A system for scalable privacy-preserving machine learning. In 2017 38th IEEE Symposium on Security and Privacy (SP). IEEE, 19--38.Google ScholarCross Ref
- Pratyay Mukherjee and Daniel Wichs. 2016. Two round multiparty computation via multi-key FHE. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 735--763.Google ScholarCross Ref
- Chris Peikert and Sina Shiehian. 2016. Multi-key FHE from LWE, revisited. In Theory of Cryptography Conference. Springer, 217--238.Google ScholarDigital Library
- Nigel P Smart and Frederik Vercauteren. 2014. Fully homomorphic textSIMD operations. Designs, codes and cryptography, Vol. 71, 1 (2014), 57--81.Google Scholar
- Xiao Wang, Samuel Ranellucci, and Jonathan Katz. 2017. Global-scale secure multiparty computation. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM, 39--56.Google ScholarDigital Library
- Andrew Chi-Chih Yao. 1986. How to generate and exchange secrets. In Foundations of Computer Science, 1986., 27th Annual Symposium on. IEEE, 162--167.Google Scholar
Index Terms
- Efficient Multi-Key Homomorphic Encryption with Packed Ciphertexts with Application to Oblivious Neural Network Inference
Recommendations
Multi-key homomorphic encryption with tightened RGSW ciphertexts without relinearization for ciphertexts product
AbstractMost previous RLWE-based multi-key homomorphic encryptions (MKHEs) need to perform complex relinearization operations on ciphertext products to complete the evaluation of circuits of bounded polynomial depth. In this process, many intermediate ...
Asymptotically Faster Multi-Key Homomorphic Encryption from Homomorphic Gadget Decomposition
CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications SecurityHomomorphic Encryption (HE) is a cryptosytem that allows us to perform an arbitrary computation on encrypted data. The standard HE, however, has a disadvantage in that the authority is concentrated in the secret key owner since computations can only be ...
Multi-hop Multi-key Homomorphic Encryption with Less Noise Under CRS Model
Cyberspace Safety and SecurityAbstractThe application of information technologies such as big data, artificial intelligence, and cloud computing in the Internet environment makes protecting personal privacy and preventing data leakage an important issue. Homomorphic encryption (HE) ...
Comments