Erratum:Extension of Fully Homomorphic Encryption over Real Numbers for Polynomial Expression to the Computation of Rational Expression

Computations in science and engineering have been becoming tough. Such computations are often outsourced to subcontractors so that users could concentrate on their main tasks (making models, discussion and so on). However, they must reveal important data to subcontractors. As a result, the data might be leaked. In order to prevent this security threat, many researchers have studied secure computation. It enables users to outsource without revealing important data. Fully homomorphic encryption (FHE) is a key technology to realize secure computation. This paper proposes a new extension of the IH method in FHE. The IH method is a method which enables users to encrypt data which is used for computing polynomial expressions by using a special matrix. While the usefulness of the IH method, its application is limited to polynomial expression: the case that the target computation is given as a polynomial expression. Now, this paper first proposes its extension to the case of rational expression. We find a newly revised matrix to be used in decryption even if the computation includes the operation of division and apply it to overcome the problem.

Authors

Institutions

Publication Details

Journal
IEEJ Transactions on Electronics Information and Systems
Published
2025-08-31
DOI
https://doi.org/10.1541/ieejeiss.145.837
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Erratum:Extension of Fully Homomorphic Encryption over Real Numbers for Polynomial Expression to the Computation of Rational Expression

Masahiro Hayashi, Yasuyuki Suda
1 links
IEEJ Transactions on Electronics Information and Systems
Computability, Logic, AI Algorithms
article

Erratum:Extension of Fully Homomorphic Encryption over Real Numbers for Polynomial Expression to the Computation of Rational Expression

Masahiro Hayashi, Yasuyuki Suda
article en

Abstract

Computations in science and engineering have been becoming tough. Such computations are often outsourced to subcontractors so that users could concentrate on their main tasks (making models, discussion and so on). However, they must reveal important data to subcontractors. As a result, the data might be leaked. In order to prevent this security threat, many researchers have studied secure computation. It enables users to outsource without revealing important data. Fully homomorphic encryption (FHE) is a key technology to realize secure computation. This paper proposes a new extension of the IH method in FHE. The IH method is a method which enables users to encrypt data which is used for computing polynomial expressions by using a special matrix. While the usefulness of the IH method, its application is limited to polynomial expression: the case that the target computation is given as a polynomial expression. Now, this paper first proposes its extension to the case of rational expression. We find a newly revised matrix to be used in decryption even if the computation includes the operation of division and apply it to overcome the problem.

IEEJ Transactions on Electronics Information and SystemsVol. 145(9)
Tokyo City University (JP)
Openalex Percentile: Top 76%
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.