Filters








11,208 Hits in 10.2 sec

On single server private information retrieval in a coding theory perspective [article]

Gianira N. Alfarano, Karan Khathuria, Violetta Weger
2020 arXiv   pre-print
In this paper, we present a new perspective of single server private information retrieval (PIR) schemes by using the notion of linear error-correcting codes.  ...  Many of the known single server schemes are based on taking linear combinations between database elements and the query elements.  ...  Single server private information retrieval A single server PIR is a scheme involving two parties, the user and the server.  ... 
arXiv:2008.06417v1 fatcat:phhoblhppjglbok7x2k6d5pthq

A survey on single server private information retrieval in a coding theory perspective

Gianira N. Alfarano, Karan Khathuria, Violetta Weger
2021 Applicable Algebra in Engineering, Communication and Computing  
AbstractIn this paper, we present a new perspective of single server private information retrieval (PIR) schemes by using the notion of linear error-correcting codes.  ...  Many of the known single server schemes are based on taking linear combinations between database elements and the query elements.  ...  Single server private information retrieval A single server PIR is a scheme involving two parties, the user and the server.  ... 
doi:10.1007/s00200-021-00508-5 fatcat:gzyo4s5bwje35lumrklubh6ijq

Privacy in Retrieval, Computing, and Learning

Sennur Ulukus, Salman Avestimehr, Michael Gastpar, Syed Jafar, Ravi Tandon, Chao Tian
2022 IEEE Journal on Selected Areas in Communications  
This Special Issue is dedicated to communication theory, coding theory, information theory, signal processing, and networking aspects of privacy in information retrieval, privacy in coded computing over  ...  distributed servers, and privacy in distributed learning.  ...  In [A12] , Allaix et al. establish more general results for the problem of private information retrieval in quantum models. Achievable schemes are developed based on linear and MDS codes.  ... 
doi:10.1109/jsac.2022.3142570 fatcat:gcb24zb7yfarfemlnk7gp6mnma

2021 Index IEEE Journal on Selected Areas in Information Theory Vol. 2

2021 IEEE Journal on Selected Areas in Information Theory  
-that appeared in this periodical during 2021, and items from previous years that were commented upon or corrected in 2021.  ...  Note that the item title is found only under the primary entry in the Author Index.  ...  ., +, JSAIT March 2021 391-402 Y The Capacity of Single-Server Weakly-Private Information Retrieval.  ... 
doi:10.1109/jsait.2021.3139677 fatcat:7c3y7ascsfewfpnvmdyq624w7q

Single-Server Multi-Message Private Information Retrieval with Side Information [article]

Su Li, Michael Gastpar
2018 arXiv   pre-print
We study the problem of single-server multi-message private information retrieval with side information. One user wants to recover N out of K independent messages which are stored at a single server.  ...  This means if one wishes to privately download more than the square-root of the number of files in the database, then one must effectively download the full database (minus the side information), irrespective  ...  A. Related Work The Private Information Retrieval (PIR) problem was first studied in [1] from a computational complexity perspective.  ... 
arXiv:1808.05797v1 fatcat:u5zprpoayrgqpbxppznigliktm

Notes on Communication and Computation in Secure Distributed Matrix Multiplication [article]

Rafael G. L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein, David Karpuk
2020 arXiv   pre-print
We also show that if the user is only concerned in optimizing the download rate, a common assumption in the literature, then the problem can be converted into a simple private information retrieval problem  ...  We answer this question in the affirmative by showing that by adjusting the parameters in a polynomial code we can obtain a trade-off between the user's and the servers' computational time.  ...  If one uses the download rate as the sole performance metric for the setting in [1] , these private information retrieval codes can outperform the polynomial codes in [1]- [7] .  ... 
arXiv:2001.05568v2 fatcat:ryyi2jujt5hxjfpy4tqvsmgzy4

The Capacity of Single-Server Weakly-Private Information Retrieval [article]

Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi
2021 arXiv   pre-print
In this work, we present weakly-private information retrieval (WPIR) schemes that trade off perfect privacy to improve the download cost when the database is stored on a single server.  ...  A private information retrieval (PIR) protocol guarantees that a user can privately retrieve files stored in a database without revealing any information about the identity of the requested file.  ...  In this context, private information retrieval (PIR), introduced by Chor et al. in [1] , has gained traction in the information theory community.  ... 
arXiv:2001.08727v3 fatcat:4c5k7elly5hgpkrl7dhytmkzay

Private Information Retrieval from MDS Coded Databases with Colluding Servers under Several Variant Models [article]

Yiwei Zhang, Gennian Ge
2017 arXiv   pre-print
Private information retrieval (PIR) gets renewed attentions due to its information-theoretic reformulation and its application in distributed storage system (DSS).  ...  A key problem is to analyze the PIR capacity, defined as the maximal number of bits privately retrieved per one downloaded bit.  ...  INTRODUCTION The concept of private information retrieval is first introduced by Chor et al. [9] , [10] .  ... 
arXiv:1705.03186v2 fatcat:ntkcqf2nd5d37ipef4rku65tze

