## Abstract

Motivated by the application of private statistical analysis of large databases, we consider the problem of selective private function evaluation (SPFE). In this problem, a client interacts with one or more servers holding copies of a database x = x_{1},..., x_{n} in order to compute f(x_{i1},..., x_{im}), for some function f and indices i = i_{1},..., i_{m} chosen by the client. Ideally, the client must learn nothing more about the database than f(x_{i1},..., x_{im}), and the servers should learn nothing. Generic solutions for this problem, based on standard techniques for secure function evaluation, incur communication complexity that is at least linear in n, making them prohibitive for large databases even when f is relatively simple and m is small. We present various approaches for constructing sublinear-communication SPFE protocols, both for the general problem and for special cases of interest. Our solutions not only offer sublinear communication complexity, but are also practical in many scenarios.

Original language | English |
---|---|

Pages | 293-302 |

Number of pages | 10 |

DOIs | |

State | Published - 2001 |

Externally published | Yes |

Event | 20th Annual ACM Symposium on Principles of Distributed Computing - Newport, Rhode Island, United States Duration: 26 Aug 2001 → 29 Aug 2001 |

### Conference

Conference | 20th Annual ACM Symposium on Principles of Distributed Computing |
---|---|

Country/Territory | United States |

City | Newport, Rhode Island |

Period | 26/08/01 → 29/08/01 |