Some security bounds for the key sizes of DGHV scheme

The correctness in decrypting a ciphertext after some operations in the DGVH scheme depends heavily on the dimension of the secret key. In this paper we compute two bounds on the size of the secret key for the DGHV scheme to decrypt correctly a ciphertext after a fixed number of additions and a fixe...

Full description

Saved in:

Bibliographic Details
Published in:	Applicable algebra in engineering, communication and computing Vol. 25; no. 5; pp. 383 - 392
Main Authors:	Marinelli, Franca, Aragona, Riccardo, Marcolla, Chiara, Sala, Massimiliano
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01-11-2014
Subjects:	Artificial Intelligence Computer Hardware Computer Science Original Paper Symbolic and Algebraic Manipulation Theory of Computation DGVH scheme Fully homomorphic encryption Public-key cryptography Somewhat homomorphic encryption
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	The correctness in decrypting a ciphertext after some operations in the DGVH scheme depends heavily on the dimension of the secret key. In this paper we compute two bounds on the size of the secret key for the DGHV scheme to decrypt correctly a ciphertext after a fixed number of additions and a fixed number of multiplication. Moreover we improve the original bound on the dimension of the secret key for a general circuit.
ISSN:	0938-1279 1432-0622
DOI:	10.1007/s00200-014-0232-5