A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes

Yeow Meng Chee; Han Mao Kiah; Eitan Yaakobi; Hui Zhang

doi:10.1109/ISIT.2019.8849373

A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes

Yeow Meng Chee, Han Mao Kiah, Eitan Yaakobi, Hui Zhang

Computer Science

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Private Information Retrieval (PIR) array codes were introduced by Fazeli et al. (2015) to reduce the storage overhead in designing PIR protocols. Blackburn and Etzion (2017) introduced the (virtual server) rate to quantify the storage overhead of the codes, and when s > 2 (here, frac{1}{s} is the proportion of the database storing in one server), they gave a general construction of PIR array codes with the highest rate known so far. In this paper, we generalize their construction and reduce the number of servers, while maintaining the rate. In order to give PIR array codes with significantly fewer servers, we also construct classes of codes with a smaller rate frac{s}{{2s - 1}}.

Original language	English
Title of host publication	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
Pages	1062-1066
Number of pages	5
ISBN (Electronic)	9781538692912
DOIs	https://doi.org/10.1109/ISIT.2019.8849373
State	Published - Jul 2019
Event	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France Duration: 7 Jul 2019 → 12 Jul 2019

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2019-July

Conference

Conference	2019 IEEE International Symposium on Information Theory, ISIT 2019
Country/Territory	France
City	Paris
Period	7/07/19 → 12/07/19

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2019.8849373

Cite this

Chee, Y. M., Mao Kiah, H., Yaakobi, E., & Zhang, H. (2019). A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings (pp. 1062-1066). Article 8849373 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July). https://doi.org/10.1109/ISIT.2019.8849373

@inproceedings{12adce4337f0466f9636728d1f97573f,

title = "A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes",

abstract = "Private Information Retrieval (PIR) array codes were introduced by Fazeli et al. (2015) to reduce the storage overhead in designing PIR protocols. Blackburn and Etzion (2017) introduced the (virtual server) rate to quantify the storage overhead of the codes, and when s > 2 (here, frac{1}{s} is the proportion of the database storing in one server), they gave a general construction of PIR array codes with the highest rate known so far. In this paper, we generalize their construction and reduce the number of servers, while maintaining the rate. In order to give PIR array codes with significantly fewer servers, we also construct classes of codes with a smaller rate frac{s}{{2s - 1}}.",

author = "Chee, {Yeow Meng} and {Mao Kiah}, Han and Eitan Yaakobi and Hui Zhang",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE International Symposium on Information Theory, ISIT 2019 ; Conference date: 07-07-2019 Through 12-07-2019",

year = "2019",

month = jul,

doi = "10.1109/ISIT.2019.8849373",

language = "الإنجليزيّة",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1062--1066",

booktitle = "2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings",

}

Chee, YM, Mao Kiah, H, Yaakobi, E & Zhang, H 2019, A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes. in 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings., 8849373, IEEE International Symposium on Information Theory - Proceedings, vol. 2019-July, pp. 1062-1066, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 7/07/19. https://doi.org/10.1109/ISIT.2019.8849373

A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes. / Chee, Yeow Meng; Mao Kiah, Han; Yaakobi, Eitan et al.
2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. 2019. p. 1062-1066 8849373 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes

AU - Chee, Yeow Meng

AU - Mao Kiah, Han

AU - Yaakobi, Eitan

AU - Zhang, Hui

PY - 2019/7

Y1 - 2019/7

N2 - Private Information Retrieval (PIR) array codes were introduced by Fazeli et al. (2015) to reduce the storage overhead in designing PIR protocols. Blackburn and Etzion (2017) introduced the (virtual server) rate to quantify the storage overhead of the codes, and when s > 2 (here, frac{1}{s} is the proportion of the database storing in one server), they gave a general construction of PIR array codes with the highest rate known so far. In this paper, we generalize their construction and reduce the number of servers, while maintaining the rate. In order to give PIR array codes with significantly fewer servers, we also construct classes of codes with a smaller rate frac{s}{{2s - 1}}.

AB - Private Information Retrieval (PIR) array codes were introduced by Fazeli et al. (2015) to reduce the storage overhead in designing PIR protocols. Blackburn and Etzion (2017) introduced the (virtual server) rate to quantify the storage overhead of the codes, and when s > 2 (here, frac{1}{s} is the proportion of the database storing in one server), they gave a general construction of PIR array codes with the highest rate known so far. In this paper, we generalize their construction and reduce the number of servers, while maintaining the rate. In order to give PIR array codes with significantly fewer servers, we also construct classes of codes with a smaller rate frac{s}{{2s - 1}}.

UR - http://www.scopus.com/inward/record.url?scp=85073169655&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2019.8849373

DO - 10.1109/ISIT.2019.8849373

M3 - منشور من مؤتمر

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1062

EP - 1066

BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings

T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019

Y2 - 7 July 2019 through 12 July 2019

ER -

A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this