{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:09:29Z","timestamp":1775470169012,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031666933","type":"print"},{"value":"9783031666940","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-66694-0_15","type":"book-chapter","created":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T06:09:21Z","timestamp":1724306961000},"page":"238-258","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Secure Coalition Formation for\u00a0Federated Machine Learning"],"prefix":"10.1007","author":[{"given":"Subhasis","family":"Thakur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Breslin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,21]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Bhalgat, A., Chakraborty, T., Khanna, S.: Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games. In: Proceedings of the 11th ACM Conference on Electronic Commerce. EC 2010, Association for Computing Machinery, New York, NY, USA, pp. 73\u201382 (2010). https:\/\/doi.org\/10.1145\/1807342.1807353","DOI":"10.1145\/1807342.1807353"},{"key":"15_CR2","unstructured":"Bonawitz, K.A., et al.: Practical secure aggregation for federated learning on user-held data. In: NIPS Workshop on Private Multi-Party Machine Learning (2016). https:\/\/arxiv.org\/abs\/1611.04482"},{"key":"15_CR3","unstructured":"Elkordy, A.R., Avestimehr, A.S.: Secure aggregation with heterogeneous quantization in federated learning. CoRR arXiv:2009.14388 (2020)"},{"key":"15_CR4","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 1986","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":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"15_CR6","unstructured":"Hamer, J., Mohri, M., Suresh, A.T.: FedBoost: a communication-efficient algorithm for federated learning. In: III, H.D., Singh, A. (eds.) Proceedings of the 37th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol.\u00a0119, pp. 3973\u20133983. PMLR (2020). https:\/\/proceedings.mlr.press\/v119\/hamer20a.html"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Jeon, B., Ferdous, S.M., Rahman, M.R., Walid, A.: Privacy-preserving decentralized aggregation for federated learning. CoRR arXiv:2012.07183 (2020)","DOI":"10.1109\/INFOCOMWKSHPS51825.2021.9484437"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Li, T., Sahu, A.K., Talwalkar, A., Smith, V.: Federated learning: challenges, methods, and future directions. IEEE Signal Process. Mag. 37, 50\u201360 (2019). https:\/\/api.semanticscholar.org\/CorpusID:201126242","DOI":"10.1109\/MSP.2020.2975749"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-42033-7_3","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"H Lipmaa","year":"2013","unstructured":"Lipmaa, H.: Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8269, pp. 41\u201360. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42033-7_3"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/TWC.2022.3190512","volume":"22","author":"L Liu","year":"2023","unstructured":"Liu, L., Zhang, J., Song, S., Letaief, K.B.: Hierarchical federated learning with quantization: convergence analysis and system design. IEEE Trans. Wireless Commun. 22(1), 2\u201318 (2023). https:\/\/doi.org\/10.1109\/TWC.2022.3190512","journal-title":"IEEE Trans. Wireless Commun."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Lyu, L., Yu, H., Yang, Q.: Threats to federated learning: a survey. CoRR arXiv:2003.02133 (2020)","DOI":"10.1007\/978-3-030-63076-8_1"},{"key":"15_CR13","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., Arcas, B.A.Y.: Communication-efficient learning of deep networks from decentralized data. In: Singh, A., Zhu, J. (eds.) Proceedings of the 20th International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol.\u00a054, pp. 1273\u20131282. PMLR (2017). https:\/\/proceedings.mlr.press\/v54\/mcmahan17a.html"},{"key":"15_CR14","doi-asserted-by":"publisher","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. In: 2013 IEEE Symposium on Security and Privacy, pp. 238\u2013252 (2013). https:\/\/doi.org\/10.1109\/SP.2013.47","DOI":"10.1109\/SP.2013.47"},{"key":"15_CR15","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. IACR Cryptol. ePrint Arch. 2005, 187 (2005). https:\/\/api.semanticscholar.org\/CorpusID:15222660"},{"key":"15_CR16","unstructured":"Reddi, S., et al.: Adaptive federated optimization. arXiv:2003.00295 (2021)"},{"key":"15_CR17","doi-asserted-by":"publisher","unstructured":"Savazzi, S., Nicoli, M., Rampa, V., Kianoush, S.: Federated learning with mutually cooperating devices: a consensus approach towards server-less model optimization. In: ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 3937\u20133941 (2020). https:\/\/doi.org\/10.1109\/ICASSP40776.2020.9054055","DOI":"10.1109\/ICASSP40776.2020.9054055"},{"key":"15_CR18","unstructured":"Segal, A., et al.: Practical secure aggregation for privacy-preserving machine learning. In: CCS (2017). https:\/\/eprint.iacr.org\/2017\/281.pdf"},{"key":"15_CR19","doi-asserted-by":"publisher","unstructured":"Tang, X., Yu, H.: Competitive-cooperative multi-agent reinforcement learning for auction-based federated learning. In: Elkind, E. (ed.) Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI-23, pp. 4262\u20134270. International Joint Conferences on Artificial Intelligence Organization (2023). https:\/\/doi.org\/10.24963\/ijcai.2023\/474","DOI":"10.24963\/ijcai.2023\/474"},{"key":"15_CR20","unstructured":"Wang, H., Yurochkin, M., Sun, Y., Papailiopoulos, D.S., Khazaeni, Y.: Federated learning with matched averaging. CoRR arXiv:2002.06440 (2020)"},{"key":"15_CR21","unstructured":"Wei, K., et al.: Federated learning with differential privacy: algorithms and performance analysis. arXiv:1911.00222 (2019)"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Xiang, W.T., Shao, M., Fu, Y., Jia, R., Lin, F., Zheng, Z.: Federated learning framework based on trimmed mean aggregation rules (2022). https:\/\/openreview.net\/forum?id=AUszBTiYBB6","DOI":"10.2139\/ssrn.4181353"},{"issue":"05","key":"15_CR23","doi-asserted-by":"publisher","first-page":"3329","DOI":"10.1109\/TDSC.2021.3093711","volume":"19","author":"L Zhao","year":"2022","unstructured":"Zhao, L., Jiang, J., Feng, B., Wang, Q., Shen, C., Li, Q.: Sear: secure and efficient aggregation for byzantine-robust federated learning. IEEE Trans. Dependable Secure Comput. 19(05), 3329\u20133342 (2022). https:\/\/doi.org\/10.1109\/TDSC.2021.3093711","journal-title":"IEEE Trans. Dependable Secure Comput."}],"container-title":["Communications in Computer and Information Science","Deep Learning Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-66694-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T06:12:43Z","timestamp":1724307163000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66694-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031666933","9783031666940"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66694-0_15","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"21 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DeLTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Deep Learning Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dijon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"delta2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/delta.scitevents.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}