Capacity-achieving private information retrieval scheme with a smaller sub-packetization
From MaRDI portal
Publication:2025372
DOI10.3934/amc.2020070OpenAlexW3015472099MaRDI QIDQ2025372
Zhengchun Zhou, Wenqin Zhang, Udaya Parampalli, Vladimir 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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Information storage and retrieval of data (68P20)
Cites Work
- Unnamed Item
- A general private information retrieval scheme for MDS 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.
- 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
- The Capacity of Private Information Retrieval from Byzantine and Colluding Databases
- Multi-Message Private Information Retrieval: Capacity Results and Near-Optimal Schemes
- Private Information Retrieval With Side Information
- The Capacity of T-Private Information Retrieval With Private Side Information
- The Optimal Sub-Packetization of Linear Capacity-Achieving PIR Schemes With Colluding Servers
- The Capacity of Private Information Retrieval
This page was built for publication: Capacity-achieving private information retrieval scheme with a smaller sub-packetization