Paper 2017/198 Original: eprint.iacr.org/2017/198 ↗
FHE with Recursive Ciphertext
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
- Preprint.
- History
- 2017-02-28: last updated
- 2017-02-28: published
- Short URL
- https://ia.cr/2017/198
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2017/198,
author = {Masahiro Yagisawa},
title = {FHE with Recursive Ciphertext},
howpublished = {Cryptology {ePrint} Archive, Paper 2017/198},
year = {2017},
url = {https://eprint.iacr.org/2017/198}
}