{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:46Z","timestamp":1773377806217,"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.8849474","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1672-1676","source":"Crossref","is-referenced-by-count":3,"title":["Private Polynomial Computation from Lagrange Encoding"],"prefix":"10.1109","author":[{"given":"Netanel","family":"Raviv","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, 91125, USA"}]},{"given":"David A.","family":"Karpuk","sequence":"additional","affiliation":[{"name":"Departamento de Matemáticas, Universidad de los Andes, Bogotá, Colombia"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777490"},{"key":"ref12","article-title":"The capacity of private computation","author":"sun","year":"2017"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2815607"},{"key":"ref14","article-title":"Private information retrieval from coded storage systems with colluding, byzantine, and unresponsive servers","author":"tajeddine","year":"2018"},{"key":"ref15","article-title":"Lagrange coded computing: optimal design for resiliency, security and privacy","author":"yu","year":"2018"},{"key":"ref4","article-title":"Cross subspace alignment and the asymptotic capacity of X-secure T -private information retrieval","author":"jia","year":"2018"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/16M1102562"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IWCIT.2018.8405043"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437349"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636039"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437655"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2869154"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref9","article-title":"Private Polynomial Computation from Lagrange Encoding","author":"raviv","year":"2018"}],"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\/08849474.pdf?arnumber=8849474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:13Z","timestamp":1773347713000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849474\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849474","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}