欧几里得距离的私有相似度可搜索加密

2016 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2016-10-01 DOI:10.1587/TRANSINF.2016INP0011

Yuji Unagami, Natsume Matsuzaki, Shota Yamada, Nuttapong Attrapadung, Takahiro Matsuda, Goichiro Hanaoka

{"title":"欧几里得距离的私有相似度可搜索加密","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":"{\"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}","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

摘要

本文通过扩展Bishop等人提出的内积功能加密方案，提出了一种欧式距离对称密钥设置下的相似度可搜索加密方案。我们的方案独立于向量x和y执行预先确定的编码，并在两个向量保持加密的情况下获得它们之间的欧氏距离。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Private similarity searchable encryption for Euclidean distance

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 International Symposium on Information Theory and Its Applications (ISITA)

自引率

0.00%

发文量