{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:52:58Z","timestamp":1776444778206,"version":"3.51.2"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2201824,CCF-2201825"],"award-info":[{"award-number":["CCF-2201824,CCF-2201825"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619082","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"927-932","source":"Crossref","is-referenced-by-count":5,"title":["Private Sum Computation: Trade-Off Between Shared Randomness and Privacy"],"prefix":"10.1109","author":[{"given":"R\u00e9mi A.","family":"Chou","sequence":"first","affiliation":[{"name":"University of Texas at Arlington,CSE Department,Arlington,TX"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Kliewer","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology,ECE Department,Newark,NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aylin","family":"Yener","sequence":"additional","affiliation":[{"name":"The Ohio State University,ECE Department,Columbus,OH"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417885"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3054610"},{"key":"ref4","article-title":"Fast-secagg: Scalable secure aggregation for privacy-preserving federated learning","author":"Kadhe","year":"2020","journal-title":"arXiv preprint"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3192874"},{"key":"ref6","first-page":"694","article-title":"Lightsecagg: a lightweight and versatile design for secure aggregation in federated learning","volume-title":"Proceedings of Machine Learning and Systems","volume":"4","author":"So","year":"2022"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2023.3242702"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2024.3422087"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3244243"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3163592"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90120-X"},{"key":"ref12","article-title":"Secure modulo zero-sum randomness as cryptographic resource","author":"Hayashi","year":"2018","journal-title":"Cryptology ePrint Archive"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3390\/e23111461"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142373"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39568-7_20"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/ecja.4410690906"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2023.3342571"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130407"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2980789"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2568207"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165807"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2922634"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834387"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2852276"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32284-6_11"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174383"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206726"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619082.pdf?arnumber=10619082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:01Z","timestamp":1773347341000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619082\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619082","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}