On query self-submission in peer-to-peer user-private information retrieval

K. Stokes, M. Bras-Amorós
{"title":"On query self-submission in peer-to-peer user-private information retrieval","authors":"K. Stokes, M. Bras-Amorós","doi":"10.1145/1971690.1971697","DOIUrl":null,"url":null,"abstract":"User-private information retrieval (UPIR) is the art of retrieving information without telling the information holder who you are. UPIR is sometimes called anonymous keyword search. This article discusses a UPIR protocol in which the users form a peer-to-peer network over which they collaborate in protecting the privacy of each other. The protocol is known as P2P UPIR. It will be explained why the P2P UPIR protocol may have a flaw in the protection of the privacy of the client in front of the server. Two alternative variations of the protocols are discussed. One of these will prove to resolve the privacy flaw discovered in the original protocol. Hence the aim of this article is to propose a modification of the P2P UPIR protocol. It is justified why the projective planes are still the optimal configurations for P2P UPIR for the modified protocol.","PeriodicalId":245552,"journal":{"name":"International Conference on Pattern Analysis and Intelligent Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Pattern Analysis and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1971690.1971697","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

User-private information retrieval (UPIR) is the art of retrieving information without telling the information holder who you are. UPIR is sometimes called anonymous keyword search. This article discusses a UPIR protocol in which the users form a peer-to-peer network over which they collaborate in protecting the privacy of each other. The protocol is known as P2P UPIR. It will be explained why the P2P UPIR protocol may have a flaw in the protection of the privacy of the client in front of the server. Two alternative variations of the protocols are discussed. One of these will prove to resolve the privacy flaw discovered in the original protocol. Hence the aim of this article is to propose a modification of the P2P UPIR protocol. It is justified why the projective planes are still the optimal configurations for P2P UPIR for the modified protocol.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
点对点用户-私有信息检索中的查询自提交
用户私有信息检索(UPIR)是在不告诉信息持有者您是谁的情况下检索信息的艺术。UPIR有时被称为匿名关键字搜索。本文讨论了一个UPIR协议,在该协议中,用户组成了一个对等网络,在这个网络上,他们协作保护彼此的隐私。该协议被称为P2P UPIR。我们将解释为什么P2P UPIR协议在保护服务器前面的客户端的隐私方面可能存在缺陷。讨论了协议的两种可选变体。其中一个将被证明可以解决原始协议中发现的隐私缺陷。因此,本文的目的是提出对P2P UPIR协议的修改。对于修改后的协议,为什么投影平面仍然是P2P UPIR的最佳配置是合理的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Privacy issues with sharing reputation across virtual communities PCTA: privacy-constrained clustering-based transaction data anonymization Rational enforcement of digital oblivion Improving security by using a database management system for integrated statistical data analysis A probabilistic look ahead of anonymization: keynote talk
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1