Fully Homomorphic Encryption over the Integers with Shorter Public Keys

  title={Fully Homomorphic Encryption over the Integers with Shorter Public Keys},
  author={Jean-S{\'e}bastien Coron and Avradip Mandal and David Naccache and Mehdi Tibouchi},
  journal={IACR Cryptol. ePrint Arch.},
At Eurocrypt 2010 van Dijk et al. described a fully homomorphic encryption scheme over the integers. [] Key Method We prove that the scheme remains semantically secure, based on a stronger variant of the approximate-GCD problem, already considered by van Dijk et al. We alsodescribe the first implementation of the resulting fully homomorphic scheme. Borrowing some optimizations from the recent Gentry-Halevi implementation of Gentry's scheme, we obtain roughly the same level of efficiency. This shows that…

A New Somewhat Homomorphic Encryption Scheme over Integers

This paper reduces the public key size to Õ(λ<sup>3</sup>) by encrypting with a new form using Gentry's techniques, and can easily convert the somewhat scheme into a practical fully homomorphic encryption scheme available in cloud computing.

Improved Fully Homomorphic Encryption over the Integers with Shorter Public Keys

This paper proposes two schemes with shorter public keys by encrypting with a combination of the public key elements to replace a linear form in DGHV scheme and a quadratic form in Coron et al.

Scale-Invariant Fully Homomorphic Encryption over the Integers

At Crypto 2012, Brakerski constructed a scale-invariant fully homomorphic encryption scheme based on the LWE problem, in which the same modulus is used throughout the evaluation process, instead of a

Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers

A compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan's (DGHV) fully homomorphic scheme over the integers from O(λ7) to O( λ5) remains semantically secure, but in the random oracle model.

A new fully homomorphic encryption over the integers using smaller public key

This work proposes a new somewhat homomorphic encryption with practical time complexities that may be considered as a variant of the DGHV's integers-based scheme, which was one of the earlier attempts in devising a conceptually simpler fully homomorphicryption.

Cryptanalysis of a Homomorphic Encryption Scheme Over Integers

This paper presents a multi-ciphertexts attack on a variant of the DGHV scheme with much smaller public key (abbreviated as \(HE^{RK}\)), which was proposed by Govinda Ramaiah and Vijaya Kumari at CNC 2012.

An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers

A more efficient leveled FHE scheme over the integers without the modulus switching technique, which could resist chosen plaintext attacks and is much more efficient than that of Coron’s scheme.

Homomorphic encryption 2 1 Introduction

This document describes the construction under the assumption that the approximate GCD problem is hard and shows how to build somewhat homomorphic encryption (SHE) based on the learning with errors (LWE) problem, which can be used to evaluate a restricted class of algorithms over encrypted data.

Processing Encrypted Data Using Homomorphic Encryption

Fully Homomorphic Encryption (FHE) was initially introduced as a concept shortly after the development of the RSA cryptosystem, by Rivest et al. [54]. Although long sought after, the first functional

Symmetric Fully Homomorphic Encryption Using Decidable Matrix Equations

The paper gives the formal definitions of new framework for secure cloud computing -- the primitive of compact symmetric fully homomorphic encryption scheme whose security relies on the difficulty of some NP-complete problem.



Fully Homomorphic Encryption over the Integers

A fully homomorphic encryption scheme, using only elementary modular arithmetic, that reduces the security of the scheme to finding an approximate integer gcd, and investigates the hardness of this task, building on earlier work of Howgrave-Graham.

Implementing Gentry's Fully-Homomorphic Encryption Scheme

A working implementation of a variant of Gentry's fully homomorphic encryption scheme, similar to the variant used in an earlier implementation effort by Smart and Vercauteren (PKC 2010), with a number of optimizations that allow it to implement all aspects of the scheme, including the bootstrapping functionality.

Faster Fully Homomorphic Encryption

Two improvements to Gentry’s fully homomorphic scheme based on ideal lattices are described: a more aggressive analysis of one of the hardness assumptions and a probabilistic decryption algorithm that can be implemented with an algebraic circuit of low multiplicative degree.

Fully homomorphic encryption using ideal lattices

This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.

A fully homomorphic encryption scheme

This work designs a somewhat homomorphic "boostrappable" encryption scheme that works when the function f is the scheme's own decryption function, and shows how, through recursive self-embedding, bootstrappable encryption gives fully homomorphic encryption.

New Hash Functions and Their Use in Authentication and Set Equality

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

A new trapdoor mechanism is proposed and three encryption schemes are derived : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA, which are provably secure under appropriate assumptions in the standard model.

Public-Key Cryptosystems from Lattice Reduction Problems

A new proposal for a trapdoor one-way function, from which the security of the new construction is based on the conjectured computational difficulty of lattice-reduction problems, providing a possible alternative to existing public-key encryption algorithms and digital signatures such as RSA and DSS.

The Two Faces of Lattices in Cryptology

  • Phong Q. Nguyen
  • Mathematics, Computer Science
    Selected Areas in Cryptography
  • 2001
This talk will try to survey the main examples of the two faces of lattices in cryptology, and find out whether public-key cryptosystems based on the hardness of lattice problems, and lattices play a crucial role in a few security proofs.

A Binary Recursive Gcd Algorithm

This work presents a quasi-linear time recursive algorithm that computes the greatest common divisor of two integers by simulating a slightly modified version of the binary algorithm.