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 noncolluding (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,
1−rc
k
r = (1 + rc + rc2 + · · · + rcm −1 )−1 = 1−r
m , where rc = n is
c
the rate of the mds code. this achievable rate is tight in some
special cases.