Filters








1,638 Hits in 3.6 sec

Private Information Retrieval from Coded Databases with Colluding Servers

Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti, David A. Karpuk
2017 SIAM Journal on applied algebra and geometry  
We present a general framework for Private Information Retrieval (PIR) from arbitrary coded databases, that allows one to adjust the rate of the scheme according to the suspected number of colluding servers  ...  If the storage code is a generalized Reed-Solomon code of length n and dimension k, we design PIR schemes which simultaneously protect against t colluding servers and provide PIR rate 1-(k+t-1)/n, for  ...  Private information retrieval from GRS codes.  ... 
doi:10.1137/16m1102562 fatcat:kossctdldvekjnysnbz7dm6gmq

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

Yiwei Zhang, Gennian Ge
2017 arXiv   pre-print
A user wants to retrieve a specific file from the database privately against an arbitrary set of T colluding servers.  ...  Private information retrieval (PIR) gets renewed attentions due to its information-theoretic reformulation and its application in distributed storage system (DSS).  ...  Instead of retrieving a single bit from an n-bit database, the information-theoretic PIR problem considers retrieving a single file from an n-file database, where the length of each file could be arbitrarily  ... 
arXiv:1705.03186v2 fatcat:ntkcqf2nd5d37ipef4rku65tze

Privacy preserving information retrieval over unsynchronized databases

Meenu Poulose, Tinku Soman Jacob
2016 International Journal on Cybernetics & Informatics  
KEYWORDS Private information retrieval, information theoretic privacy, database management, distributed source coding.  ...  If the user accesses the x th data then that 'x' must be hidden from the server. Private information retrieval can solve this issue.  ...  Private information retrieval (PIR) is a way for a client to look up information in an online database without letting the database servers learns the query terms or responses.  ... 
doi:10.5121/ijci.2016.5226 fatcat:bz27zui5jjdltc7xx55bsfsg4a

Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns [article]

Razane Tajeddine, Oliver W. Gnilke, David Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti, Salim El Rouayheb
2017 arXiv   pre-print
In Private Information Retrieval (PIR), one wants to download a file from a database without revealing to the database which file is being downloaded.  ...  With the goal of studying the achievable PIR rates in realistic scenarios, we generalize results for coded data from the case of all subsets of servers of size t colluding, to arbitrary subsets of the  ...  INTRODUCTION In Private Information Retrieval (PIR), a user is interested in obtaining the data in an entry of an online database, while keeping private which entry she is interested in.  ... 
arXiv:1701.07636v3 fatcat:3hl62uyh4rffxbors22bz6qi5y

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
Star product PIR schemes from general coded distributed storage system with colluding servers were constructed over general finite fields.  ...  For MDS coded distributed storage system private information retrieval was proposed and the capacity of PIR schemes for MDS coded distributed storage was studied.  ...  Private information retrieval was proposed in [7, 8] .  ... 
arXiv:2207.03163v2 fatcat:cedtic2vuzabpjxtt7jzw3gi5m

Linear Symmetric Private Information Retrieval for MDS Coded Distributed Storage with Colluding Servers [article]

Qiwen Wang, Mikael Skoglund
2017 arXiv   pre-print
The problem of symmetric private information retrieval (SPIR) from a coded database which is distributively stored among colluding servers is studied.  ...  A user wants to retrieve one file from the database by communicating with the N servers, without revealing the identity of the desired file to any server.  ...  INTRODUCTION The situation where a user wants to retrieve a file from a database without revealing the identity of the requested file is known as the problem of private information retrieval (PIR).  ... 
arXiv:1708.05673v1 fatcat:3qcv3svpwbd4hbf5zgiirvx7hm

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

Razane Tajeddine, Oliver W. Gnilke, David Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti
2018 2018 IEEE International Symposium on Information Theory (ISIT)  
A private information retrieval (PIR) scheme on coded storage systems with colluding, byzantine, and nonresponsive 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 +  ...  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  ... 
doi:10.1109/isit.2018.8437670 dblp:conf/isit/TajeddineGKFH18 fatcat:dgjujxbgxnbqhimwft2u2hpf2q

Secure Symmetric Private Information Retrieval from Colluding Databases with Adversaries [article]

