Poster: an implementation of the fully homomorphic smart-vercauteren crypto-system

Authors:
Henning Perl;Michael Brenner;Matthew Smith
Affiliations:
Distributed Computing Security Group, Leibniz Universitaet Hannover, Hannover, Germany;Distributed Computing Security Group, Leibniz Universitaet Hannover, Hannover, Germany;Distributed Computing Security Group, Leibniz Universitaet Hannover, Hannover, Germany
Venue:
Proceedings of the 18th ACM conference on Computer and communications security
Year:
2011

Citing 2
Cited 2

Fully homomorphic encryption using ideal lattices

Proceedings of the forty-first annual ACM symposium on Theory of computing
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

Protecting data confidentiality in cloud systems

Proceedings of the Fourth Asia-Pacific Symposium on Internetware
POSTER: Caching oblivious memory access: an extension to the HCRYPT virtual machine

Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Since the discovery of a fully homomorphic cryptographic scheme by Gentry, a number of different schemes have been proposed that apply the bootstrap technique of Gentry's original approach. However, to date no implementation of fully homomorphic encryption has been publicly released. This poster presents a working implementation of the Smart-Vercauteren scheme that will be freely available and gives substantial implementation hints.