Proceedings of the 20th International Conference on Computer Systems and Technologies 2019
DOI: 10.1145/3345252.3345292
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation of the Complexity of Fully Homomorphic Encryption Schemes in Implementations of Programs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…Adding two b bit integers with the Paillier cryptosystem involves modular multiplication with O(b 2 ) complexity. Additions with an RLWE-like scheme involve polynomial additions linear to the number of bits for the given polynomial degree (Chakarov and Papazov 2019). With a specific integer encoding, subtraction becomes trivial expressed as encrypted additions.…”
Section: Basic Operationsmentioning
confidence: 99%
See 1 more Smart Citation
“…Adding two b bit integers with the Paillier cryptosystem involves modular multiplication with O(b 2 ) complexity. Additions with an RLWE-like scheme involve polynomial additions linear to the number of bits for the given polynomial degree (Chakarov and Papazov 2019). With a specific integer encoding, subtraction becomes trivial expressed as encrypted additions.…”
Section: Basic Operationsmentioning
confidence: 99%
“…However, with each additional multiplications, the ciphertext noise, cipher size, and cost increase. Generally, multiplying two b bit integers with RLWE-like crypto-systems involves homomorphically computing O(b 2 ) AND circuits (Chakarov and Papazov 2019). On the other hand, the AHE scheme requires one of the operands to be unencrypted to realize multiplication expressed as summations.…”
Section: Basic Operationsmentioning
confidence: 99%