Can homomorphic encryption be practical?

Key Points

Key points are not available for this paper at this time.

Abstract

The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy concerns for individuals and businesses alike. The privacy concerns can be satisfactorily addressed if users encrypt the data they send to the cloud. If the encryption scheme is homomorphic, the cloud can still perform meaningful computations on the data, even though it is encrypted.

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Discussion

Authors

Michael Naehrig

Microsoft (United States)

Kristin Lauter

Institute for Health Metrics and Evaluation

Vinod Vaikuntanathan

Massachusetts Institute of Technology

Actions

Institutions

University of Toronto

Microsoft (United States)

Eindhoven University of Technology

References and Citations

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Discussion

Cite this study

Naehrig et al. (Fri,) studied this question.

synapsesocial.com/papers/6a17c2cc1723722a886ef396 — DOI: https://doi.org/10.1145/2046660.2046682

Also consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

Efficient Fully Homomorphic Encryption from (Standard) LWE· 2011 · 1,461 citations
A public key cryptosystem and a signature scheme based on discrete logarithms· 1985 · 8,011 citations
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures· 2007 · 896 citations
A Robust and Verifiable Cryptographically Secure Election Scheme (Extended Abstract)· 1985 · 73 citations
Estimating the Security of Lattice-based Cryptosystems.· 2010 · 56 citations

Also consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

Efficient Fully Homomorphic Encryption from (Standard) LWE· 2011 · 1,461 citations
A public key cryptosystem and a signature scheme based on discrete logarithms· 1985 · 8,011 citations
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures· 2007 · 896 citations
A Robust and Verifiable Cryptographically Secure Election Scheme (Extended Abstract)· 1985 · 73 citations
Estimating the Security of Lattice-based Cryptosystems.· 2010 · 56 citations

Can homomorphic encryption be practical?

Key Points

Abstract

Citation Network

Connected Papers

Discussion

Authors

Actions

Institutions

References and Citations

Citation Network

Connected Papers

Discussion

Cite this study

Also consider

Also consider