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

被引：0

作者：

Vithana, Sajani ^{[1
]}

Wang, Zhusheng ^{[1
]}

Ulukus, Sennur ^{[1
]}

机构：

[1] University of Maryland, Department of Electrical, Computer Engineering, College Park,MD,20742, United States

来源：

IEEE BITS the Information Theory Magazine | 2023年 / 3卷 / 04期

关键词：

Distributed learning - Fundamental performance limits - Index - Information retrieval problems - Privacy - Privacy issue - Private information retrieval - Set intersection - Symbol - Update write;

D O I：

10.1109/MBITS.2023.3322972

中图分类号：

学科分类号：

摘要：

Private information retrieval (PIR) is a privacy setting 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 reformulated 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, private set union, and private read-update-write. Some of these extensions are mainly intended to solve the privacy issues that arise in distributed learning applications due to the extensive dependence 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. © 2021 IEEE.

引用

页码：67 / 85