Capacity-achieving private information retrieval scheme with a smaller sub-packetization

DOI10.3934/AMC.2020070MaRDI QIDQ2025372zbMATH OpenOpenAlexFDO

Authors Wenqin Zhang, Zhengchun Zhou, Udaya Parampalli, V. R. Sidorenko

Publication date 12 May 2021

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/amc.2020070

zbMATH Keywords

minimum download costprivate information retrievalstorage constrained serverssub-packetization

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Information storage and retrieval of data (68P20) Cryptography (94A60)

Recommendations

• Capacity-Achieving Private Information Retrieval Schemes From Uncoded Storage Constrained Servers With Low Sub-Packetization
• Capacity-Achieving Private Information Retrieval Codes With Optimal Message Size and Upload Cost
• The Capacity of Private Information Retrieval With Private Side Information Under Storage Constraints
• The Capacity of Symmetric Private Information Retrieval
• Multi-Message Private Information Retrieval: Capacity Results and Near-Optimal Schemes
• The Capacity of Private Information Retrieval
• The Capacity of Private Information Retrieval With Partially Known Private Side Information
• The Capacity of Private Information Retrieval With Eavesdroppers
• Multiround Private Information Retrieval: Capacity and Storage Overhead
• Toward the Capacity of Private Information Retrieval From Coded and Colluding Servers

Cites work

• A general private information retrieval scheme for MDS coded databases with colluding servers
• scientific article; zbMATH DE number 1261806 (Why is no real title available?)
• Multi-Message Private Information Retrieval: Capacity Results and Near-Optimal Schemes
• Private information retrieval from coded databases with colluding servers
• 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.
• Private Information Retrieval With Side Information
• The Capacity of T-Private Information Retrieval With Private Side Information
• The Capacity of Private Information Retrieval
• The Capacity of Private Information Retrieval from Byzantine and Colluding Databases
• The Capacity of Private Information Retrieval From Coded Databases
• The Capacity of Robust Private Information Retrieval With Colluding Databases
• The Optimal Sub-Packetization of Linear Capacity-Achieving PIR Schemes With Colluding Servers

Cited in

(1)

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

This page was built for publication: Capacity-achieving private information retrieval scheme with a smaller sub-packetization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2025372)