Read/Search this Article
Abstract
本稿では, 部分一致検索可能暗号の実装方法を検討し,実装を行った結果を報告する.部分一致検索可能暗号は内積述語暗号から構成するため,内積述語暗号の実装評価からその評価が可能である.しかし,内積述語暗号ではベクトルの次元が演算時間に大きく影響を与えてしまい,演算時間の評価はケースごとになってしまう.そこで内積述語暗号の下位演算と演算回数から計算時間を見積もり,その結果と,実測値と比較を行った.これにより,曲線によっては演算回数からおおよその検索時間を見積もれることがわかった.
In this paper, we examine the Public-key Encryption with Partial Matching Keyword Search (PEPMKS), and report the result of its implementation. The PEPMKS can be constructed from Predicate Encryption (PE), thus the former can be evaluated by way of the implementation evaluation of the latter. However, as to the PE, the number of vector dimensions largely affects the operation time, and the evaluation of operation time must be performed on a case-by-case basis. Therefore, we estimated the calculation time from the sub-operation and the number of calculation of PE, and then compared the result with the actual measurement to confirm its precision. Thereby it was found that the calculation of PEPMKS or PE can be estimated with a high degree of accuracy from the number of calculation.
Journal
- IEICE technical report. Information and communication system security [List of Volumes]
-
IEICE technical report. Information and communication system security 110(115), 147-152, 2010-06-24 [Table of Contents]
The Institute of Electronics, Information and Communication Engineers
Share