An update on SIPHER (Scalable Implementation of Primitives for Homomorphic EncRyption) &amp;#x2014; FPGA implementation using Simulink

Cousins, David Bruce; Rohloff, Kurt; Peikert, Chris; Schantz, Richard

doi:10.1109/hpec.2012.6408672

Cited by 23 publications

(17 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cousins et al [16,17] proposed a hardware implementation on an FPGA platform using the Matlab HDL Coder tool; however they do not report any implementation or simulation results. More recently, an ASIC implementation of a multiplier for the GH FHE scheme is proposed by Doröz et al [18]; this implementation shows comparable performance to the original software implementation and uses less area.…”

Section: Introductionmentioning

confidence: 99%

High-Speed Fully Homomorphic Encryption Over the Integers

Cao

Moore

O’Neill

et al. 2014

Financial Cryptography and Data Security

View full text Add to dashboard Cite

Abstract. A fully homomorphic encryption (FHE) scheme is envisioned as a key cryptographic tool in building a secure and reliable cloud computing environment, as it allows arbitrary evaluation of a ciphertext without revealing the plaintext. However, existing FHE implementations remain impractical due to very high time and resource costs. To the authors' knowledge, this paper presents the first hardware implementation of an encryption primitive for FHE over the integers using FPGA technology. A large-integer multiplier architecture utilising Integer-FFT multiplication is proposed, and a large-integer Barrett modular reduction module is designed incorporating the proposed multiplier. The encryption primitive used in the integer-based FHE scheme is designed employing the proposed multiplier and modular reduction modules. The designs are verified using the Xilinx Virtex-7 FPGA platform. Experimental results show that a speed improvement factor of up to 44 is achievable for the hardware implementation of the FHE encryption scheme when compared to its corresponding software implementation. Moreover, performance analysis shows further speed improvements of the integer-based FHE encryption primitives may still be possible, for example through further optimisations or by targeting an ASIC platform.

show abstract

Section: Introductionmentioning

confidence: 99%

High-Speed Fully Homomorphic Encryption Over the Integers

Cao

Moore

O’Neill

et al. 2014

Financial Cryptography and Data Security

View full text Add to dashboard Cite

show abstract

“…Our results also show considerable speedups over their implementation. Another homomorphic library was developed by Rohloff, Cousins, and Peikert [17]. In their paper they implement primary building blocks in hardware to accelerate their system.…”

Section: Related Workmentioning

confidence: 99%

SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers

Khedr

Gulak

Vaikuntanathan

2016

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-Homomorphic encryption (HE) systems enable computations on encrypted data, without decrypting and without knowledge of the secret key. In this work, we describe an optimized Ring Learning With Errors (RLWE) based implementation of a variant of the HE system recently proposed by Gentry, Sahai and Waters (GSW). Although this system was widely believed to be less efficient than its contemporaries, we demonstrate quite the opposite behavior for a large class of applications. We first highlight and carefully exploit the algebraic features of the system to achieve significant speedup over the state-of-the-art HE implementation, namely the IBM homomorphic encryption library (HElib). We introduce several optimizations on top of our HE implementation, and use the resulting scheme to construct a homomorphic Bayesian spam filter, secure multiple keyword search, and a homomorphic evaluator for binary decision trees. Our results show a factor of 10× improvement in performance (under the same security settings and CPU platforms) compared to IBM HElib for these applications. Our system is built to be easily portable to GPUs (unlike IBM HElib) which results in an additional speedup of up to a factor of 103.5× to offer an overall speedup of 1035×.

show abstract

“…Fast Fourier transforms (FFTs) can also be used for multiplications, particularly when many multiplications are required. The use of FFTs has also been suggested in previous homomorphic encryption implementations [13]. Another alternative is Montgomery multiplication, commonly used in asymmetric cryptosystems.…”

Section: Overview Of the Comba Multiplication Algorithmmentioning

confidence: 99%

“…To our knowledge, there are no current hardware implementations of complete FHE schemes; however there has been work on FPGA implementation of primitives for a SHE scheme using Mathworks® Simulink [13]. There has also been research in similar areas, for example [14] discusses the practicality of existing applications of homomorphic encryption by an empirical evaluation based on the lattice-based scheme by Smart and Vercauteren [15], and highlights implementation issues such as memory access.…”

Section: Introductionmentioning

confidence: 99%

Targeting FPGA DSP Slices for a Large Integer Multiplier for Integer Based FHE

Moore¹,

Hanley²,

McAllister³

et al. 2013

Financial Cryptography and Data Security

View full text Add to dashboard Cite

Abstract. Homomorphic encryption offers potential for secure cloud computing. However due to the complexity of homomorphic encryption schemes, performance of implemented schemes to date have been unpractical. This work investigates the use of hardware, specifically Field Programmable Gate Array (FPGA) technology, for implementing the building blocks involved in somewhat and fully homomorphic encryption schemes in order to assess the practicality of such schemes. We concentrate on the selection of a suitable multiplication algorithm and hardware architecture for large integer multiplication, one of the main bottlenecks in many homomorphic encryption schemes. We focus on the encryption step of an integer-based fully homomorphic encryption (FHE) scheme. We target the DSP48E1 slices available on Xilinx Virtex 7 FPGAs to ascertain whether the large integer multiplier within the encryption step of a FHE scheme could fit on a single FPGA device. We find that, for toy size parameters for the FHE encryption step, the large integer multiplier fits comfortably within the DSP48E1 slices, greatly improving the practicality of the encryption step compared to a software implementation. As multiplication is an important operation in other FHE schemes, a hardware implementation using this multiplier could also be used to improve performance of these schemes.

show abstract

An update on SIPHER (Scalable Implementation of Primitives for Homomorphic EncRyption) — FPGA implementation using Simulink

Cited by 23 publications

References 3 publications

High-Speed Fully Homomorphic Encryption Over the Integers

High-Speed Fully Homomorphic Encryption Over the Integers

SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers

Targeting FPGA DSP Slices for a Large Integer Multiplier for Integer Based FHE

Contact Info

Product

Resources

About