PIR协议隐私的量化

R. Khan, Mohibullah, Muhammad Arshad Islam
{"title":"PIR协议隐私的量化","authors":"R. Khan, Mohibullah, Muhammad Arshad Islam","doi":"10.1109/C-CODE.2017.7918908","DOIUrl":null,"url":null,"abstract":"In current era the best way to find the information over the internet is search engine. Web search engines maintains user profile for better search results which could raise serious privacy issues. In order to intact the users privacy in front of a web search engines Private information retrieval (PIR) protocols are used which hide the identity of the user by submitting his/her query through other group member. A basic problem is related with these protocols are their predictability. This paper is the extension of previous work in which a person with anonymous query was successfully identified. This paper aims to find all queries submitted by the target user using UPIR and UUP protocols. For experimentation purpose a machine learning based adversarial model is proposed to find the actual queries of user of interest based on the previous profile. The results shows that the precision, recall and f-measure of J48 in finding user's real queries is more then 0.70 on the average. Similarly J48 reported highest trues positive rate of above 0.7 and lowest false positive rate of 0.006. It was also observed that the size of training data has very little effect on accuracy according to this experiment.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Quantification of PIR protocols privacy\",\"authors\":\"R. Khan, Mohibullah, Muhammad Arshad Islam\",\"doi\":\"10.1109/C-CODE.2017.7918908\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In current era the best way to find the information over the internet is search engine. Web search engines maintains user profile for better search results which could raise serious privacy issues. In order to intact the users privacy in front of a web search engines Private information retrieval (PIR) protocols are used which hide the identity of the user by submitting his/her query through other group member. A basic problem is related with these protocols are their predictability. This paper is the extension of previous work in which a person with anonymous query was successfully identified. This paper aims to find all queries submitted by the target user using UPIR and UUP protocols. For experimentation purpose a machine learning based adversarial model is proposed to find the actual queries of user of interest based on the previous profile. The results shows that the precision, recall and f-measure of J48 in finding user's real queries is more then 0.70 on the average. Similarly J48 reported highest trues positive rate of above 0.7 and lowest false positive rate of 0.006. It was also observed that the size of training data has very little effect on accuracy according to this experiment.\",\"PeriodicalId\":344222,\"journal\":{\"name\":\"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/C-CODE.2017.7918908\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/C-CODE.2017.7918908","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在当今时代,在互联网上找到信息的最好方式是搜索引擎。网络搜索引擎维护用户档案以获得更好的搜索结果,这可能会引发严重的隐私问题。为了在网络搜索引擎面前保护用户的隐私,使用了隐私信息检索(PIR)协议,该协议通过其他组成员提交用户的查询来隐藏用户的身份。与这些协议相关的一个基本问题是它们的可预测性。本文是对先前成功识别具有匿名查询的人的工作的扩展。本文旨在查找使用UPIR和UUP协议的目标用户提交的所有查询。为了实验目的,提出了一种基于机器学习的对抗模型,以基于先前的配置文件找到感兴趣的用户的实际查询。结果表明,J48搜索用户真实查询的准确率、查全率和f-measure平均值均在0.70以上。同样,J48的真阳性率最高为0.7以上,假阳性率最低为0.006。我们还观察到,根据本实验,训练数据的大小对准确率的影响很小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Quantification of PIR protocols privacy
In current era the best way to find the information over the internet is search engine. Web search engines maintains user profile for better search results which could raise serious privacy issues. In order to intact the users privacy in front of a web search engines Private information retrieval (PIR) protocols are used which hide the identity of the user by submitting his/her query through other group member. A basic problem is related with these protocols are their predictability. This paper is the extension of previous work in which a person with anonymous query was successfully identified. This paper aims to find all queries submitted by the target user using UPIR and UUP protocols. For experimentation purpose a machine learning based adversarial model is proposed to find the actual queries of user of interest based on the previous profile. The results shows that the precision, recall and f-measure of J48 in finding user's real queries is more then 0.70 on the average. Similarly J48 reported highest trues positive rate of above 0.7 and lowest false positive rate of 0.006. It was also observed that the size of training data has very little effect on accuracy according to this experiment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信