{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T18:00:33Z","timestamp":1775671233211,"version":"3.50.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF CAREER Award","award":["CCF-2144927"],"award-info":[{"award-number":["CCF-2144927"]}]},{"name":"OUSD (R&E)\/RT&L under Cooperative Agreement Number","award":["W911NF-20-2-0267"],"award-info":[{"award-number":["W911NF-20-2-0267"]}]},{"name":"UCR OASIS Funding Award"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1109\/tcomm.2023.3308954","type":"journal-article","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T17:54:26Z","timestamp":1693245266000},"page":"162-178","source":"Crossref","is-referenced-by-count":12,"title":["SCALR: Communication-Efficient Secure Multi-Party Logistic Regression"],"prefix":"10.1109","volume":"72","author":[{"given":"Xingyu","family":"Lu","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California at Riverside, Riverside, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-2607-1927","authenticated-orcid":false,"given":"Hasin Us","family":"Sami","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California at Riverside, Riverside, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3246-1667","authenticated-orcid":false,"given":"Ba\u015fak","family":"G\u00fcler","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California at Riverside, Riverside, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume-title":"Proc. Int. Conf. Artif. Intell. Statist. (AISTATS)","author":"Yu"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053220"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3041404"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3054610"},{"key":"ref5","first-page":"1","article-title":"A scalable approach for privacypreserving collaborative machine learning","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst. (NeurIPS)","author":"So"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.30"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0053"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.12"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243760"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0035"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417885"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517953"},{"key":"ref19","first-page":"1","article-title":"LightSecAgg: A lightweight and versatile design for secure aggregation in federated learning","volume-title":"Proc. Mach. Learn. Syst.","volume":"4","author":"So"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i8.26177"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2023-0030"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref23","first-page":"1","article-title":"Privacy-preserving logistic regression","volume-title":"Proc. Adv. Neural Inf. Proc. Sys.","author":"Chaudhuri"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447103"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref26","first-page":"1876","article-title":"Multiparty differential privacy via aggregation of locally trained classifiers","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Pathak"},{"key":"ref27","first-page":"1","article-title":"Learning differentially private recurrent language models","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"McMahan"},{"key":"ref28","first-page":"933","article-title":"A differentially private stochastic gradient descent algorithm for multiparty classification","volume-title":"Proc. Int. Conf. Artif. Intell. Statist. (AISTATS)","author":"Rajkumar"},{"key":"ref29","first-page":"6346","article-title":"Distributed learning without distress: Privacy-preserving empirical risk minimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Jayaraman"},{"issue":"9","key":"ref30","volume-title":"A Fully Homomorphic Encryption Scheme","volume":"20","author":"Gentry","year":"2009"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref32","first-page":"201","article-title":"Cryptonets: Applying neural networks to encrypted data with high throughput and accuracy","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilad-Bachrach"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37682-5_1"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.18"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-017-0849-9"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2819673"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33019466"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1515\/9781400829361"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_6"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/08073408x"},{"key":"ref41","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"ref42","first-page":"1","article-title":"Result analysis of the NIPS 2003 feature selection challenge","volume-title":"Proc. Conf. Neural Inf. Process. Syst. (NeurIPS)","volume":"17","author":"Guyon"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.03.010"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813677"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-63076-8_2"},{"key":"ref46","first-page":"1","article-title":"Inverting gradients\u2014How easy is it to break privacy in federated learning?","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst. (NeurIPS)","author":"Geiping"},{"key":"ref47","first-page":"1","article-title":"The distributed discrete Gaussian mechanism for federated learning with secure aggregation","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Kairouz"},{"key":"ref48","first-page":"1","article-title":"The fundamental price of secure aggregation in differentially private federated learning","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Chen"},{"key":"ref49","volume-title":"Elements of Information Theory","author":"Thomas","year":"2006"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/26\/10400749\/10231140-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/10400749\/10231140.pdf?arnumber=10231140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T02:02:38Z","timestamp":1705543358000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10231140\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":49,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2023.3308954","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1]]}}}