On implementation of the Gentry-Halevi somewhat homomorphic scheme

Authors:
Michal Mikuš
Affiliations:
Slovak University of Technology in Bratislava, Faculty of Electrical Engineering and Information Technology, Department of Applied Informatics and Computing Technology, Slovakia
Venue:
ICCC'11 Proceedings of the 2011 international conference on Computers and computing
Year:
2011

Citing 6
Cited 0

Processing encrypted data

Communications of the ACM
Fully homomorphic encryption using ideal lattices

Proceedings of the forty-first annual ACM symposium on Theory of computing
A fully homomorphic encryption scheme

A fully homomorphic encryption scheme
Implementing Gentry's fully-homomorphic encryption scheme

EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Evaluating 2-DNF formulas on ciphertexts

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Fully homomorphic encryption over the integers

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have implemented the somewhat homomorphic scheme from [7]. We examined this scheme in the same way as mentioned in [7] and extend the results for a wider set of parameters. We focused on the dependencies between the largest supported degree and various parameters of the cryptosystem. We show that the growth of the supported degree doesn't grow linearly with the parameter t and we give an explanation for this fact.