Qiwen Wang, Mikael Skoglund
2017 arXiv   pre-print
The problem of symmetric private information retrieval (SPIR) from replicated databases with colluding servers and adversaries is studied.  ...  A user wants to retrieve one file from the database by communicating with the N servers, without revealing the identity of the desired file to any server.  ...  Abstract-The problem of symmetric private information retrieval (SPIR) from replicated databases with colluding servers and adversaries is studied.  ... 
arXiv:1707.02152v1 fatcat:4p264gcgcjfcxgwnjwpvrht7i4

Symmetric Private Information Retrieval from MDS Coded Distributed Storage with Non-colluding and Colluding Servers

Qiwen Wang, Mikael Skoglund
2019 IEEE Transactions on Information Theory  
A user wants to retrieve a file from a database without revealing the identity of the file retrieved to the operator of the database (server), which is known as the problem of private information retrieval  ...  If it is further required that the user obtains no information about the other files in the database, the concept of symmetric private information retrieval (SPIR) is introduced to guarantee privacy for  ...  Hua Sun from University of North Texas for the discussion on the storage of the randomness and its importance in SPIR problems.  ... 
doi:10.1109/tit.2019.2903206 fatcat:g2tnk3h7uzeltehrdmoqc6vupi

Private Information Retrieval Schemes Using Cyclic Codes [article]

Şeyma Bodur, Edgar Martínez-Moro, Diego Ruano
2022 arXiv   pre-print
A Private Information Retrieval (PIR) scheme allows users to retrieve data from a database without disclosing to the server information about the identity of the data retrieved.  ...  A coded storage in a distributed storage system with colluding servers is considered in this work, namely the approach in [t-private information retrieval schemes using transitive codes, IEEE Trans.  ...  Hernando (Universitat Jaume I) for providing us the code of the algorithm in [9] .  ... 
arXiv:2111.09060v2 fatcat:k6pfwzxesvhvjlmdgron7wxk4q

On PIR and Symmetric PIR from Colluding Databases with Adversaries and Eavesdroppers

Qiwen Wang, Mikael Skoglund
2018 IEEE Transactions on Information Theory  
We consider the problem of private information retrieval (PIR) and symmetric private information retrieval (SPIR) from replicated databases with colluding servers, in the presence of Byzantine adversaries  ...  A user wants to retrieve one message by communicating with the databases, without revealing the identity of the message retrieved.  ...  For symmetric private information retrieval from a database with K ≥ 2 messages which are replicated at N servers, where any T servers may collude and an eavesdropper can tap in on the communication of  ... 
doi:10.1109/tit.2018.2878034 fatcat:chanjzdzerglvdouskoux4riza

Storage and Retrieval Codes in PIR Schemes with Colluding Servers [article]

Hao Chen, Liqing Xu
2022 arXiv   pre-print
Private information retrieval (PIR) schemes (with or without colluding servers) have been proposed for realistic coded distributed data storage systems.  ...  Therefore in the design of star product PIR schemes with colluding servers, the scheme with the storage code and the retrieval code in the same family of algebraic codes is not always efficient.  ...  PIR schemes with colluding servers for coded databases from general linear codes over small fields are considered in [19, 20, 28, 30, 31] .  ... 
arXiv:2207.06087v4 fatcat:oseons42mnhbxc76guxwyvngqq

Quantum Private Information Retrieval from Coded and Colluding Servers [article]

Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha, Camilla Hollanti
2020 arXiv   pre-print
In the classical private information retrieval (PIR) setup, a user wants to retrieve a file from a database or a distributed storage system (DSS) without revealing the file identity to the servers holding  ...  In the quantum PIR (QPIR) setting, a user privately retrieves a classical file by receiving quantum information from the servers.  ...  Abstract-In the classical private information retrieval (PIR) setup, a user wants to retrieve a file from a database or a distributed storage system (DSS) without revealing the file identity to the servers  ... 
arXiv:2001.05883v3 fatcat:7ojf4gluufglvhyzhtiehasqri

Private Information Retrieval from Locally Repairable Databases with Colluding Servers [article]

Umberto Martínez-Peñas
2019 arXiv   pre-print
Information-theoretical private information retrieval (PIR) is considered from a coded database with colluding servers.  ...  Servers are identified bijectively with local groups, and only locally non-redundant information is considered and downloaded from each server, that is, only r nodes (out of r+δ-1 ) are considered per  ...  Acknowledgement The author gratefully acknowledges the support from The Independent Research Fund Denmark (Grant No. DFF-7027-00053B).  ... 
arXiv:1901.02938v2 fatcat:zac7377zejcfhd6abgakvrc2u4
« Previous Showing results 1 — 15 out of 1,638 results