For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Private Similarity Searchable Encryption for Euclidean Distance
Yuji UNAGAMI Natsume MATSUZAKI Shota YAMADA Nuttapong ATTRAPADUNG Takahiro MATSUDA Goichiro HANAOKA
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2017/10/01
Online ISSN: 1745-1361
Type of Manuscript: Special Section PAPER (Special Section on Security, Privacy and Anonymity in Computation, Communication and Storage Systems)
Category: Operating system and network Security
searchable encryption, inner product encryption, the weighted Euclidean distance,
Full Text: PDF(473.7KB)
>>Buy this Article
In this paper, we propose a similarity searchable encryption in the symmetric key setting for the weighted Euclidean distance, by extending the functional encryption scheme for inner product proposed by Bishop et al. . Our scheme performs predetermined encoding independently of vectors x and y, and it obtains the weighted Euclidean distance between the two vectors while they remain encrypted.