{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T21:11:18Z","timestamp":1771535478591,"version":"3.50.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T00:00:00Z","timestamp":1731283200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T00:00:00Z","timestamp":1731283200000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s11704-024-3936-0","type":"journal-article","created":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T09:19:19Z","timestamp":1731316759000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards practical data alignment in production federated learning"],"prefix":"10.1007","volume":"19","author":[{"given":"Yexuan","family":"Shi","sequence":"first","affiliation":[]},{"given":"Wei","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Yuanyuan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Chunbo","family":"Xue","sequence":"additional","affiliation":[]},{"given":"Yuxiang","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Zimu","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Manxue","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Lun","family":"Xin","sequence":"additional","affiliation":[]},{"given":"Wenjing","family":"Nie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,11]]},"reference":[{"issue":"2","key":"3936_CR1","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/3298981","volume":"10","author":"Q Yang","year":"2019","unstructured":"Yang Q, Liu Y, Chen T, Tong Y. Federated machine learning: concept and applications. ACM Transactions on Intelligent Systems and Technology, 2019, 10(2): 12","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"issue":"5","key":"3936_CR2","doi-asserted-by":"publisher","first-page":"165817","DOI":"10.1007\/s11704-021-0598-z","volume":"16","author":"K Zhang","year":"2022","unstructured":"Zhang K, Song X, Zhang C, Yu S. Challenges and future directions of secure federated learning: a survey. Frontiers of Computer Science, 2022, 16(5): 165817","journal-title":"Frontiers of Computer Science"},{"issue":"1","key":"3936_CR3","doi-asserted-by":"publisher","first-page":"181336","DOI":"10.1007\/s11704-023-3282-7","volume":"18","author":"F Liu","year":"2024","unstructured":"Liu F, Zheng Z, Shi Y, Tong Y, Zhang Y. A survey on federated learning: a perspective from multi-party computation. Frontiers of Computer Science, 2024, 18(1): 181336","journal-title":"Frontiers of Computer Science"},{"key":"3936_CR4","first-page":"818","volume-title":"Proceedings of 2016 ACM SIGSAC Conference on Computer and Communications Security","author":"V Kolesnikov","year":"2016","unstructured":"Kolesnikov V, Kumaresan R, Rosulek M, Trieu N. Efficient batched oblivious PRF with applications to private set intersection. In: Proceedings of 2016 ACM SIGSAC Conference on Computer and Communications Security. 2016, 818\u2013829"},{"key":"3936_CR5","first-page":"34","volume-title":"Proceedings of the 40th Annual International Cryptology Conference on Advances in Cryptology","author":"M Chase","year":"2020","unstructured":"Chase M, Miao P. Private set intersection in the internet setting from lightweight oblivious PRF. In: Proceedings of the 40th Annual International Cryptology Conference on Advances in Cryptology. 2020, 34\u201363"},{"key":"3936_CR6","first-page":"401","volume-title":"Proceedings of the 39th Annual International Cryptology Conference on Advances in Cryptology","author":"B Pinkas","year":"2019","unstructured":"Pinkas B, Rosulek M, Trieu N, Yanai A. SpOT-light: lightweight private set intersection from sparse OT extension. In: Proceedings of the 39th Annual International Cryptology Conference on Advances in Cryptology. 2019, 401\u2013431"},{"key":"3936_CR7","first-page":"1243","volume-title":"Proceedings of 2017 ACM SIGSAC Conference on Computer and Communications Security","author":"H Chen","year":"2017","unstructured":"Chen H, Laine K, Rindal P. Fast private set intersection from homomorphic encryption. In: Proceedings of 2017 ACM SIGSAC Conference on Computer and Communications Security. 2017, 1243\u20131255"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-024-3936-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-024-3936-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-024-3936-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T20:27:57Z","timestamp":1771532877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-024-3936-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,11]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["3936"],"URL":"https:\/\/doi.org\/10.1007\/s11704-024-3936-0","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,11]]},"assertion":[{"value":"21 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Competing interests\n                      The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}],"article-number":"191603"}}