A general private information retrieval scheme for MDS coded databases with colluding servers

DOI10.1007/s10623-019-00640-xzbMath1423.68143arXiv1704.06785OpenAlexW2963190045WikidataQ127854900 ScholiaQ127854900MaRDI QIDQ2329401

Yiwei Zhang, Gennian Ge

Publication date: 17 October 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.06785

zbMATH Keywords

distributed storage systemprivate information retrievalPIR capacity

Mathematics Subject Classification ID

Database theory (68P15) Information theory (general) (94A15) Information storage and retrieval of data (68P20) Privacy of data (68P27)

Related Items (2)

Private Information Retrieval from Coded Databases with Colluding Servers ⋮ Capacity-achieving private information retrieval scheme with a smaller sub-packetization

Cites Work

• Unnamed Item
• 2-Server PIR with Sub-Polynomial Communication
• Private information retrieval
• Towards 3-query locally decodable codes of subexponential length
• Private Information Retrieval From MDS Coded Data in Distributed Storage Systems
• Private Information Retrieval from MDS Coded Data With Colluding Servers: Settling a Conjecture by Freij-Hollanti et al.
• The Capacity of Private Information Retrieval From Coded Databases
• The Capacity of Robust Private Information Retrieval With Colluding Databases
• Private Information Retrieval from Coded Databases with Colluding Servers
• Nearly Optimal Constructions of PIR and Batch Codes
• 3-Query Locally Decodable Codes of Subexponential Length
• On Private Information Retrieval Array Codes
• PIR Array Codes With Optimal Virtual Server Rate
• The Capacity of Private Information Retrieval
• A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers

This page was built for publication: A general private information retrieval scheme for MDS coded databases with colluding servers