Public-Key Cryptosystems from Lattice Reduction Problems
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Improving Lattice Based Cryptosystems Using the Hermite Normal Form
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Lattices that admit logarithmic worst-case to average-case connection factors
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Toward basing fully homomorphic encryption on worst-case hardness
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
An improvement of key generation algorithm for Gentry's homomorphic encryption scheme
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Fully homomorphic encryption with relatively small key and ciphertext sizes
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
On ideal lattices and learning with errors over rings
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
On implementation of the Gentry-Halevi somewhat homomorphic scheme
ICCC'11 Proceedings of the 2011 international conference on Computers and computing
Outsourcing the decryption of ABE ciphertexts
SEC'11 Proceedings of the 20th USENIX conference on Security
The geometry of lattice cryptography
Foundations of security analysis and design VI
Fully homomorphic encryption over the integers with shorter public keys
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Fully homomorphic encryption from ring-LWE and security for key dependent messages
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Twin clouds: secure cloud computing with low latency
CMS'11 Proceedings of the 12th IFIP TC 6/TC 11 international conference on Communications and multimedia security
Can homomorphic encryption be practical?
Proceedings of the 3rd ACM workshop on Cloud computing security workshop
Towards ensuring client-side computational integrity
Proceedings of the 3rd ACM workshop on Cloud computing security workshop
(Leveled) fully homomorphic encryption without bootstrapping
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
On CCA-Secure somewhat homomorphic encryption
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
Improved key generation for gentry's fully homomorphic encryption scheme
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
On constructing homomorphic encryption schemes from coding theory
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Breaking fully-homomorphic-encryption challenges
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Fully homomorphic encryption based two-party association rule mining
Data & Knowledge Engineering
On the CCA-1 security of somewhat homomorphic encryption over the integers
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Public key compression and modulus switching for fully homomorphic encryption over the integers
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Fully homomorphic encryption with polylog overhead
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Better bootstrapping in fully homomorphic encryption
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Efficient multiplication over extension fields
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
Shift-type homomorphic encryption and its application to fully homomorphic encryption
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Reaction attack on outsourced computing with fully homomorphic encryption schemes
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Efficient lookup-table protocol in secure multiparty computation
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Towards an interpreter for efficient encrypted computation
Proceedings of the 2012 ACM Workshop on Cloud computing security workshop
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Outsourcing encryption of attribute-based encryption with mapreduce
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Protecting data confidentiality in cloud systems
Proceedings of the Fourth Asia-Pacific Symposium on Internetware
A framework for context-aware privacy of sensor data on mobile systems
Proceedings of the 14th Workshop on Mobile Computing Systems and Applications
Encrypted messages from the heights of cryptomania
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
When homomorphism becomes a liability
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
MrCrypt: static analysis for secure cloud computations
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
AUTOCRYPT: enabling homomorphic computation on servers to protect sensitive web content
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Secure pattern matching using somewhat homomorphic encryption
Proceedings of the 2013 ACM workshop on Cloud computing security workshop
From oblivious AES to efficient and secure database join in the multiparty setting
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Cryptanalysis of Brenner et al.'s somewhat homomorphic encryption scheme
AISC '13 Proceedings of the Eleventh Australasian Information Security Conference - Volume 138
Fully homomorphic SIMD operations
Designs, Codes and Cryptography
| Hi-index | 0.00 |
We describe a working implementation of a variant of Gentry's fully homomorphic encryption scheme (STOC 2009), similar to the variant used in an earlier implementation effort by Smart and Vercauteren (PKC 2010). Smart and Vercauteren implemented the underlying "somewhat homomorphic" scheme, but were not able to implement the bootstrapping functionality that is needed to get the complete scheme to work. We show a number of optimizations that allow us to implement all aspects of the scheme, including the bootstrapping functionality. Our main optimization is a key-generation method for the underlying somewhat homomorphic encryption, that does not require full polynomial inversion. This reduces the asymptotic complexity from Õ(n2.5) to Õ(n1.5) when working with dimension-n lattices (and practically reducing the time from many hours/days to a few seconds/minutes). Other optimizations include a batching technique for encryption, a careful analysis of the degree of the decryption polynomial, and some space/time trade-offs for the fully-homomorphic scheme. We tested our implementation with lattices of several dimensions, corresponding to several security levels. From a "toy" setting in dimension 512, to "small," "medium," and "large" settings in dimensions 2048, 8192, and 32768, respectively. The public-key size ranges in size from 70 Megabytes for the "small" setting to 2.3 Gigabytes for the "large" setting. The time to run one bootstrapping operation (on a 1-CPU 64- bit machine with large memory) ranges from 30 seconds for the "small" setting to 30 minutes for the "large" setting.