{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T15:41:15Z","timestamp":1782574875986,"version":"3.54.5"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030905668","type":"print"},{"value":"9783030905675","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90567-5_26","type":"book-chapter","created":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T18:07:39Z","timestamp":1635962859000},"page":"510-528","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Non-interactive, Secure Verifiable Aggregation for Decentralized, Privacy-Preserving Learning"],"prefix":"10.1007","author":[{"given":"Carlo","family":"Brunetta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Georgia","family":"Tsaloli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bei","family":"Liang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gustavo","family":"Banegas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aikaterini","family":"Mitrokotsa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Coding and Cryptology","author":"A Beimel","year":"2011","unstructured":"Beimel, A., et al.: Secret-sharing schemes: a survey. In: Chee, Y.M. (ed.) IWCC 2011. LNCS, vol. 6639, pp. 11\u201346. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_2"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-47721-7_19","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"JC Benaloh","year":"1987","unstructured":"Benaloh, J.C.: Secret sharing homomorphisms: keeping shares of a secret secret (extended abstract). In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 251\u2013260. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_19"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-56614-6_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"E Boyle","year":"2017","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Group-based secure computation: optimizing rounds, communication, and computation. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 163\u2013193. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_6"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/3-540-46885-4_45","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201989","author":"EF Brickell","year":"1990","unstructured":"Brickell, E.F.: Some ideal secret sharing schemes. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 468\u2013475. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_45"},{"key":"26_CR5","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2019.2941481","author":"C Cai","year":"2019","unstructured":"Cai, C., Zheng, Y., Du, Y., Qin, Z., Wang, C.: Towards private, robust, and verifiable crowdsensing systems via public blockchains. IEEE Trans. Dependable Secure Comput. (2019). https:\/\/doi.org\/10.1109\/TDSC.2019.2941481","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"26_CR6","unstructured":"Capelli, A., Garbieri, G.: Corso Di Analisi Algebrica: 1: Teorie Introduttorie (1886)"},{"key":"26_CR7","doi-asserted-by":"publisher","unstructured":"Chaabouni, R., Lipmaa, H., Zhang, B.: A non-interactive range proof with constant communication. In: Keromytis, A.D. (ed.) FC 2012. LNCS, vol. 7397, pp. 179\u2013199. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32946-3_14","DOI":"10.1007\/978-3-642-32946-3_14"},{"key":"26_CR8","doi-asserted-by":"publisher","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th Annual Symposium on Foundations of Computer Science (SFCS 1985), October 1985. https:\/\/doi.org\/10.1109\/SFCS.1985.64","DOI":"10.1109\/SFCS.1985.64"},{"key":"26_CR9","doi-asserted-by":"publisher","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6) (1976). https:\/\/doi.org\/10.1109\/TIT.1976.1055638","DOI":"10.1109\/TIT.1976.1055638"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Dwork, C.: Differential Privacy, vol.\u00a04052 (2006)","DOI":"10.1007\/11787006_1"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-319-68637-0_23","volume-title":"Provable Security","author":"N Fazio","year":"2017","unstructured":"Fazio, N., Gennaro, R., Jafarikhah, T., Skeith, W.E.: Homomorphic secret sharing from paillier encryption. In: Okamoto, T., Yu, Y., Au, M.H., Li, Y. (eds.) ProvSec 2017. LNCS, vol. 10592, pp. 381\u2013399. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68637-0_23"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"26_CR13","unstructured":"Ghodsi, Z., Gu, T., Garg, S.: SafetyNets: verifiable execution of deep neural networks on an untrusted cloud. In: Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017 (2017)"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11832072_16","volume-title":"Security and Cryptography for Networks","author":"SD Gordon","year":"2006","unstructured":"Gordon, S.D., Katz, J.: Rational secret sharing, revisited. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 229\u2013241. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11832072_16"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Hitaj, B., Ateniese, G., P\u00e9rez-Cruz, F.: Deep models under the GAN: information leakage from collaborative deep learning. In: Proceedings of CCS (2017)","DOI":"10.1145\/3133956.3134012"},{"issue":"177","key":"26_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-48329-2_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"H Krawczyk","year":"1994","unstructured":"Krawczyk, H.: Secret sharing made short. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 136\u2013146. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_12"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-030-03332-3_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"RWF Lai","year":"2018","unstructured":"Lai, R.W.F., Malavolta, G., Schr\u00f6der, D.: Homomorphic secret sharing for low degree polynomials. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 279\u2013309. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_11"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-89500-0_23","volume-title":"Information and Communications Security","author":"K Li","year":"2018","unstructured":"Li, K., Yang, R., Au, M.H., Xu, Q.: Practical range proof for cryptocurrency Monero with provable security. In: Qing, S., Mitchell, C., Chen, L., Liu, D. (eds.) ICICS 2017. LNCS, vol. 10631, pp. 255\u2013262. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89500-0_23"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Liu, Y., et al.: Trojaning attack on neural networks. In: 25th Annual Network and Distributed System Security Symposium, NDSS (2018)","DOI":"10.14722\/ndss.2018.23291"},{"key":"26_CR21","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., Arcas, B.A.: Communication-efficient learning of deep networks from decentralized data. In: Proceedings of AISTATS (2017)"},{"key":"26_CR22","doi-asserted-by":"publisher","unstructured":"Peng, K., Bao, F.: An efficient range proof scheme. In: 2010 IEEE Second International Conference on Social Computing, August 2010. https:\/\/doi.org\/10.1109\/SocialCom.2010.125","DOI":"10.1109\/SocialCom.2010.125"},{"issue":"5","key":"26_CR23","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/TIFS.2017.2787987","volume":"13","author":"LT Phong","year":"2018","unstructured":"Phong, L.T., Aono, Y., Hayashi, T., Wang, L., Moriai, S.: Privacy-preserving deep learning via additively homomorphic encryption. IEEE Trans Inf. Forensics Secur. 13(5), 1333\u20131345 (2018)","journal-title":"IEEE Trans Inf. Forensics Secur."},{"issue":"4","key":"26_CR24","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s001450010010","volume":"13","author":"JM Pollard","year":"2000","unstructured":"Pollard, J.M.: Kangaroos, monopoly and discrete logarithms. J. Cryptol. 13(4), 437\u2013447 (2000). https:\/\/doi.org\/10.1007\/s001450010010","journal-title":"J. Cryptol."},{"key":"26_CR25","unstructured":"Segal, A., et al.: Practical secure aggregation for privacy-preserving machine learning. In: CCS (2017)"},{"issue":"11","key":"26_CR26","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"26_CR27","doi-asserted-by":"publisher","unstructured":"Shokri, R., Shmatikov, V.: Privacy-preserving deep learning. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (2015). https:\/\/doi.org\/10.1145\/2810103.2813687","DOI":"10.1145\/2810103.2813687"},{"key":"26_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"M Stadler","year":"1996","unstructured":"Stadler, M.: Publicly verifiable secret sharing. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 190\u2013199. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_17"},{"key":"26_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-03168-7_11","volume-title":"Privacy Enhancing Technologies","author":"B Thompson","year":"2009","unstructured":"Thompson, B., Haber, S., Horne, W.G., Sander, T., Yao, D.: Privacy-preserving computation and verification of aggregate queries on outsourced databases. In: Goldberg, I., Atallah, M.J. (eds.) PETS 2009. LNCS, vol. 5672, pp. 185\u2013201. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03168-7_11"},{"key":"26_CR30","unstructured":"Tram\u00e8r, F., Boneh, D.: Slalom: fast, verifiable and private execution of neural networks in trusted hardware. In: Proceedings of ICLR (2019)"},{"issue":"3","key":"26_CR31","doi-asserted-by":"publisher","first-page":"25","DOI":"10.3390\/cryptography4030025","volume":"4","author":"G Tsaloli","year":"2020","unstructured":"Tsaloli, G., Banegas, G., Mitrokotsa, A.: Practical and provably secure distributed aggregation: verifiable additive homomorphic secret sharing. Cryptogr. 4(3), 25 (2020). https:\/\/doi.org\/10.3390\/cryptography4030025","journal-title":"Cryptogr."},{"key":"26_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-030-01446-9_3","volume-title":"Provable Security","author":"G Tsaloli","year":"2018","unstructured":"Tsaloli, G., Liang, B., Mitrokotsa, A.: Verifiable homomorphic secret sharing. In: Baek, J., Susilo, W., Kim, J. (eds.) ProvSec 2018. LNCS, vol. 11192, pp. 40\u201355. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01446-9_3"},{"key":"26_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-40921-0_7","volume-title":"Information Security and Cryptology \u2013 ICISC 2019","author":"G Tsaloli","year":"2020","unstructured":"Tsaloli, G., Mitrokotsa, A.: Sum it up: verifiable additive homomorphic secret sharing. In: Seo, J.H. (ed.) ICISC 2019. LNCS, vol. 11975, pp. 115\u2013132. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40921-0_7"},{"key":"26_CR34","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/TIFS.2019.2929409","volume":"15","author":"G Xu","year":"2020","unstructured":"Xu, G., Li, H., Liu, S., Yang, K., Lin, X.: VerifyNet: secure and verifiable federated learning. IEEE Trans Inf. Forensics Secur. 15, 911\u2013926 (2020)","journal-title":"IEEE Trans Inf. Forensics Secur."},{"key":"26_CR35","doi-asserted-by":"crossref","unstructured":"Xu, W., Evans, D., Qi, Y.: Feature squeezing: detecting adversarial examples in deep neural networks. In: 25th Annual Network and Distributed System Security Symposium, NDSS 2018, San Diego, California, USA, 18\u201321 February 2018 (2018)","DOI":"10.14722\/ndss.2018.23198"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90567-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T18:11:05Z","timestamp":1635963065000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90567-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030905668","9783030905675"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90567-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perth, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acisp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/data61dsslab.github.io\/acisp2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"157","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}