Private Similarity Searchable Encryption for Euclidean Distance
2017
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.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
13
References
0
Citations
NaN
KQI