Achievable Rate of Private Function Retrieval from MDS Coded Databases
Document Type
Conference Proceeding
Publication Date
8-15-2018
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.
Identifier
85052465962 (Scopus)
ISBN
[9781538647806]
Publication Title
IEEE International Symposium on Information Theory Proceedings
External Full Text Location
https://doi.org/10.1109/ISIT.2018.8437655
ISSN
21578095
First Page
2117
Last Page
2121
Volume
2018-June
Grant
CNS-1526547
Fund Ref
Norsk Sykepleierforbund
Recommended Citation
Obead, Sarah A. and Kliewer, Jorg, "Achievable Rate of Private Function Retrieval from MDS Coded Databases" (2018). Faculty Publications. 8441.
https://digitalcommons.njit.edu/fac_pubs/8441
