[Resource Topic] 2016/054: Fully Homomorphic Public-Key Encryption with Two Ciphertexts based on Discrete Logarithm Problem

Resource No category
#1

Welcome to the resource topic for 2016/054

Title:
Fully Homomorphic Public-Key Encryption with Two Ciphertexts based on Discrete Logarithm Problem

Authors: Masahiro Yagisawa

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.

ePrint: https://eprint.iacr.org/2016/054

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .