{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:55Z","timestamp":1773377035263,"version":"3.50.1"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195695","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Individual Confidential Computing of Polynomials Over Non-Uniform Information"],"prefix":"10.1109","author":[{"given":"Saar","family":"Tarnopolsky","sequence":"first","affiliation":[{"name":"Technion,Faculty of ECE,Israel"}]},{"given":"Zirui","family":"Deng","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis,Department of Computer Science and Engineering,St. Louis,USA"}]},{"given":"Vinayak","family":"Ramkumar","sequence":"additional","affiliation":[{"name":"Tel Aviv University,Department of Electrical Engineering-Systems,Israel"}]},{"given":"Netanel","family":"Raviv","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis,Department of Computer Science and Engineering,St. Louis,USA"}]},{"given":"Alejandro","family":"Cohen","sequence":"additional","affiliation":[{"name":"Technion,Faculty of ECE,Israel"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978308"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2931068"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557079"},{"key":"ref5","article-title":"Privacy-utility tradeoffs under constrained data release mechanisms","author":"Wang","year":"2017","journal-title":"arXiv preprint"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282765"},{"issue":"3","key":"ref7","article-title":"On perfect privacy and maximal correlation","volume":"2","author":"Rassouli","year":"2017","journal-title":"arXiv preprint"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053432"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SEED51797.2021.00025"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3447786.3456243"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1049\/cmu2.12759"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834572"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref14","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume-title":"The 22nd International Conference on Artificial Intelligence and Statistics","author":"Yu"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3177711"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619107"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619109"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055718"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511721656"},{"key":"ref21","article-title":"R \u2019enyi divergence guarantees for hashing with linear codes","author":"Pathegama","year":"2024","journal-title":"arXiv preprint"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977985"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39757-4_5"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055721"},{"key":"ref26","first-page":"8","article-title":"Weakly secure network coding","volume":"104","author":"Bhattad","year":"2005","journal-title":"NetCod"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2870831"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2694012"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2954652"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3276921"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195695"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195695.pdf?arnumber=11195695","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:12Z","timestamp":1773347412000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195695\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195695","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}