Filters








36 Hits in 3.8 sec

Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers [article]

Razane Tajeddine, Oliver W. Gnilke, David Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti
2018 arXiv   pre-print
The problem of Private Information Retrieval (PIR) from coded storage systems with colluding, byzantine, and unresponsive servers is considered.  ...  An explicit scheme using an [n,k] Reed-Solomon storage code is designed, protecting against t-collusion and handling up to b byzantine and r unresponsive servers, when n>k+t+2b+r-1.  ...  Conjecture 1 . 1 The asymptotic capacity (as M → ∞) of Private Information Retrieval for an [n, k] MDS storage code with t-collusion, b byzantine servers, and r unresponsive servers is n−the current scheme  ... 
arXiv:1806.08006v3 fatcat:7ppunmvm4zhlvep4jknk43ogby

Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers

Razane Tajeddine, Oliver W. Gnilke, David Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti
2019 IEEE Transactions on Information Theory  
Abstract-The problem of Private Information Retrieval (PIR) from coded storage systems with colluding, Byzantine, and unresponsive servers is considered.  ...  An explicit scheme using an [n, k] Reed-Solomon storage code is designed, protecting against t-collusion and handling up to b Byzantine and r unresponsive servers, when n > k + t + 2b + r − 1.  ...  ACKNOWLEDGMENTS This work is supported in part by the Academy of Finland, under grants #276031, #282938, and #303819 to C. Hollanti, and by the Technical University of Munich -Institute for O. W.  ... 
doi:10.1109/tit.2018.2890285 fatcat:cqe5fuqc3fafzaimmudfrgge2q

Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers [article]

Razane Tajeddine, Oliver W. Gnilke, David Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti
2018 arXiv   pre-print
A private information retrieval (PIR) scheme on coded storage systems with colluding, byzantine, and non-responsive servers is presented.  ...  An explicit scheme using an [n,k] generalized Reed-Solomon storage code is designed, protecting against t-collusion and handling up to b byzantine and r non-responsive servers, when n≥ n'= (ν +1) k+t+2b  ...  INTRODUCTION Private information retrieval (PIR) is concerned with designing schemes for a user to retrieve a certain file from a storage system without revealing the identity of the file to the servers  ... 
arXiv:1802.03731v2 fatcat:t73hr2aw4bhvxb4smp5f7t5pcy

Star Product PIR Schemes with Colluding Servers over Small Fields [article]

Hao Chen
2022 arXiv   pre-print
For MDS coded distributed storage system private information retrieval was proposed and the capacity of PIR schemes for MDS coded distributed storage was studied.  ...  Star product PIR schemes from general coded distributed storage system with colluding servers were constructed over general finite fields.  ...  Colluding servers, Byzantine servers and unresponsive servers A Byzantine server in distributed storage system is a server may respond wrong response (error) and an unresponsive server is a server may  ... 
arXiv:2207.03163v2 fatcat:cedtic2vuzabpjxtt7jzw3gi5m

Private information retrieval schemes for coded data with arbitrary collusion patterns

