多項式秘密計算に対するセキュリティ強度分析とその改善

カテゴリ: 論文誌(論文単位)

グループ名: 【C】電子・情報・システム部門

発行日: 2022/04/01

タイトル(英語): Analysis and Improvement of the Security Strength of a Secure Computation for Polynomial

著者名: 中代　直歩（東京都市大学大学院 総合理工学研究科 情報専攻），林　正博（東京都市大学大学院 総合理工学研究科 情報専攻）

著者名(英語): Naho Nakadai (Major of Information Engineering of Graduate School, Tokyo City University), Masahiro Hayashi (Major of Information Engineering of Graduate School, Tokyo City University)

キーワード: 秘密計算，完全準同型暗号，信頼性工学，サイバーセキュリティ，セキュリティ強度　　secure computation，fully homomorphic encryption，reliability engineering，cyber security，security strength

要約(英語): This paper analyzes security strength of Iseki & Hayashi's secure computation which is valid for computation of polynomial as for real numbers, and proposes a new method to improve its security strength. First we derive the fact that Iseki & Hayashi's secure computation is deciphered if the value of single input variables of the computation is known. This implies that the security strength of Iseki & Hayashi's secure computation is bounded by the length of bits which can be inputted to this single variable. To improve this bound to be more secured, we propose a technique to repeat steps of Iseki & Hayashi's secure computation until its security strength becomes sufficiently powerful. A simple relationship about security strength between Iseki & Hayashi's secure computation and our proposal is found, and it shows security strength becomes quickly powerful with the increase of number of repetitions. Finally, numerical examples are demonstrated to show the effectiveness of our proposal.

本誌: 電気学会論文誌C（電子・情報・システム部門誌） Vol.142 No.4 （2022） 特集：持続可能な社会発展に貢献するスマートレーザプロセシング

本誌掲載ページ: 478-490 p

原稿種別: 論文／日本語

電子版へのリンク: https://www.jstage.jst.go.jp/article/ieejeiss/142/4/142_478/_article/-char/ja/