The Optimal Sub-Packetization of Linear Capacity-Achieving PIR Schemes With Colluding Servers

DOI10.1109/TIT.2018.2883283zbMATH Open1431.94118OpenAlexW2902494461MaRDI QIDQ5223965FDOQ5223965

Authors: Zhifang Zhang, Jingke Xu 

Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2018.2883283

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Cryptography (94A60)

Cited In (2)

• Capacity-achieving private information retrieval scheme with a smaller sub-packetization
• PIR Array Codes With Optimal Virtual Server Rate

This page was built for publication: The Optimal Sub-Packetization of Linear Capacity-Achieving PIR Schemes With Colluding Servers

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