Private similarity searchable encryption for euclidean distance

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

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. [4]. 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.

Cite

CITATION STYLE

APA

Unagami, Y., Matsuzaki, N., Yamada, S., Attrapadung, N., Matsuda, T., & Hanaoka, G. (2017). Private similarity searchable encryption for euclidean distance. In IEICE Transactions on Information and Systems (Vol. E100D, pp. 2319–2326). Institute of Electronics, Information and Communication, Engineers, IEICE. https://doi.org/10.1587/transinf.2016INP0011

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free