Accelerating Fully Homomorphic Encryption on GPUs

@inproceedings{Wang2012AcceleratingFH,
  title={Accelerating Fully Homomorphic Encryption on GPUs},
  author={Wei Wang and Yin Hu and Lianmu Chen and Xinming Huang and Berk Sunar},
  year={2012}
}
In a major breakthrough, in 2009 Gentry introduced the first plausible construction of a fully homomorphic encryption (FHE) scheme. FHE allows the evaluation of arbitrary functions directly on encrypted data on untwisted servers. In 2010, Ge ntry and Halevi presented the first FHE implementation on an IBM x3500 server. However, this implementation remains imprac tical due to the high latency of encryption and recryption. The GentryHalevi (GH) FHE primitives, utilize multi-million-bit mod ular… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 19 references

SIPH ER: Scalable implementation of primitives for homomorphic encryption– FPGA implementation using Simulink,”High Performance Extreme Computing

D. Cousins, K. Rohloff, C. Peikert, R. Schantz
2011
View 1 Excerpt

SIPHER : Scalable implementation of primitives for homomorphic encryption – FPGA implementation using Simulink

X. Cui, Y. Chen, H. Mei
2011

Three app lic tions of gpu computing in neuroscience

J. Baladron Pezoa, D. Fasoli, O. Faugeras
Computing in Science & Engineering , no. 99, pp. 1–1, 2011. • 2011
View 1 Excerpt

Improving Performance of Matrix Multiplication and FFT on GPU

2009 15th International Conference on Parallel and Distributed Systems • 2009
View 1 Excerpt

Similar Papers

Loading similar papers…