2018
DOI: 10.1515/gcc-2018-0006
|View full text |Cite
|
Sign up to set email alerts
|

Practical private-key fully homomorphic encryption in rings

Abstract: We describe a practical fully homomorphic encryption (FHE) scheme based on homomorphisms between rings and show that it enables very efficient computation on encrypted data. Our encryption though is private-key; public information is only used to operate on encrypted data without decrypting it. Still, we show that our method allows for a third party search on encrypted data.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…Although the TF ripple will be slightly increased to 0.54% at 2.65 T [29], the TF ripple induced NB fast ion losses appear to stay at low level.…”
Section: Heating and Current Drivementioning
confidence: 92%
“…Although the TF ripple will be slightly increased to 0.54% at 2.65 T [29], the TF ripple induced NB fast ion losses appear to stay at low level.…”
Section: Heating and Current Drivementioning
confidence: 92%
“…The encrypted data and encrypted model (E2DM) framework performs classiication of encrypted data using an encrypted neural network model [115]. Implementation uses the HEAAN library and the square activation function [130].…”
Section: Namementioning
confidence: 99%