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

DOI10.1109/TIT.2018.2883283zbMath1431.94118OpenAlexW2902494461MaRDI QIDQ5223965

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

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

Related Items (1)

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

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