3 papers
cs.IT2024
Improved Capacity Outer Bound for Private Quadratic Monomial Computation
Karen M. Dæhli, Sarah A Obead, Hsuan-Yin Lin +1
In private computation, a user wishes to retrieve a function evaluation of messages stored on a set of databases without revealing the function's identity to the databases. Obead \…
cs.IT2023
On the Capacity of Private Nonlinear Computation for Replicated Databases
Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes +1
We consider the problem of private computation (PC) in a distributed storage system. In such a setting a user wishes to compute a function of messages replicated across non…
cs.IT2023
Single-Server Pliable Private Information Retrieval With Side Information
Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes
We study the problem of pliable private information retrieval with side information (PPIR-SI) for the single server case. In PPIR, the messages are partitioned into nonoverlapping…