29 citations · 84 across the 11 of their papers we have counts for
11 papers
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 \…
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…
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…
Pliable Private Information Retrieval
Sarah A. Obead, Jörg Kliewer
We formulate a new variant of the private information retrieval (PIR) problem where the user is pliable, i.e., interested in any message from a desired subset of the available data…
Private Function Computation for Noncolluding Coded Databases
Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes +1
Private computation in a distributed storage system (DSS) is a generalization of the private information retrieval (PIR) problem. In such setting a user wishes to compute a functio…
Private Polynomial Computation for Noncolluding Coded Databases
Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes +1
We consider private polynomial computation (PPC) over noncolluding coded databases. In such a setting a user wishes to compute a multivariate polynomial of degree at most over…
Capacity of Private Linear Computation for Coded Databases
Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes +1
We consider the problem of private linear computation (PLC) in a distributed storage system. In PLC, a user wishes to compute a linear combination of messages stored in noncoll…
Strong Coordination over Noisy Channels
Sarah A. Obead, Badri N. Vellambi, Jörg Kliewer
We study the problem of strong coordination of the actions of two nodes and that communicate over a discrete memoryless channel (DMC) such that the actions follow a prescri…
Achievable Rate of Private Function Retrieval from MDS Coded Databases
Sarah A. Obead, Jörg Kliewer
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 messages stored in non-coll…
Joint Coordination-Channel Coding for Strong Coordination over Noisy Channels Based on Polar Codes
Sarah A. Obead, Jörg Kliewer, Badri N. Vellambi
We construct a joint coordination-channel polar coding scheme for strong coordination of actions between two agents and , which communicate over a discrete m…
Strong Coordination over Noisy Channels: Is Separation Sufficient?
Sarah A. Obead, Badri N. Vellambi, Jörg Kliewer
We study the problem of strong coordination of actions of two agents and that communicate over a noisy communication channel such that the actions follow a given joint prob…