{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:49:28Z","timestamp":1773229768799,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T00:00:00Z","timestamp":1768435200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T00:00:00Z","timestamp":1771200000000},"content-version":"vor","delay-in-days":32,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s44443-025-00426-3","type":"journal-article","created":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T16:05:54Z","timestamp":1768493154000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Privacy-preserving transfer learning via one-time encrypted data filtering"],"prefix":"10.1007","volume":"38","author":[{"given":"Chao","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,15]]},"reference":[{"key":"426_CR1","doi-asserted-by":"crossref","unstructured":"Albrecht M et al (2021) Homomorphic encryption standard. In: Lauter K, Dai W, Laine K (eds) Protecting privacy through homomorphic encryption. Springer International Publishing, Cham, pp 31\u201362","DOI":"10.1007\/978-3-030-77287-1_2"},{"key":"426_CR2","doi-asserted-by":"crossref","unstructured":"Badawi AA et al (2022) OpenFHE: open-source fully homomorphic encryption library, in proceedings of the 10th workshop on encrypted computing & applied homomorphic cryptography. Association for Computing Machinery: Los Angeles, CA, USA, p 53\u201363","DOI":"10.1145\/3560827.3563379"},{"issue":"3","key":"426_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V (2014) Fully homomorphic encryption without bootstrapping. JAToCT 6(3):1\u201336. https:\/\/doi.org\/10.1145\/2633600","journal-title":"JAToCT"},{"key":"426_CR4","doi-asserted-by":"crossref","unstructured":"Cheon JH (2018) Bootstrapping for Approximate Homomorphic Encryption. Springer International Publishing, Cham","DOI":"10.1007\/978-3-319-78381-9_14"},{"key":"426_CR5","doi-asserted-by":"publisher","unstructured":"Cheon JH et al (2017) Homomorphic encryption for arithmetic of approximate numbers. in International conference on the theory and application of cryptology and information security. Springer. https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"426_CR6","doi-asserted-by":"publisher","unstructured":"Coleman C et al (2019) Selection via proxy: Efficient data selection for deep learning. https:\/\/doi.org\/10.48550\/arXiv.1906.11829","DOI":"10.48550\/arXiv.1906.11829"},{"key":"426_CR7","doi-asserted-by":"publisher","unstructured":"Coucke A et al (2018) Snips Voice Platform: an embedded Spoken Language Understanding system for private-by-design voice interfaces. arXiv:1805.10190. https:\/\/doi.org\/10.48550\/arXiv.1805.10190","DOI":"10.48550\/arXiv.1805.10190"},{"key":"426_CR8","unstructured":"Crockett EJCeA (2020) A low-depth homomorphic circuit for logistic regression model training. https:\/\/eprint.iacr.org\/2020\/1483"},{"issue":"6","key":"426_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/MSP.2012.2211477","volume":"29","author":"L Deng","year":"2012","unstructured":"Deng L (2012) The MNIST database of handwritten digit images for machine learning research [Best of the Web]. IEEE Signal Process Mag 29(6):141\u2013142. https:\/\/doi.org\/10.1109\/MSP.2012.2211477","journal-title":"IEEE Signal Process Mag"},{"key":"426_CR10","doi-asserted-by":"publisher","unstructured":"Dixon MF, Halperin I, Bilokon P (2020) Machine learning in finance. Vol. 1170, Springer. https:\/\/doi.org\/10.1007\/978-3-030-41068-1","DOI":"10.1007\/978-3-030-41068-1"},{"key":"426_CR11","doi-asserted-by":"publisher","unstructured":"Dosovitskiy A et al (2020) An image is worth 16x16 words: transformers for image recognition at scale. 2020. https:\/\/doi.org\/10.48550\/arXiv.2010.11929","DOI":"10.48550\/arXiv.2010.11929"},{"key":"426_CR12","unstructured":"Face Mask Detection (2021). https:\/\/github.com\/AIZOOTech\/FaceMaskDetection"},{"key":"426_CR13","doi-asserted-by":"publisher","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. in Proceedings of the forty-first annual ACM symposium on Theory of computing. 2009. https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"426_CR14","doi-asserted-by":"publisher","unstructured":"Gentry C, Sahai A, Waters B (2013) Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. in Annual cryptology conference. Springer. https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"426_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of cryptography, volume 2","author":"O Goldreich","year":"2004","unstructured":"Goldreich O (2004) Foundations of cryptography, volume 2. Cambridge University Press, Cambridge"},{"key":"426_CR16","doi-asserted-by":"publisher","unstructured":"Iyer R et al (2020) Submodular combinatorial information measures with applications in machine learning. https:\/\/doi.org\/10.48550\/arXiv.2006.15412","DOI":"10.48550\/arXiv.2006.15412"},{"key":"426_CR17","unstructured":"Katharopoulos A, Fleuret F (2018) Not all samples are created equal: deep learning with importance sampling, in Proceedings of the 35th International Conference on Machine Learning. In: Jennifer D, Andreas K (eds) PMLR: Proceedings of Machine Learning Research. p 2525--2534"},{"key":"426_CR18","doi-asserted-by":"publisher","unstructured":"Killamsetty K et al (2021) GRAD-MATCH: gradient matching based data subset selection for efficient deep model training. https:\/\/doi.org\/10.48550\/arXiv.2103.00123","DOI":"10.48550\/arXiv.2103.00123"},{"key":"426_CR19","unstructured":"Krizhevsky A (2009) Learning multiple layers of features from tiny images"},{"issue":"6","key":"426_CR20","doi-asserted-by":"publisher","first-page":"3711","DOI":"10.1109\/TDSC.2021.3105111","volume":"19","author":"E Lee","year":"2022","unstructured":"Lee E et al (2022) Minimax approximation of sign function by composite polynomial for homomorphic comparison. IEEE Trans Depend Secure Comput 19(6):3711\u20133727. https:\/\/doi.org\/10.1109\/TDSC.2021.3105111","journal-title":"IEEE Trans Depend Secure Comput"},{"key":"426_CR21","unstructured":"Lee S et al (2023) HETAL: Efficient Privacy-preserving transfer learning with homomorphic Encryption, in proceedings of the 40th international conference on machine learning. In: Andreas K et al (eds) PMLR: proceedings of machine learning research, p 19010--19035"},{"key":"426_CR22","doi-asserted-by":"publisher","unstructured":"Lou Q et al (2020) Glyph: fast and accurately training deep neural networks on encrypted data. 33:9193\u20139202. https:\/\/doi.org\/10.48550\/arXiv.1911.07101","DOI":"10.48550\/arXiv.1911.07101"},{"key":"426_CR23","doi-asserted-by":"publisher","unstructured":"Mohassel P, Zhang Y (2017) Secureml: a system for scalable privacy-preserving machine learning. in 2017 IEEE symposium on security and privacy (SP). IEEE. https:\/\/doi.org\/10.1109\/SP.2017.12","DOI":"10.1109\/SP.2017.12"},{"key":"426_CR24","doi-asserted-by":"crossref","unstructured":"Mohassel P, Rindal P (2018) ABY3: a mixed protocol framework for machine learning, in proceedings of the 2018 ACM SIGSAC conference on computer and communications security. Association for Computing Machinery: Toronto, Canada. p 35\u201352","DOI":"10.1145\/3243734.3243760"},{"key":"426_CR25","doi-asserted-by":"crossref","unstructured":"Panda S (2022) Polynomial Approximation of Inverse sqrt Function for FHE. Springer International Publishing, Cham","DOI":"10.1007\/978-3-031-07689-3_27"},{"key":"426_CR26","unstructured":"Paul M, Ganguli S, Dziugaite GK (2021) Deep learning on a data diet: finding important examples early in training, in Proceedings of the 35th international conference on neural information processing systems. Curran Associates Inc. Article 1575"},{"key":"426_CR27","doi-asserted-by":"publisher","unstructured":"Qu H, Xu GJAaS (n.d.) Improvements of homomorphic evaluation of inverse square root. https:\/\/doi.org\/10.2139\/ssrn.4258571","DOI":"10.2139\/ssrn.4258571"},{"issue":"1","key":"426_CR28","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1146\/annurev-bioeng-071516-044442","volume":"19","author":"D Shen","year":"2017","unstructured":"Shen D, Wu G, Suk H-I (2017) Deep learning in medical image analysis. Annu Rev Biomed Eng 19(1):221\u2013248. https:\/\/doi.org\/10.1146\/annurev-bioeng-071516-044442","journal-title":"Annu Rev Biomed Eng"},{"issue":"1","key":"426_CR29","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-012-9720-4","volume":"71","author":"NP Smart","year":"2014","unstructured":"Smart NP, Vercauteren F (2014) Fully homomorphic SIMD operations. Des Codes Cryptogr 71(1):57\u201381. https:\/\/doi.org\/10.1007\/s10623-012-9720-4","journal-title":"Des Codes Cryptogr"},{"key":"426_CR30","doi-asserted-by":"publisher","unstructured":"Song K et al (2020) MPNet: Masked and Permuted Pre-training for Language Understanding. https:\/\/doi.org\/10.48550\/arXiv.2004.09297","DOI":"10.48550\/arXiv.2004.09297"},{"key":"426_CR31","doi-asserted-by":"publisher","unstructured":"Toneva M et al (2018) An empirical study of example forgetting during deep neural network learning. https:\/\/doi.org\/10.48550\/arXiv.1812.05159","DOI":"10.48550\/arXiv.1812.05159"},{"key":"426_CR32","doi-asserted-by":"publisher","unstructured":"Wagh S et al (2020) Falcon: Honest-majority maliciously secure framework for private deep learning. https:\/\/doi.org\/10.48550\/arXiv.2004.02229","DOI":"10.48550\/arXiv.2004.02229"},{"key":"426_CR33","unstructured":"Watson J-L, Wagh S, Popa RA (2022) Piranha: A {GPU} platform for secure computation. in 31st USENIX Security Symposium (USENIX Security 22)"},{"key":"426_CR34","doi-asserted-by":"publisher","unstructured":"Yang J et al (2021) MedMNIST v2 -- A large-scale lightweight benchmark for 2D and 3D biomedical image classification. https:\/\/doi.org\/10.48550\/arXiv.2110.14795","DOI":"10.48550\/arXiv.2110.14795"},{"key":"426_CR35","doi-asserted-by":"publisher","unstructured":"Zhang Y et al (2024) Heprune: Fast private training of deep neural networks with encrypted data pruning. 37:51063\u201351084. https:\/\/doi.org\/10.5555\/3737916.3739532","DOI":"10.5555\/3737916.3739532"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00426-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00426-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00426-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:39:50Z","timestamp":1773153590000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00426-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,15]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["426"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00426-3","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,15]]},"assertion":[{"value":"7 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"67"}}