{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T15:32:07Z","timestamp":1784820727571,"version":"3.55.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T00:00:00Z","timestamp":1759968000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T00:00:00Z","timestamp":1759968000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007065","name":"Universit\u00e0 degli Studi di Salerno","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007065","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In Federated Learning (FL) clients collaboratively train a Machine Learning (ML) model by sharing updates computed over their private data. These updates are aggregated to form a global model, which requires clients to trust the central server. However, clients have no direct means to verify whether their updates were incorporated into the global model. This lack of transparency raises challenges that may discourage participation in the federation. For instance, a malicious server might exclude legitimate clients to deny them rewards or recognition. Even in benign scenarios, updates may be disregarded due to network failures or predefined aggregation conditions (e.g., a quorum). This highlights the need for mechanisms that let clients independently verify their inclusion. To this specific purpose, we propose a novel approach called Membership Proof in Federated Learning (MPFL), which enables client-side verifiability of participation. In MPFL, model updates are aggregated via a smart contract, which also generates a unique cryptographic proof of participation for each update by using cryptographic accumulators. By leveraging blockchain and smart contracts, our approach enhances system trustworthiness, while cryptographic proofs provide an efficient and privacy-preserving method for clients to verify inclusion. In addition, the paper reports on how we have implemented MPFL and extensively evaluated it across three diverse datasets and ML architectures, thus demonstrating its effectiveness and practical viability.<\/jats:p>","DOI":"10.1007\/s10586-025-05668-4","type":"journal-article","created":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:56:45Z","timestamp":1760032605000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["I Trained That! Client-Side Proof of Participation in Federated Learning"],"prefix":"10.1007","volume":"28","author":[{"given":"Carlo","family":"Mazzocca","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alessio","family":"Mora","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicol\u00f2","family":"Romandini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rebecca","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paolo","family":"Bellavista","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,9]]},"reference":[{"key":"5668_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1016\/j.neucom.2017.01.026","volume":"237","author":"L Zhou","year":"2017","unstructured":"Zhou, L., Pan, S., Wang, J., Vasilakos, A.V.: Machine learning on big data: opportunities and challenges. Neurocomputing 237, 350\u2013361 (2017). https:\/\/doi.org\/10.1016\/j.neucom.2017.01.026","journal-title":"Neurocomputing"},{"issue":"1","key":"5668_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3429252","volume":"54","author":"P Bellavista","year":"2021","unstructured":"Bellavista, P., Foschini, L., Mora, A.: Decentralised learning in federated deployment environments: a system-level survey. ACM Comput. Surv. 54(1), 1\u201338 (2021). https:\/\/doi.org\/10.1145\/3429252","journal-title":"ACM Comput. Surv."},{"key":"5668_CR3","doi-asserted-by":"publisher","unstructured":"Zhou, Z., Chu, L., Liu, C., Wang, L., Pei, J., Zhang, Y.: Towards Fair Federated Learning. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. KDD \u201921, pp. 4100\u20134101. Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3447548.3470814","DOI":"10.1145\/3447548.3470814"},{"issue":"2","key":"5668_CR4","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1109\/TETC.2021.3063517","volume":"10","author":"Y Zhan","year":"2022","unstructured":"Zhan, Y., Zhang, J., Hong, Z., Wu, L., Li, P., Guo, S.: A survey of incentive mechanism design for federated learning. IEEE Trans. Emerg. Top. Comput. 10(2), 1035\u20131044 (2022). https:\/\/doi.org\/10.1109\/TETC.2021.3063517","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"key":"5668_CR5","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.future.2020.10.007","volume":"115","author":"V Mothukuri","year":"2021","unstructured":"Mothukuri, V., Parizi, R.M., Pouriyeh, S., Huang, Y., Dehghantanha, A., Srivastava, G.: A survey on security and privacy of federated learning. Futur. Gener. Comput. Syst. 115, 619\u2013640 (2021). https:\/\/doi.org\/10.1016\/j.future.2020.10.007","journal-title":"Futur. Gener. Comput. Syst."},{"key":"5668_CR6","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). https:\/\/doi.org\/10.1109\/TIFS.2019.2929409","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"24","key":"5668_CR7","doi-asserted-by":"publisher","first-page":"21410","DOI":"10.1109\/JIOT.2023.3289832","volume":"10","author":"AP Kalapaaking","year":"2023","unstructured":"Kalapaaking, A.P., Khalil, I., Atiquzzaman, M.: Blockchain-enabled and multisignature-powered verifiable model for securing federated learning systems. IEEE Internet Things J. 10(24), 21410\u201321420 (2023). https:\/\/doi.org\/10.1109\/JIOT.2023.3289832","journal-title":"IEEE Internet Things J."},{"issue":"1","key":"5668_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1109\/TNSE.2021.3050781","volume":"9","author":"Z Peng","year":"2022","unstructured":"Peng, Z., Xu, J., Chu, X., Gao, S., Yao, Y., Gu, R., Tang, Y.: VFChain: enabling verifiable and auditable federated learning via blockchain systems. IEEE Transactions on Network Science and Engineering 9(1), 173\u2013186 (2022). https:\/\/doi.org\/10.1109\/TNSE.2021.3050781","journal-title":"IEEE Transactions on Network Science and Engineering"},{"key":"5668_CR9","doi-asserted-by":"publisher","unstructured":"Mazzocca, C., Mora, A., Romandini, N., Montanari, R., Bellavista, P.: Membership Proof in Federated Learning via Cryptographic Accumulators. In: 2024 6th International Conference on Blockchain Computing and Applications (BCCA), pp. 57\u201363 (2024). https:\/\/doi.org\/10.1109\/BCCA62388.2024.10844447","DOI":"10.1109\/BCCA62388.2024.10844447"},{"key":"5668_CR10","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-95312-6_17","volume-title":"Topics in Cryptology - CT-RSA 2022","author":"G Vitto","year":"2022","unstructured":"Vitto, G., Biryukov, A.: Dynamic universal accumulator with batch update over bilinear groups. In: Galbraith, S.D. (ed.) Topics in Cryptology - CT-RSA 2022, pp. 395\u2013426. Springer, Cham (2022)"},{"key":"5668_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.future.2023.10.014","volume":"152","author":"C Mazzocca","year":"2024","unstructured":"Mazzocca, C., Romandini, N., Montanari, R., Bellavista, P.: Enabling Federated Learning at the Edge through the IOTA Tangle. Futur. Gener. Comput. Syst. 152, 17\u201329 (2024). https:\/\/doi.org\/10.1016\/j.future.2023.10.014","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"16","key":"5668_CR12","doi-asserted-by":"publisher","first-page":"12806","DOI":"10.1109\/JIOT.2021.3072611","volume":"8","author":"DC Nguyen","year":"2021","unstructured":"Nguyen, D.C., Ding, M., Pham, Q.-V., Pathirana, P.N., Le, L.B., Seneviratne, A., Li, J., Niyato, D., Poor, H.V.: Federated learning meets blockchain in edge computing: opportunities and challenges. IEEE Internet Things J. 8(16), 12806\u201312825 (2021). https:\/\/doi.org\/10.1109\/JIOT.2021.3072611","journal-title":"IEEE Internet Things J."},{"key":"5668_CR13","doi-asserted-by":"publisher","first-page":"61048","DOI":"10.1109\/ACCESS.2021.3072849","volume":"9","author":"MNM Bhutta","year":"2021","unstructured":"Bhutta, M.N.M., Khwaja, A.A., Nadeem, A., Ahmad, H.F., Khan, M.K., Hanif, M.A., Song, H., Alshamari, M., Cao, Y.: A survey on blockchain technology: evolution, architecture and security. IEEE Access 9, 61048\u201361073 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3072849","journal-title":"IEEE Access"},{"issue":"4","key":"5668_CR14","doi-asserted-by":"publisher","first-page":"2858","DOI":"10.1109\/TII.2021.3116049","volume":"18","author":"L Wang","year":"2021","unstructured":"Wang, L., Tian, Y., Zhang, D.: Toward cross-domain dynamic accumulator authentication based on blockchain in internet of things. IEEE Trans. Industr. Inf. 18(4), 2858\u20132867 (2021)","journal-title":"IEEE Trans. Industr. Inf."},{"key":"5668_CR15","doi-asserted-by":"crossref","unstructured":"Kumar, A., Lafourcade, P., Lauradoux, C.: Performances of cryptographic accumulators. In: 39th Annual IEEE Conference on Local Computer Networks, pp. 366\u2013369 (2014). IEEE","DOI":"10.1109\/LCN.2014.6925793"},{"key":"5668_CR16","unstructured":"McMahan, H.B., et al.: Communication-efficient Learning of Deep Networks from Decentralized Data. arXiv preprint arXiv:1602.05629 (2016)"},{"issue":"2","key":"5668_CR17","first-page":"1035","volume":"10","author":"Y Zhan","year":"2021","unstructured":"Zhan, Y., Zhang, J., Hong, Z., Wu, L., Li, P., Guo, S.: A survey of incentive mechanism design for federated learning. IEEE Trans. Emerg. Top. Comput. 10(2), 1035\u20131044 (2021)","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"key":"5668_CR18","doi-asserted-by":"publisher","unstructured":"Romandini, N., Mora, A., Mazzocca, C., Montanari, R., Bellavista, P.: Federated Unlearning: A Survey on Methods, Design Guidelines, and Evaluation Metrics. IEEE Trans. Neural Netw. Learn. Syst, 1\u201321 (2024) https:\/\/doi.org\/10.1109\/TNNLS.2024.3478334","DOI":"10.1109\/TNNLS.2024.3478334"},{"key":"5668_CR19","doi-asserted-by":"crossref","unstructured":"Sun, Q., Li, X., Zhang, J., Xiong, L., Liu, W., Liu, J., Qin, Z., Ren, K.: Shapleyfl: robust federated learning based on shapley value. In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2096\u20132108 (2023)","DOI":"10.1145\/3580305.3599500"},{"key":"5668_CR20","doi-asserted-by":"crossref","unstructured":"Xue, Y., Niu, C., Zheng, Z., Tang, S., Lyu, C., Wu, F., Chen, G.: Toward understanding the influence of individual clients in federated learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, 35, 10560\u201310567 (2021)","DOI":"10.1609\/aaai.v35i12.17263"},{"key":"5668_CR21","unstructured":"Poirot, M.G., Vepakomma, P., Chang, K., Kalpathy-Cramer, J., Gupta, R., Raskar, R.: Split learning for collaborative deep learning in healthcare. arXiv preprint arXiv:1912.12115 (2019)"},{"key":"5668_CR22","unstructured":"Li, D., Wang, J.: Fedmd: heterogenous federated learning via model distillation. arXiv preprint arXiv:1910.03581 (2019)"},{"key":"5668_CR23","unstructured":"Jeong, E., Oh, S., Kim, H., Park, J., Bennis, M., Kim, S.-L.: Communication-efficient on-device machine learning: Federated distillation and augmentation under non-iid private data. arXiv preprint arXiv:1811.11479 (2018)"},{"key":"5668_CR24","unstructured":"MMw-Unibo: MPFL: Membership Proof in Federated Learning via Cryptographic Accumulators. https:\/\/github.com\/MMw-Unibo\/MPFL. Accessed 14 Jul 2024 (2024)"},{"key":"5668_CR25","unstructured":"Xiao, H., Rasul, K., Vollgraf, R.: Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms. CoRR arXiv:1708.07747 (2017)"},{"key":"5668_CR26","unstructured":"Krizhevsky, A.: Learning multiple layers of features from tiny images. Technical report (2009)"},{"key":"5668_CR27","doi-asserted-by":"crossref","unstructured":"Sandler, M., Howard, A., Zhu, M., Zhmoginov, A., Chen, L.-C.: Mobilenetv2: Inverted residuals and linear bottlenecks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2018)","DOI":"10.1109\/CVPR.2018.00474"},{"key":"5668_CR28","unstructured":"Tan, M., Le, Q.: Efficientnetv2: Smaller models and faster training. In: International Conference on Machine Learning, pp. 10096\u201310106 (2021). PMLR"},{"key":"5668_CR29","doi-asserted-by":"crossref","unstructured":"Camacho, P., Hevia, A.: On the impossibility of batch update for cryptographic accumulators. In: Progress in Cryptology\u2013LATINCRYPT 2010: First International Conference on Cryptology and Information Security in Latin America, Puebla, Mexico, August 8-11, 2010, Proceedings 1, pp. 178\u2013188 (2010). Springer","DOI":"10.1007\/978-3-642-14712-8_11"},{"key":"5668_CR30","unstructured":"Bonawitz, K., Eichner, H., Grieskamp, W., Huba, D., Ingerman, A., Ivanov, V., Kiddon, C., Kone\u010dn\u00fd, J., Mazzocchi, S., McMahan, B., Van\u00a0Overveldt, T., Petrou, D., Ramage, D., Roselander, J.: Towards Federated Learning at Scale: System Design. In: Talwalkar, A., Smith, V., Zaharia, M. (eds.) Proceedings of Machine Learning and Systems, 1, 374\u2013388 (2019). https:\/\/proceedings.mlsys.org\/paper_files\/paper\/2019\/file\/7b770da633baf74895be22a8807f1a8f-Paper.pdf"},{"key":"5668_CR31","doi-asserted-by":"publisher","first-page":"5429195","DOI":"10.1155\/2022\/5429195","volume":"2022","author":"Y Ren","year":"2022","unstructured":"Ren, Y., Liu, X., Wu, Q., Wang, L., Zhang, W.: Cryptographic accumulator and its application: a survey. Secur. Commun. Netw. 2022, 5429195 (2022). https:\/\/doi.org\/10.1155\/2022\/5429195","journal-title":"Secur. Commun. Netw."},{"key":"5668_CR32","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.ins.2021.05.077","volume":"576","author":"C Jiang","year":"2021","unstructured":"Jiang, C., Xu, C., Zhang, Y.: PFLM: privacy-preserving federated learning with membership proof. Inf. Sci. 576, 288\u2013311 (2021). https:\/\/doi.org\/10.1016\/j.ins.2021.05.077","journal-title":"Inf. Sci."},{"issue":"24","key":"5668_CR33","doi-asserted-by":"publisher","first-page":"40771","DOI":"10.1109\/JIOT.2024.3454087","volume":"11","author":"Y Xiao","year":"2024","unstructured":"Xiao, Y., Xu, L., Wu, Y., Sun, J., Zhu, L.: PrSeFL: achieving practical privacy and robustness in blockchain-based federated learning. IEEE Internet Things J. 11(24), 40771\u201340786 (2024). https:\/\/doi.org\/10.1109\/JIOT.2024.3454087","journal-title":"IEEE Internet Things J."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05668-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-025-05668-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05668-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T11:47:40Z","timestamp":1764071260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-025-05668-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,9]]},"references-count":33,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["5668"],"URL":"https:\/\/doi.org\/10.1007\/s10586-025-05668-4","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,9]]},"assertion":[{"value":"29 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that there are no financial or non-financial conflicts of interest related to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"This research did not involve human participants or animals.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Research involving Human Participants and\/or Animals"}},{"value":"Not applicable. The study exclusively uses publicly available datasets for evaluation, and no personal or sensitive data were collected or processed.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"942"}}