{"title":"Private similarity searchable encryption for Euclidean distance","authors":"Yuji Unagami, Natsume Matsuzaki, Shota Yamada, Nuttapong Attrapadung, Takahiro Matsuda, Goichiro Hanaoka","doi":"10.1587/TRANSINF.2016INP0011","DOIUrl":null,"url":null,"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.","PeriodicalId":278189,"journal":{"name":"2016 International Symposium on Information Theory and Its Applications (ISITA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Symposium on Information Theory and Its Applications (ISITA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1587/TRANSINF.2016INP0011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
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.