Private Information Retrieval and Its Extensions: An Introduction, Open Problems, Future Directions

Sajani Vithana, Zhusheng Wang, Sennur Ulukus
{"title":"Private Information Retrieval and Its Extensions: An Introduction, Open Problems, Future Directions","authors":"Sajani Vithana, Zhusheng Wang, Sennur Ulukus","doi":"10.1109/mbits.2023.3322972","DOIUrl":null,"url":null,"abstract":"Private information retrieval (PIR) is a privacysetting that allows a user to download a required message from a set of messages stored in a system of databases without revealing the index of the required message to the databases. PIR was introduced under computational privacy guarantees, and is recently re-formulated to provide information-theoretic guarantees, resulting in <italic xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">information theoretic privacy</i> . Subsequently, many important variants of the basic PIR problem have been studied focusing on fundamental performance limits as well as achievable schemes. More recently, a variety of conceptual extensions of PIR have been introduced, such as, private set intersection (PSI), private set union (PSU), and private read-update-write (PRUW). Some of these extensions are mainly intended to solve the privacy issues that arise in distributed learning applications due to the extensive dependency of machine learning on users' private data. In this article, we first provide an introduction to basic PIR with examples, followed by a brief description of its immediate variants. We then provide a detailed discussion on the conceptual extensions of PIR, along with potential research directions.","PeriodicalId":486961,"journal":{"name":"IEEE BITS the information theory magazine","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE BITS the information theory magazine","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/mbits.2023.3322972","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Private information retrieval (PIR) is a privacysetting that allows a user to download a required message from a set of messages stored in a system of databases without revealing the index of the required message to the databases. PIR was introduced under computational privacy guarantees, and is recently re-formulated to provide information-theoretic guarantees, resulting in information theoretic privacy . Subsequently, many important variants of the basic PIR problem have been studied focusing on fundamental performance limits as well as achievable schemes. More recently, a variety of conceptual extensions of PIR have been introduced, such as, private set intersection (PSI), private set union (PSU), and private read-update-write (PRUW). Some of these extensions are mainly intended to solve the privacy issues that arise in distributed learning applications due to the extensive dependency of machine learning on users' private data. In this article, we first provide an introduction to basic PIR with examples, followed by a brief description of its immediate variants. We then provide a detailed discussion on the conceptual extensions of PIR, along with potential research directions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
私人信息检索及其扩展:导论,开放问题,未来方向
私有信息检索(PIR)是一种隐私设置,它允许用户从存储在数据库系统中的一组消息中下载所需的消息,而无需向数据库显示所需消息的索引。PIR是在计算隐私保证下引入的,最近被重新表述为提供信息理论上的保证,从而产生了信息理论上的隐私。随后,对基本PIR问题的许多重要变体进行了研究,重点关注基本性能限制以及可实现的方案。最近,引入了PIR的各种概念性扩展,例如私有集合交集(PSI)、私有集合联合(PSU)和私有读-更新-写(PRUW)。其中一些扩展主要是为了解决分布式学习应用中由于机器学习对用户私有数据的广泛依赖而出现的隐私问题。在本文中,我们首先通过示例介绍基本的PIR,然后简要描述其直接变体。然后,我们对PIR的概念扩展以及潜在的研究方向进行了详细的讨论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Machine Learning: Enabling and Enabled by Advances in Storage and Memory Systems Error Correction for DNA Storage OTFS - Predictability in the Delay- Doppler Domain and Its Value to Communication and Radar Sensing Exploiting the Depth and Angular Domains for Massive Near-Field Spatial Multiplexing Timely and Massive Communication in 6G: Pragmatics, Learning, and Inference
×
引用
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