(Batch) fully homomorphic encryption over integers for non-binary message spaces

Koji Nuida, Kaoru Kurosawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

32 Citations (Scopus)

Abstract

In this paper, we construct a fully homomorphic encryption (FHE) scheme over integers with the message space ℤQfor any prime Q. Even for the binary case Q = 2, our decryption circuit has a smaller degree than that of the previous scheme; the multiplicative degree is reduced from O(λ(log λ)2) to O(λ), where λ is the security parameter. We also extend our FHE scheme to a batch FHE scheme.

Original languageEnglish
Title of host publicationAdvances in Cryptology – EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
EditorsMarc Fischlin, Elisabeth Oswald
PublisherSpringer Verlag
Pages537-555
Number of pages19
ISBN (Print)9783662467992
DOIs
Publication statusPublished - 2015
Externally publishedYes
Event34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Eurocrypt 2015 - Sofia, Bulgaria
Duration: Apr 26 2015Apr 30 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9056
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Eurocrypt 2015
CountryBulgaria
CitySofia
Period4/26/154/30/15

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of '(Batch) fully homomorphic encryption over integers for non-binary message spaces'. Together they form a unique fingerprint.

Cite this