• Corpus ID: 168259

Fully Homomorphic Encryption without bootstrapping

@article{Yagisawa2015FullyHE,
  title={Fully Homomorphic Encryption without bootstrapping},
  author={Masahiro Yagisawa},
  journal={IACR Cryptol. ePrint Arch.},
  year={2015},
  volume={2015},
  pages={474}
}
  • M. Yagisawa
  • Published 16 March 2015
  • Computer Science, Mathematics
  • IACR Cryptol. ePrint Arch.
Fully homomorphic encryption(FHE) is the cryptosystem which supports both addition and multiplication. The existence of the cryptosystems which have efficiency and fully homomorphism would bring great practical implications in the outsourcing of private computations, for instance, in the context of cloud computing. But FHE scheme which runs fast for practical use is not proposed until now because the scheme requires huge complexity. This book, therefore, provides the new fully homomorphic… 

Fully Homomorphic Encryption on Octonion Ring

  • M. Yagisawa
  • Mathematics, Computer Science
    IACR Cryptol. ePrint Arch.
  • 2015
TLDR
The improved fully homomorphic encryption scheme on non-associative octonion ring over finite field without bootstrapping technique is proposed, based on multivariate algebraic equations with high degree or too many variables while the almost all multivariate cryptosystems proposed until now are based on the quadratic equations avoiding the explosion of the coefficients.

Homomorphic encryption 2 1 Introduction

TLDR
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.

Improved fully homomorphic public-key encryption with small ciphertext size

  • M. Yagisawa
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2018
TLDR
This paper proposes the fully homomorphic public-key encryption scheme with the size of ciphertext which is not small enough, and adopts the medium text with zero norm, and is immune from the Gröbner basis attack, the differential attack, rank attack and so on.

Fully Homomorphic Public-Key Encryption Against Ciphertext Square Attack with Two Ciphertexts

TLDR
A new FHPKE against "ciphertext square attack" is proposed which does not need the bootstrapping and does not require the large complexity for enciphering and it is shown that proposed system is immune from “cipher Text square attack’, “m and -m attack” and the Grobner basis attacks.

Fully Homomorphic Encryption: A Case Study

TLDR
This thesis is survey on FHE and MKFHE, with special attention to the state of the art implementations available as well as three implementations including the first implementation in the multi-key settings to the best of the authors' knowledge.

Improved Fully Homomorphic Encryption without Bootstrapping

  • M. Yagisawa
  • Mathematics, Computer Science
    IACR Cryptol. ePrint Arch.
  • 2017
TLDR
The improved fully homomorphic public-key encryption scheme on non-associative octonion ring over finite field without bootstrapping technique is proposed, which is against the Gröbner basis attack, the differential attack, rank attack and so on.

Fully Homomorphic Encryption with Composite Number Modulus

  • M. Yagisawa
  • Mathematics, Computer Science
    IACR Cryptol. ePrint Arch.
  • 2015
TLDR
This paper proposes the improved fully homomorphic encryption scheme on non-associative octonion ring over finite ring with composite number modulus where the plaintext p consists of three numbers u,v,w and it is proved that if there exists the PPT algorithm that decrypts the plain Text from the ciphertexts of the proposed scheme, there exist the P PT algorithm that factors the given composite numbermodulus.

Improved Fully Homomorphic Encryption with Composite Number Modulus

  • M. Yagisawa
  • Mathematics, Computer Science
    IACR Cryptol. ePrint Arch.
  • 2016
TLDR
Another fully homomorphic encryption with composite number modulus where the complexity required for enciphering and deciphering is smaller than the same modulus RSA scheme and is immune from the “p and -p attack”.

Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption

TLDR
It is proved that the problem of minimizing bootstrapping is NP-complete with a reduction from a graph problem and a flexible technique is proposed that permits to determine both such minimal number of bootstrappings and where to place them in the circuit.

On FHE Without Bootstrapping ( Informal )

TLDR
This work proposes an IND-CPA secure symmetric key homomorphic encryption scheme using multivariate polynomial ring over finite fields and gives a method of constructing a CPA secure homomorphicryption scheme from another symmetric deterministic CPASecure scheme.
...

References

SHOWING 1-10 OF 16 REFERENCES

Fully Homomorphic Encryption over the Integers with Shorter Public Keys

TLDR
It is shown that fully homomorphic encryption can be implemented using simple arithmetic operations, and some optimizations from the recent Gentry-Halevi implementation of Gentry's scheme are obtained, roughly the same level of efficiency.

Fully homomorphic encryption using ideal lattices

TLDR
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

TLDR
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.

Notes on Two Fully Homomorphic Encryption Schemes Without Bootstrapping

  • Yongge Wang
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2015
TLDR
It is shown that the encryption schemes of Liu and Wang in CCS 2012 and the encryption scheme of Liu, Bertino, and Xun in ASIACCS 2014 are insecure either.

(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces

TLDR
This paper constructs a fully homomorphic encryption (FHE) scheme over integers with the message space \(\mathbb {Z}_Q\) for any prime \(Q\), and extends the scheme to a batch FHE scheme.

Public Quadratic Polynominal-Tuples for Efficient Signature-Verification and Message-Encryption

TLDR
It is shown that for C* it is practically infeasible to extract the n-tuple of n-variate polynomials representing the inverse of the corresponding public key.

Taxonomy of Public Key Schemes based on the problem of Multivariate Quadratic equations

TLDR
The necessary mathematical tools to deal with multivariate quadratic systems are introduced, an overview of important schemes known so far are presented and how they are grouped into a taxonomy of only four basic schemes and some generic modiflers are outlined.

On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations

We extend the notion of regular sequence ([Mac16]) to overdetermined system of algebraic equations. We study generic properties of Grobner bases and analyse precisely the behavior of the F5 [Fau02]

Fully Homomorphic Encryption without bootstrapping. Saarbrüken/Germany: LAP LAMBERT Academic Publishing

  • 2015