Title
Private Similarity Searchable Encryption For Euclidean Distance
Abstract
In this paper, we propose a similarity searchable encryption in the symmetric key setting for Euclidean distance, by extending the functional encryption scheme for inner product proposed by Bishop et al. [2]. Our scheme performs predetermined encoding independently of vectors x and y, and it obtains the Euclidean distance between the two vectors while they remain encrypted.
Year
DOI
Venue
2017
10.1587/transinf.2016INP0011
PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016)
Keywords
DocType
Volume
searchable encryption, inner product encryption, the weighted Euclidean distance
Journal
100-D
Issue
ISSN
Citations 
10
1745-1361
0
PageRank 
References 
Authors
0.34
7
6
Name
Order
Citations
PageRank
Yuji Unagami100.34
Natsume Matsuzaki200.34
Shota Yamada39418.10
Nuttapong Attrapadung481139.85
Takahiro Matsuda534342.05
Goichiro Hanaoka6910101.53