Filters








272 Hits in 4.5 sec

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  ...  A robust PIR scheme on coded data with colluding and byzantine servers was constructed in [20] .  ... 
arXiv:1802.03731v2 fatcat:t73hr2aw4bhvxb4smp5f7t5pcy

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 +  ...  Gnilke and R.  ... 
doi:10.1109/isit.2018.8437670 dblp:conf/isit/TajeddineGKFH18 fatcat:dgjujxbgxnbqhimwft2u2hpf2q

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  ...  Recent breakthroughs from coding, communication, and informationtheoretic perspectives have opened up exciting new research avenues for these topics.  ...  and/or Byzantine servers.  ... 
doi:10.1109/jsac.2022.3142570 fatcat:gcb24zb7yfarfemlnk7gp6mnma

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.  ...  Private information retrieval was proposed in [7, 8] .  ... 
arXiv:2207.03163v2 fatcat:cedtic2vuzabpjxtt7jzw3gi5m

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).  ...  Then we can solve the six systems of equations to retrieve a [1] [1:6] and a [2] [1 :6] . The scheme is private against any two colluding servers.  ... 
arXiv:1705.03186v2 fatcat:ntkcqf2nd5d37ipef4rku65tze

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.  ...  II Razane Tajeddine and Salim El Rouayheb. Robust Private Information Retrieval on Coded Data. In IEEE International Symposium on IV Razane Tajeddine, Oliver W.  ...  (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

A Fast Multi-Server, Multi-Block Private Information Retrieval Protocol

Luqin Wang, Trishank Karthik Kuppusamy, Yong Liu, Justin Cappos
2015 2015 IEEE Global Communications Conference (GLOBECOM)  
Private Information Retrieval (PIR) allows users to retrieve information from a database without revealing which information in the database was queried.  ...  The implementation of fast XOR operations benefits both servers and clients in reducing coding and decoding time.  ...  Private Information Retrieval (PIR) allows users to retrieve information from a database without revealing the queries to anyone, including the database server itself.  ... 
doi:10.1109/glocom.2015.7417246 fatcat:4qatfjcndjhsbad34jiqkabf6q

A Fast Multi-Server, Multi-Block Private Information Retrieval Protocol

Luqin Wang, Trishank Karthik Kuppusamy, Yong Liu, Justin Cappos
2014 2015 IEEE Global Communications Conference (GLOBECOM)  
Private Information Retrieval (PIR) allows users to retrieve information from a database without revealing which information in the database was queried.  ...  The implementation of fast XOR operations benefits both servers and clients in reducing coding and decoding time.  ...  Private Information Retrieval (PIR) allows users to retrieve information from a database without revealing the queries to anyone, including the database server itself.  ... 
doi:10.1109/glocom.2014.7417246 dblp:conf/globecom/WangKLC15 fatcat:v4aje24j2rdg5buz6yqtfhgpli

Privacy preserving information retrieval over unsynchronized databases

Meenu Poulose, Tinku Soman Jacob
2016 International Journal on Cybernetics & Informatics  
If the user accesses the x th data then that 'x' must be hidden from the server. Private information retrieval can solve this issue.  ...  KEYWORDS Private information retrieval, information theoretic privacy, database management, distributed source coding.  ...  Existing schemes only addressed the assumptions 3 and 4. Some PIR schemes are robust to Byzantine servers that return arbitrary , incorrect information [10] .  ... 
doi:10.5121/ijci.2016.5226 fatcat:bz27zui5jjdltc7xx55bsfsg4a

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

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 ν.  ...  The setting in which nodes can be byzantine (malicious) and store replicated data was considered in [17] - [19] and robust PIR schemes were devised using locally decodable codes.  ... 
arXiv:1707.09916v1 fatcat:gfqh3na5yfdijfg3qvovhs7u6m

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

Optimally Robust Private Information Retrieval

Casey Devet, Ian Goldberg, Nadia Heninger
2012 USENIX Security Symposium  
We give a protocol for multi-server information-theoretic private information retrieval which achieves the theoretical limit for Byzantine robustness.  ...  That is, the protocol can allow a client to successfully complete queries and identify server misbehavior in the presence of the maximum possible number of malicious servers.  ...  DMS-1103803, and the MURI program under AFOSR Grant No. FA9550-08-1-0352.  ... 
dblp:conf/uss/DevetGH12 fatcat:rzj7rogysjdlrarz4dw2nmrbh4

Do you feel a chill? Using PIR against chilling effects for censorship-resistant publishing [article]

Miti Mazmudar, Stan Gurtler, Ian Goldberg
2021 IACR Cryptology ePrint Archive  
We provide an architecture that uses information-theoretic private information retrieval to efficiently render a server node incapable of determining what content was retrieved in a given request by a  ...  Finally, we simulate our system and show that it has a small communication and performance overhead over other systems without this privacy guarantee, and smaller overheads with respect to the closest  ...  ACKNOWLEDGMENTS We thank the Royal Bank of Canada and NSERC grant CRDPJ-534381 for funding this work. This research was undertaken, in part, thanks to funding from the Canada Research Chairs program.  ... 
dblp:journals/iacr/MazmudarGG21 fatcat:heukdudfrnfixikkwtyy2yjrym

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  ...  They propose a generic transformation from schemes of RPIR to robust protocols that tolerate Byzantine servers, and give an explicit Byzantine robust scheme when B ≤ T ≤ N 3 . [25] presents a fault-tolerant  ... 
arXiv:1706.01442v1 fatcat:e2raadknkneb5g6y3q3hcz74oa
« Previous Showing results 1 — 15 out of 272 results