On the Capacity of Single-Server Multi-Message Private Information Retrieval with Side Information [article]

Anoosheh Heidarzadeh, Brenden Garcia, Swanand Kadhe, Salim El Rouayheb, Alex Sprintson
2018 arXiv   pre-print
We study Private Information Retrieval with Side Information (PIR-SI) in the single-server multi-message setting.  ...  In this setting, a user wants to download D messages from a database of K≥ D messages, stored on a single server, without revealing any information about the identities of the demanded messages to the  ...  INTRODUCTION In the Private Information Retrieval (PIR) problem, a user wants to privately download a message belonging to a database with copies stored on a single or multiple remote servers [1] .  ... 
arXiv:1807.09908v1 fatcat:bwaze62kpnas7euov3fg3hkmne

Multi-User Blind Symmetric Private Information Retrieval from Coded Servers [article]

Jinbao Zhu, Qifa Yan, Xiaohu Tang
2021 arXiv   pre-print
The problem of Multi-user Blind X-secure T-colluding Symmetric Private Information Retrieval from Maximum Distance Separable (MDS) coded storage system with B Byzantine and U unresponsive servers (U-B-MDS-MB-XTSPIR  ...  In addition, each user must not learn information about the other users' indices and the database more than the desired file. An U-B-MDS-MB-XTSPIR scheme is constructed based on Lagrange encoding.  ...  In the classical PIR setting, a user wishes to retrieve one out of F files from N non-colluding servers, each of which stores all the F files, while preventing any individual server from obtaining information  ... 
arXiv:2111.00467v1 fatcat:yxrieukuj5ga7gbmvt7lcezwte

Weakly-Private Information Retrieval

Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi
2019 2019 IEEE International Symposium on Information Theory (ISIT)  
For the particular case of replicated servers, we propose two weakly-private information retrieval schemes based on two recent PIR protocols and a family of schemes based on partitioning.  ...  Private information retrieval (PIR) protocols make it possible to retrieve a file from a database without disclosing any information about the identity of the file being retrieved.  ...  INTRODUCTION In 1995 Chor et al. introduced the notion of private information retrieval (PIR) [1] .  ... 
doi:10.1109/isit.2019.8849444 dblp:conf/isit/LinKRAY19 fatcat:ps7coe3cn5fltda4yds7q3kzla

Private Information Retrieval Over Gaussian MAC [article]

Ori Shmuel, Asaf Cohen
2020 arXiv   pre-print
Consider the problem of Private Information Retrieval (PIR), where a user wishes to retrieve a single message from N non-communicating and non-colluding databases (servers).  ...  Nevertheless, we provide coding scheme and lower bounds on the expected achievable retrieval rate which are shown to have the same scaling laws as the channel capacity, both in the number of servers and  ...  Parts of this work will appear at the 2020 IEEE International Symposium on Information Theory (ISIT). The authors are from Ben-Gurion University of the Negev, Israel.  ... 
arXiv:2001.03753v4 fatcat:2iicafukeffodepktmugf5q3qm

One-Way Private Media Search on Public Databases: The Role of Signal Processing

Giulia Fanti, Matthieu Finiasz, Kannan Ramchandran
2013 IEEE Signal Processing Magazine  
His research interests are the design of efficient code-based cryptosystems, applications of coding theory to symmetric and asymmetric cryptography, and, more generally, most topics related to cryptography  ...  After five years as a research scientist at ENSTA (Paris, France) he joined the CryptoExperts company in 2012.  ...  used to privately retrieve items from a database: one taken from [5] that uses multiple servers to achieve information-theoretic security, and one based on [19] that uses a single server to provide  ... 
doi:10.1109/msp.2012.2229783 fatcat:j36vu5f2yfhwvjkqcvoro72j6q

Private Information Retrieval from Transversal Designs

2018 IEEE Transactions on Information Theory  
Private information retrieval (PIR) protocols allow a user to retrieve entries of a database without revealing the index of the desired item.  ...  On another side, Fazeli et. al. introduced so-called PIR codes in order to reduce the storage overhead on the servers.  ...  Private Information Retrieval A private information retrieval (PIR) protocol aims at ensuring a user that he can retrieve some part D i of a remote database D without revealing the index i to the server  ... 
doi:10.1109/tit.2018.2861747 fatcat:bj6ligygfbarziw2icgcvfsrpq

Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost [article]

Chao Tian, Hua Sun, Jun Chen
2019 arXiv   pre-print
We propose a new capacity-achieving code for the private information retrieval (PIR) problem, and show that it has the minimum message size (being one less than the number of servers) and the minimum upload  ...  The symmetry structure of the PIR problem is then analyzed, which allows us to construct symmetric codes from asymmetric ones, yielding a meaningful bridge between the proposed code and existing ones in  ...  An N -server private information retrieval (PIR) code for K messages, each of L-symbols in the alphabet X , consists of 1.  ... 
arXiv:1808.07536v2 fatcat:syfghkruznbytoetolos4ia4za
« Previous Showing results 1 — 15 out of 11,208 results