Razane Tajeddine, Oliver W. Gnilke, David Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti, Salim El Rouayheb
2017 2017 IEEE International Symposium on Information Theory (ISIT)  
Gnilke, David Karpuk, Ragnar Freij-Hollanti, and Camilla Hollanti. Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers.  ...  The authors later quantified the capacity of linear SPIR schemes on MDS coded data with colluding servers in [42] , and the capacity of SPIR schemes on replicated data with colluding, byzantine, and unresponsive  ...  (1) known from previous rounds retrieved in current round . . . . . . (1) and h ν, (2) , which are retrieved in rounds 1 and 2, respectively.  ... 
doi:10.1109/isit.2017.8006861 dblp:conf/isit/TajeddineGKFHR17 fatcat:tkodpg7tzbfnpjseukrawvqhsa

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  ...  ,θ_M) from the storage system, while keeping its index θ_m private from any T_m colluding servers, where there exists B Byzantine servers that can send arbitrary responses maliciously to confuse the users  ...  Throughout this paper, we refer to the above operations as a Multi-user Blind X-secure T -colluding Symmetric PIR scheme from MDS coded storage system with B Byzantine and U unresponsive servers (or U-B-MDS-MB-XTSPIR  ... 
arXiv:2111.00467v1 fatcat:yxrieukuj5ga7gbmvt7lcezwte

Symmetric Private Polynomial Computation From Lagrange Encoding [article]

Jinbao Zhu, Qifa Yan, Xiaohu Tang, Songze Li
2021 arXiv   pre-print
The problem of X-secure T-colluding symmetric Private Polynomial Computation (PPC) from coded storage system with B Byzantine and U unresponsive servers is studied in this paper.  ...  A user wishes to privately evaluate one out of a set of candidate polynomial functions over the M files from the system, while guaranteeing that any T colluding servers can not learn anything about the  ...  Formally, an X-secure T -colluding Symmetric PPC scheme from MDS coded storage system with B Byzantine and U unresponsive servers, also referred to as U-B-MDS-XTSPPC scheme, is composed of the queries,  ... 
arXiv:2010.09326v3 fatcat:xswuodogmfefhpzmxts37wrf7m

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  ...  T HE increasing prevalence of massive datasets makes the outsourcing of storage and computation tasks to distributed servers a necessity.  ...  In [A7], Zhu et al. explore how multiple users may jointly, privately, and efficiently retrieve a file from a secure distributed database when the storage is coded and the set of servers includes unresponsive  ... 
doi:10.1109/jsac.2022.3142570 fatcat:gcb24zb7yfarfemlnk7gp6mnma

Robust Private Information Retrieval on Coded Data [article]

Razane Tajeddine, Salim El Rouayheb
2017 arXiv   pre-print
We consider the problem of designing PIR scheme on coded data when certain nodes are unresponsive. We provide the construction of ν-robust PIR schemes that can tolerate up to ν unresponsive nodes.  ...  These schemes are adaptive and universally optimal in the sense of achieving (asymptotically) optimal download cost for any number of unresponsive nodes up to ν.  ...  SYSTEM MODEL AND MAIN RESULT We adopt the same model in [11] and summarize it here. DSS: We consider a distributed storage system (DSS) formed of n nodes indexed from 1 to n.  ... 
arXiv:1707.09916v1 fatcat:gfqh3na5yfdijfg3qvovhs7u6m

Privacy-Preserving Smart Parking System Using Blockchain and Private Information Retrieval [article]

Wesam Al Amiri, Mohamed Baza, Karim Banawan, Mohamed Mahmoud, Waleed Alasmary, Kemal Akkaya
2021 arXiv   pre-print
To preserve drivers' location privacy, we adopt a private information retrieval (PIR) technique to enable drivers to retrieve parking offers from blockchain nodes privately, without revealing which parking  ...  Smart parking systems are a novel solution to enable drivers to have real-time parking information for pre-booking.  ...  This scheme is an information-theoretic PIR scheme for retrieving data from MDS-coded, colluding, unresponsive, and Byzantine databases.  ... 
arXiv:1904.09703v3 fatcat:icbl5cmz45a3le6wr5ndetfeia

The Capacity of Private Information Retrieval from Byzantine and Colluding Databases [article]

Karim Banawan, Sennur Ulukus
2017 arXiv   pre-print
We consider the problem of single-round private information retrieval (PIR) from N replicated databases.  ...  This capacity expression shows that the effect of Byzantine databases on the retrieval rate is equivalent to removing 2B databases from the system, with a penalty factor of N-2B/N, which signifies that  ...  introduced the problem of private information retrieval (PIR).  ... 
arXiv:1706.01442v1 fatcat:e2raadknkneb5g6y3q3hcz74oa

Towards the Capacity of Private Information Retrieval from Coded and Colluding Servers [article]

Lukas Holzbaur, Ragnar Freij-Hollanti, Jie Li, Camilla Hollanti
2021 arXiv   pre-print
In this work, two practical concepts related to private information retrieval (PIR) are introduced and coined full support-rank PIR and strongly linear PIR.  ...  Then, the capacity of MDS-coded, linear, full support-rank PIR in the presence of colluding servers is derived, as well as the capacity of symmetric, linear PIR with colluding, adversarial, and nonresponsive  ...  Chao Tian, and Dr. Qiwen Wang for helpful discussions.  ... 
arXiv:1903.12552v7 fatcat:wpgypxt4krbidjx524oxelcbym

Private Polynomial Computation from Lagrange Encoding [article]

Netanel Raviv, David A. Karpuk
2019 arXiv   pre-print
In particular, we present a scheme that enables private computation of polynomials of any degree on Lagrange encoded data, while being robust to Byzantine and straggling servers, and to servers colluding  ...  Private computation is a generalization of private information retrieval, in which a user is able to compute a function on a distributed dataset without revealing the identity of that function to the servers  ...  The second author would like to thank Razane Tajeddine and Oliver Gnilke for constructive and helpful conversations regarding the results of the current work.  ... 
arXiv:1812.04142v3 fatcat:3hcxx356gbhovn7eycsxnpl7ba

Robust low-delay Streaming PIR using convolutional codes [article]

Julia Lieb, Diego Napp, Raquel Pinto
2019 arXiv   pre-print
In this paper we investigate the design of a low-delay robust streaming PIR scheme on coded data that is resilient to unresponsive or slow servers and can privately retrieve streaming data in a sequential  ...  We present a scheme based on convolutional codes and the star product and assume no collusion between servers.  ...  ACKNOWLEDGMENT The work of the first and third author was supported by the Portuguese Foundation for Science and Technology  ... 
arXiv:1911.01316v2 fatcat:lwt5mogs6zhdtc3m5kcovgtk6a

Weighted Lifted Codes: Local Correctabilities and Application to Robust Private Information Retrieval [article]

Julien Lavauzelle, Jade Nardi
2019 arXiv   pre-print
We prove that such codes allow us to build PIR protocols with optimal computation complexity and resisting to a small number of colluding servers.  ...  Low degree Reed-Muller codes are known to satisfy local decoding properties which find applications in private information retrieval (PIR) protocols, for instance.  ...  This work was also funded in part by the grant ANR-15-CE39-0013-01 "Manta" from the French National Research Agency, which gave the authors the opportunity to work together.  ... 
arXiv:1904.08696v1 fatcat:rv33e32ijfadhl266nn2t6xrf4
« Previous Showing results 1 — 15 out of 36 results