Affiliation:
1. University of California, San Diego, USA
2. Intel Labs, USA
Abstract
The increasing amount of data and the growing complexity of problems has resulted in an ever-growing reliance on cloud computing. However, many applications, most notably in healthcare, finance or defense, demand security and privacy which today’s solutions cannot fully address. Fully homomorphic encryption (FHE) elevates the bar of today’s solutions by adding confidentiality of data during processing. It allows computation on fully encrypted data without the need for decryption, thus fully preserving privacy. To enable processing encrypted data at usable levels of classic security, e.g., 128-bit, the encryption procedure introduces noticeable data size expansion - the ciphertext is much bigger than the native aggregate of native data types. In this paper, we present MemFHE which is the first accelerator of both client and server for the latest Ring-GSW (Gentry, Sahai, and Waters [17]) based homomorphic encryption schemes using Processing In Memory (PIM). PIM alleviates the data movement issues with large FHE encrypted data, while providing in-situ execution and extensive parallelism needed for FHE’s polynomial operations. While the client-PIM can homomorphically encrypt and decrypt data, the server-PIM can process homomorphically encrypted data without decryption. MemFHE’s server-PIM is pipelined and is designed to provide flexible bootstrapping, allowing two encryption techniques and various FHE security-levels based on the application requirements. We evaluate MemFHE for various security-levels and compare it with state-of-the-art CPU implementations for Ring-GSW based FHE. MemFHE is up to 20
k
× (265 ×) faster than CPU (GPU) for FHE arithmetic operations and provides on average 2007 × higher throughput than [36] while implementing neural networks with FHE.
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture,Software
Reference56 articles.
1. Faster Bootstrapping with Polynomial Error
2. Paul Barrett. 1986. Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor. In CRYPTO. Paul Barrett. 1986. Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor. In CRYPTO.
3. Hervé Chabanne , Amaury de Wargny , Jonathan Milgram , Constance Morel , and Emmanuel Prouff . 2017. Privacy-Preserving Classification on Deep Neural Network.IACR Cryptol. ePrint Arch. 2017 ( 2017 ), 35. Hervé Chabanne, Amaury de Wargny, Jonathan Milgram, Constance Morel, and Emmanuel Prouff. 2017. Privacy-Preserving Classification on Deep Neural Network.IACR Cryptol. ePrint Arch. 2017 (2017), 35.
4. Homomorphic Lower Digits Removal and Improved FHE Bootstrapping
5. Labeled PSI from Fully Homomorphic Encryption with Malicious Security
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献