Achievable Rate of Private Function Retrieval from MDS Coded Databases

Sarah A. Obead; Jorg Kliewer

doi:10.1109/ISIT.2018.8437655

Achievable Rate of Private Function Retrieval from MDS Coded Databases

Sarah A. Obead, Jorg Kliewer

Electrical and Computer Engineering

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

24 Scopus citations

Abstract

We study the problem of private function retrieval (PFR) in a distributed storage system. In PFR the user wishes to retrieve a linear combination of M messages stored in non-colluding (N, K) MDS coded databases while revealing no information about the coefficients of the intended linear combination to any of the individual databases. We present an achievable scheme for MDS coded PFR with a rate that matches the capacity for coded private information retrieval derived recently, R= (1+R-{c}+R-{c}^{2}+\cdots +R-{c}^{M-1})^{-1}=\frac{1-R-{c}}{1-R-{c}^{M}}, where R-{c}=\frac{K}{N} is the rate of the MDS code.

Original language	English (US)
Title of host publication	2018 IEEE International Symposium on Information Theory, ISIT 2018
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2117-2121
Number of pages	5
ISBN (Print)	9781538647806
DOIs	https://doi.org/10.1109/ISIT.2018.8437655
State	Published - Aug 15 2018
Event	2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States Duration: Jun 17 2018 → Jun 22 2018

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2018-June
ISSN (Print)	2157-8095

Other

Other	2018 IEEE International Symposium on Information Theory, ISIT 2018
Country/Territory	United States
City	Vail
Period	6/17/18 → 6/22/18

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2018.8437655

Cite this

Obead, S. A., & Kliewer, J. (2018). Achievable Rate of Private Function Retrieval from MDS Coded Databases. In 2018 IEEE International Symposium on Information Theory, ISIT 2018 (pp. 2117-2121). Article 8437655 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2018.8437655

@inproceedings{757e1527df7e4568b91b6500a26779b2,

title = "Achievable Rate of Private Function Retrieval from MDS Coded Databases",

abstract = "We study the problem of private function retrieval (PFR) in a distributed storage system. In PFR the user wishes to retrieve a linear combination of M messages stored in non-colluding (N, K) MDS coded databases while revealing no information about the coefficients of the intended linear combination to any of the individual databases. We present an achievable scheme for MDS coded PFR with a rate that matches the capacity for coded private information retrieval derived recently, R= (1+R-{c}+R-{c}^{2}+\cdots +R-{c}^{M-1})^{-1}=\frac{1-R-{c}}{1-R-{c}^{M}}, where R-{c}=\frac{K}{N} is the rate of the MDS code.",

author = "Obead, {Sarah A.} and Jorg Kliewer",

note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 2018 IEEE International Symposium on Information Theory, ISIT 2018 ; Conference date: 17-06-2018 Through 22-06-2018",

year = "2018",

month = aug,

day = "15",

doi = "10.1109/ISIT.2018.8437655",

language = "English (US)",

isbn = "9781538647806",

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

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "2117--2121",

booktitle = "2018 IEEE International Symposium on Information Theory, ISIT 2018",

address = "United States",

}

Obead, SA & Kliewer, J 2018, Achievable Rate of Private Function Retrieval from MDS Coded Databases. in 2018 IEEE International Symposium on Information Theory, ISIT 2018., 8437655, IEEE International Symposium on Information Theory - Proceedings, vol. 2018-June, Institute of Electrical and Electronics Engineers Inc., pp. 2117-2121, 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 6/17/18. https://doi.org/10.1109/ISIT.2018.8437655

Achievable Rate of Private Function Retrieval from MDS Coded Databases. / Obead, Sarah A.; Kliewer, Jorg.
2018 IEEE International Symposium on Information Theory, ISIT 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 2117-2121 8437655 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June).

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

TY - GEN

T1 - Achievable Rate of Private Function Retrieval from MDS Coded Databases

AU - Obead, Sarah A.

AU - Kliewer, Jorg

PY - 2018/8/15

Y1 - 2018/8/15

N2 - We study the problem of private function retrieval (PFR) in a distributed storage system. In PFR the user wishes to retrieve a linear combination of M messages stored in non-colluding (N, K) MDS coded databases while revealing no information about the coefficients of the intended linear combination to any of the individual databases. We present an achievable scheme for MDS coded PFR with a rate that matches the capacity for coded private information retrieval derived recently, R= (1+R-{c}+R-{c}^{2}+\cdots +R-{c}^{M-1})^{-1}=\frac{1-R-{c}}{1-R-{c}^{M}}, where R-{c}=\frac{K}{N} is the rate of the MDS code.

AB - We study the problem of private function retrieval (PFR) in a distributed storage system. In PFR the user wishes to retrieve a linear combination of M messages stored in non-colluding (N, K) MDS coded databases while revealing no information about the coefficients of the intended linear combination to any of the individual databases. We present an achievable scheme for MDS coded PFR with a rate that matches the capacity for coded private information retrieval derived recently, R= (1+R-{c}+R-{c}^{2}+\cdots +R-{c}^{M-1})^{-1}=\frac{1-R-{c}}{1-R-{c}^{M}}, where R-{c}=\frac{K}{N} is the rate of the MDS code.

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

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

U2 - 10.1109/ISIT.2018.8437655

DO - 10.1109/ISIT.2018.8437655

M3 - Conference contribution

AN - SCOPUS:85052465962

SN - 9781538647806

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2117

EP - 2121

BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 17 June 2018 through 22 June 2018

ER -

Achievable Rate of Private Function Retrieval from MDS Coded Databases

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this