Some security bounds for the key sizes of DGHV scheme
From MaRDI portal
Publication:2254535
DOI10.1007/s00200-014-0232-5zbMath1315.94091OpenAlexW2040450667MaRDI QIDQ2254535
Riccardo Aragona, Chiara Marcolla, Franca Marinelli, Massimiliano Sala
Publication date: 5 February 2015
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2318/1554334
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- (Leveled) fully homomorphic encryption without bootstrapping
- Fully Homomorphic Encryption with Polylog Overhead
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Fully Homomorphic Encryption over the Integers
- Computing arbitrary functions of encrypted data
- Batch Fully Homomorphic Encryption over the Integers
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption over the Integers with Shorter Public Keys
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Computing Blindfolded: New Developments in Fully Homomorphic Encryption
- Efficient Fully Homomorphic Encryption from (Standard) LWE
This page was built for publication: Some security bounds for the key sizes of DGHV scheme