Follow
Sarah A. Obead
Title
Cited by
Cited by
Year
Achievable rate of private function retrieval from MDS coded databases
SA Obead, J Kliewer
2018 IEEE International Symposium on Information Theory (ISIT), 2117-2121, 2018
272018
Capacity of private linear computation for coded databases
SA Obead, HY Lin, E Rosnes, J Kliewer
2018 56th Annual Allerton Conference on Communication, Control, and …, 2018
242018
Private polynomial computation for noncolluding coded databases
SA Obead, HY Lin, E Rosnes, J Kliewer
2019 IEEE International Symposium on Information Theory (ISIT), 1677-1681, 2019
102019
Private function computation for noncolluding coded databases
SA Obead, HY Lin, E Rosnes, J Kliewer
arXiv preprint arXiv:2003.10007, 2020
62020
On the capacity of private nonlinear computation for replicated databases
SA Obead, HY Lin, E Rosnes, J Kliewer
2019 IEEE Information Theory Workshop (ITW), 1-5, 2019
42019
Joint coordination-channel coding for strong coordination over noisy channels based on polar codes
SA Obead, BN Vellambi, J Kliewer
2017 55th Annual Allerton Conference on Communication, Control, and …, 2018
42018
Strong coordination over noisy channels: Is separation sufficient?
SA Obead, BN Vellambi, J Kliewer
2017 IEEE International Symposium on Information Theory (ISIT), 2840-2844, 2017
32017
Private linear computation for noncolluding coded databases
SA Obead, HY Lin, E Rosnes, J Kliewer
IEEE Journal on Selected Areas in Communications 40 (3), 847-861, 2022
22022
Strong coordination over noisy channels
SA Obead, BN Vellambi, J Kliewer
IEEE Transactions on Information Theory 67 (5), 2716-2738, 2021
22021
Pliable Private Information Retrieval
SA Obead, J Kliewer
arXiv preprint arXiv:2206.05759, 2022
2022
Private Polynomial Function Computation for Noncolluding Coded Databases
SA Obead, HY Lin, E Rosnes, J Kliewer
IEEE Transactions on Information Forensics and Security 17, 1800-1813, 2022
2022
Source-channel coding for coordination over a noisy two-node network
SA Obead
2017
The system can't perform the operation now. Try again later.
Articles 1–12