The Minimum Upload Cost of Symmetric Private Information Retrieval

For the symmetric private information retrieval problem with K messages and N servers, we show that the minimum (symmetric) upload cost is {\log _2}\left( {\left\lceil {{K^{\frac{1}{{N - 1}}} \right\rceil } \right) bits per server, i.e., the user must upload a q-ary symbol to each server where q is...

Full description

Saved in:
Bibliographic Details
Published in2020 IEEE International Symposium on Information Theory (ISIT) pp. 1030 - 1034
Main Authors Zhou, Yanliang, Wang, Qiwen, Sun, Hua, Fu, Shengli
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2020
Online AccessGet full text

Cover

More Information
Summary:For the symmetric private information retrieval problem with K messages and N servers, we show that the minimum (symmetric) upload cost is {\log _2}\left( {\left\lceil {{K^{\frac{1}{{N - 1}}} \right\rceil } \right) bits per server, i.e., the user must upload a q-ary symbol to each server where q is at least \left\lceil {{K^{\frac{1}{{N - 1}}} \right\rceil .
ISSN:2157-8117
DOI:10.1109/ISIT44484.2020.9174274