{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:12Z","timestamp":1773377592631,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849825","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1677-1681","source":"Crossref","is-referenced-by-count":5,"title":["Private Polynomial Computation for Noncolluding Coded Databases"],"prefix":"10.1109","author":[{"given":"Sarah A.","family":"Obead","sequence":"first","affiliation":[{"name":"Helen and John C. Hartmann Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, New Jersey, 07102, USA"}]},{"given":"Hsuan-Yin","family":"Lin","sequence":"additional","affiliation":[{"name":"Simula UiB, Bergen, N-5008, Norway"}]},{"given":"Eirik","family":"Rosnes","sequence":"additional","affiliation":[{"name":"Simula UiB, Bergen, N-5008, Norway"}]},{"given":"J\u00f6rg","family":"Kliewer","sequence":"additional","affiliation":[{"name":"Helen and John C. Hartmann Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, New Jersey, 07102, USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437349"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437655"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636039"},{"key":"ref13","article-title":"Private polynomial computation from Lagrange encoding","author":"raviv","year":"2018"},{"key":"ref14","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume":"89","author":"yu","year":"2019","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437805"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/16M1102562"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2900313"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2815607"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2018.8422963"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IWCIT.2018.8405043"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437511"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849825.pdf?arnumber=8849825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:31Z","timestamp":1773347671000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849825\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849825","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}