{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:50:26Z","timestamp":1780674626930,"version":"3.54.1"},"reference-count":35,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.23919\/eusipco.2019.8903166","type":"proceedings-article","created":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T18:39:38Z","timestamp":1574707178000},"page":"1-5","source":"Crossref","is-referenced-by-count":24,"title":["A Privacy-Preserving Asynchronous Averaging Algorithm based on Shamir\u2019s Secret Sharing"],"prefix":"10.23919","author":[{"given":"Qiongxiu","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mads Graesboll","family":"Christensen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1186\/1687-417X-2007-051368"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2015.2484326"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.64"},{"key":"ref30","author":"welch","year":"1986","journal-title":"Error correction for algebraic block codes"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40203-6_24"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2219653"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2307\/2285509"},{"key":"ref11","first-page":"1","article-title":"Differential privacy","author":"dwork","year":"2006","journal-title":"ICALP"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICTMICC.2007.4448699"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2381966.2381978"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2017.03.016"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2013.6669251"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2564339"},{"key":"ref18","article-title":"Privacy-preserving average consensus: privacy analysis and optimal algorithm design","author":"he","year":"2018","journal-title":"IEEE Trans Signal Process"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2587327"},{"key":"ref28","author":"liu","year":"1968","journal-title":"Introduction to Combinatorial Mathematics"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2004.02.022"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2052531"},{"key":"ref8","first-page":"1080","article-title":"Finite-time distributed consensus through graph filters","author":"aliaksei","year":"2014","journal-title":"ICASSP"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2017.2672403"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0743-7315(89)90021-X","article-title":"Dynamic load balancing for distributed memory multiprocessors","volume":"7","author":"cybenko","year":"1989","journal-title":"J Parallel and Distributed Comput"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"4117","DOI":"10.1109\/TSP.2017.2703660","article-title":"Optimal graph-filter design and applications to distributed linear network operators","volume":"65","author":"santiago","year":"2017","journal-title":"IEEE Trans Signal Process"},{"key":"ref1","author":"tsitsiklis","year":"1984","journal-title":"Problems in decentralized decision making and computation"},{"key":"ref20","article-title":"Privacy preserving randomized gossip algorithms","author":"hanzely","year":"2017","journal-title":"arXiv preprint arXiv 1706 07636"},{"key":"ref22","first-page":"1","article-title":"Privacy preserving distributed beamforming based on homomorphic encryption","author":"hendriks","year":"2013","journal-title":"EUSIPCO"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6855039"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6639020"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref25","first-page":"643","article-title":"Multiparty computation from somewhat homomorphic encryption","author":"damgard","year":"2012","journal-title":"Advances in Cryptology-CRYPTO"}],"event":{"name":"2019 27th European Signal Processing Conference (EUSIPCO)","location":"A Coruna, Spain","start":{"date-parts":[[2019,9,2]]},"end":{"date-parts":[[2019,9,6]]}},"container-title":["2019 27th European Signal Processing Conference (EUSIPCO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8893974\/8902336\/08903166.pdf?arnumber=8903166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T18:30:31Z","timestamp":1643308231000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8903166\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":35,"URL":"https:\/\/doi.org\/10.23919\/eusipco.2019.8903166","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}