Paper 2016/054 Original: eprint.iacr.org/2016/054 ↗
Fully Homomorphic Public-Key Encryption with Two Ciphertexts based on Discrete Logarithm Problem
Abstract
In previous paper I proposed the fully homomorphic public-key encryption based on discrete logarithm problem which may be vulnerable to “m and -m attack”. In this paper I propose improved fully homomorphic public-key encryption (FHPKE) with composite number modulus based on the discrete logarithm assumption (DLA) and computational Diffie–Hellman assumption (CDH) of multivariate polynomials on octonion ring which is immune from “m and -m attack”. The scheme has two ciphertexts corresponding to one plaintext.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2016-11-30: last updated
- 2016-01-25: published
- Short URL
- https://ia.cr/2016/054
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2016/054,
author = {Masahiro Yagisawa},
title = {Fully Homomorphic Public-Key Encryption with Two Ciphertexts based on Discrete Logarithm Problem},
howpublished = {Cryptology {ePrint} Archive, Paper 2016/054},
year = {2016},
url = {https://eprint.iacr.org/2016/054}
}