FHE with Recursive Ciphertext

Masahiro Yagisawa

Paper 2017/198

FHE with Recursive Ciphertext

Masahiro Yagisawa

Abstract

In this paper I propose fully homomorphic public-key encryption (FHPKE) with the recursive ciphertex. A ciphertext consists of three sub-ciphertexts corresponding to one plaintext. When we execute the additional operation or multiplicative operation, a new three sub-ciphertexts are generated from the three sub-ciphertexts recursively without revealing the plaintexts. The scheme is based on the discrete logarithm assumption (DLA) and computational Diffie–Hellman assumption (CDH) of multivariate polynomials on octonion ring with composite number modulus. The scheme is immune from “m and - m attack”.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Minor revision. Masahiro, Y. (2017). Fully Homomorphic Public-Key Encryption with Three Ciphertexts which was published by LAP LAMBERT Academic Publishing, Saarbrücken/Germany .
Keywords: fully homomorphic public-key encryption discrete logarithm assumption computational Diffie–Hellman assumption octonion ring factorization
Contact author(s): tfkt8398yagi @ outlook jp
History: 2017-02-28: received
Short URL: https://ia.cr/2017/198
License: CC BY

BibTeX

@misc{cryptoeprint:2017/198,
      author = {Masahiro Yagisawa},
      title = {FHE with Recursive Ciphertext},
      howpublished = {Cryptology ePrint Archive, Paper 2017/198},
      year = {2017},
      note = {\url{https://eprint.iacr.org/2017/198}},
      url = {https://eprint.iacr.org/2017/198}
}