{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:03:35Z","timestamp":1775815415986,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T00:00:00Z","timestamp":1680739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T00:00:00Z","timestamp":1680739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Information and Communication Technology Park","award":["01-99-02-000282"],"award-info":[{"award-number":["01-99-02-000282"]}]},{"name":"Information and Communication Technology Park","award":["01-99-02-000282"],"award-info":[{"award-number":["01-99-02-000282"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s11227-023-05206-2","type":"journal-article","created":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T15:17:48Z","timestamp":1680794268000},"page":"14358-14387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Privacy-preserving multi-party PCA computation on horizontally and vertically partitioned data based on outsourced QR decomposition"],"prefix":"10.1007","volume":"79","author":[{"given":"Mehrad","family":"Jaberi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Mala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,6]]},"reference":[{"issue":"14","key":"5206_CR1","doi-asserted-by":"publisher","first-page":"R656","DOI":"10.1016\/j.cub.2016.05.029","volume":"26","author":"R Pang","year":"2016","unstructured":"Pang R, Lansdell BJ, Fairhall AL (2016) Dimensionality reduction in neuroscience. Curr Biol 26(14):R656\u2013R660","journal-title":"Curr Biol"},{"key":"5206_CR2","doi-asserted-by":"crossref","unstructured":"Zhang Z, Zhao Y (2015) Astronomy in the big data era. Data Sci J, 14(11)","DOI":"10.5334\/dsj-2015-011"},{"key":"5206_CR3","doi-asserted-by":"crossref","unstructured":"Mohammed NN, Ibrahim Khaleel M, Latif M, Khalid Z (2018) Face recognition based on PCA with weighted and normalized Mahalanobis distance. In: 2018 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS), Bangkok, Thailand","DOI":"10.1109\/ICIIBMS.2018.8549971"},{"issue":"6","key":"5206_CR4","doi-asserted-by":"publisher","first-page":"907","DOI":"10.3390\/rs10060907","volume":"10","author":"D B\u00e1scones","year":"2018","unstructured":"B\u00e1scones D, Gonz\u00e1lez C, Mozos D (2018) Hyperspectral Image compression using vector quantization, PCA and JPEG2000. Remote Sens 10(6):907","journal-title":"Remote Sens"},{"issue":"1","key":"5206_CR5","first-page":"61","volume":"8","author":"N Mustafa","year":"2017","unstructured":"Mustafa N, Memon ERA (2017) LI J-P, Omer MZ (2017) A classification model for imbalanced medical data based on PCA and farther distance based synthetic minority oversampling technique. Int J Adv Comput Sci Appl 8(1):61\u201367","journal-title":"Int J Adv Comput Sci Appl"},{"issue":"2","key":"5206_CR6","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1080\/14786440109462720","volume":"6","author":"K Pearson","year":"1901","unstructured":"Pearson K (1901) On lines and planes of closest fit to systems of points in space. Lond Edinb Dublin Philos Mag J Sci 6(2):559\u2013572","journal-title":"Lond Edinb Dublin Philos Mag J Sci"},{"key":"5206_CR7","unstructured":"Papailiopoulos D, Dimakis A, Korokythakis S (2013) Sparse PCA through low-rank approximations. In: Proceedings of the 30th International Conference On Machine Learning, PMLR, vol 28, no 3, pp 747\u2013755"},{"key":"5206_CR8","first-page":"388","volume":"28","author":"A Kundu","year":"2015","unstructured":"Kundu A, Drineas P, Magdon-Ismail M (2015) Approximating sparse PCA from incomplete data. Adv Neural Inf Process Syst 28:388\u2013396","journal-title":"Adv Neural Inf Process Syst"},{"key":"5206_CR9","doi-asserted-by":"crossref","unstructured":"Debhi S, Parmar M (2021) Eigenvector component calculation speedup over NumPy for high-performance computing. In: Proceedings of 6th International Conference on Recent Trends in Computing, LNNS, vol 177, pp 241\u2013249","DOI":"10.1007\/978-981-33-4501-0_23"},{"key":"5206_CR10","unstructured":"Liang Y, Balcan M-F, Kanchanapally V (2013) Distributed PCA and k-means clustering. In: The big learning workshop at advances in neural information processing systems."},{"key":"5206_CR11","doi-asserted-by":"crossref","unstructured":"Gand A, Raja H, Bajwa WU (2019) Fast and communication-efficient distributed Pca. In: 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","DOI":"10.1109\/ICASSP.2019.8683095"},{"issue":"3","key":"5206_CR12","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1016\/j.patcog.2011.09.002","volume":"45","author":"Y-F Guo","year":"2012","unstructured":"Guo Y-F, Lin X, Teng Z, Xue X, Fan J (2012) A covariance-free iterative algorithm for distributed principal component analysis on vertically partitioned data. Pattern Recogn 45(3):1211\u20131219","journal-title":"Pattern Recogn"},{"key":"5206_CR13","doi-asserted-by":"crossref","unstructured":"Luo C, Zhang K, Salinas S, Li P (2017) Efficient privacy-preserving outsourcing of large-scale QR factorizatio. In IEEE Trustcom\/BigDataSE\/ICESS","DOI":"10.1109\/Trustcom\/BigDataSE\/ICESS.2017.331"},{"issue":"1","key":"5206_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/23311916.2017.1295783","volume":"4","author":"M Kumar","year":"2017","unstructured":"Kumar M, Meena J, Vardhan M (2017) Privacy preserving, verifiable and efficient outsourcing algorithm for matrix multiplication to a malicious cloud server. Cogent Eng 4(1):1\u201320","journal-title":"Cogent Eng"},{"key":"5206_CR15","doi-asserted-by":"crossref","unstructured":"Zhao M, Ding Y, Wang Y, Wang H, Han B (2020) Verifiable and privacy-preserving outsourcing of matrix multiplications. In: International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","DOI":"10.1109\/CyberC49757.2020.00021"},{"issue":"14","key":"5206_CR16","doi-asserted-by":"publisher","first-page":"2348","DOI":"10.1002\/sec.1501","volume":"9","author":"H-S Won","year":"2016","unstructured":"Won H-S, Kim S-P, Lee S, Choi M-J, Moon Y-S (2016) Secure principal component analysis in multiple distributed nodes. Secur Commun Netw 9(14):2348\u20132358","journal-title":"Secur Commun Netw"},{"key":"5206_CR17","doi-asserted-by":"crossref","unstructured":"Al-Rubaie M, Wu P-y, Chang JM, Kung S-Y (2017) Privacy-preserving PCA on horizontally-partitioned data. In: 2017 IEEE Conference on Dependable and Secure Computing","DOI":"10.1109\/DESEC.2017.8073817"},{"key":"5206_CR18","doi-asserted-by":"crossref","unstructured":"Wang S, Chang JM (2018) Differentially private principal component analysis over horizontally partitioned data. In: 2018 IEEE Conference on Dependable and Secure Computing (DSC)","DOI":"10.1109\/DESEC.2018.8625131"},{"key":"5206_CR19","unstructured":"Liu Y, Chen C, Zheng L, Wang L, Zhou J, Liu G, Yang S (2020) Privacy preserving PCA for multiparty modeling. arXiv preprint arXiv:2002.02091"},{"key":"5206_CR20","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.sigpro.2014.03.037","volume":"104","author":"A Bertrand","year":"2014","unstructured":"Bertrand A, Moonen M (2014) Distributed adaptive estimation of covariance matrix eigenvectors in wireless sensor networks with application to distributed PCA. Signal Process 104:120\u2013135","journal-title":"Signal Process"},{"key":"5206_CR21","doi-asserted-by":"crossref","unstructured":"Pathak M, Raj B (2010) Privacy preserving protocols for eigenvector computation. In: International workshop on privacy and security issues in data mining and machine learning, pp 113\u2013126","DOI":"10.1007\/978-3-642-19896-0_10"},{"key":"5206_CR22","doi-asserted-by":"crossref","unstructured":"Li Y, Xu W (2019) PrivPy: general and scalable privacy-preserving data mining. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","DOI":"10.1145\/3292500.3330920"},{"key":"5206_CR23","unstructured":"Fan X, Wang G, Chen K, He X, Xu W (2021) PPCA: Privacy-preserving principal component analysis using secure multiparty computation(MPC). arXiv preprint arXiv:2105.07612"},{"key":"5206_CR24","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/320941.320947","volume":"5","author":"AS Householder","year":"1958","unstructured":"Householder AS (1958) Unitary triangularization of a nonsymmetric matrix. J ACM Assoc Comput Mach 5:339\u2013342","journal-title":"J ACM Assoc Comput Mach"},{"issue":"1","key":"5206_CR25","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/0106004","volume":"6","author":"W Givens","year":"1958","unstructured":"Givens W (1958) Computation of plain unitary rotations transforming a general matrix to triangular form. J Soc Ind Appl Math 6(1):26\u201350","journal-title":"J Soc Ind Appl Math"},{"key":"5206_CR26","doi-asserted-by":"crossref","unstructured":"Luo C, Zhang K, Salinas S, Li P (2017) Efficient privacy-preserving outsourcing of large-scale QR factorization. In: 2017 IEEE Trustcom\/BigDataSE\/ICESS, pp 917\u2013924","DOI":"10.1109\/Trustcom\/BigDataSE\/ICESS.2017.331"},{"key":"5206_CR27","doi-asserted-by":"crossref","unstructured":"Zhang Y, Zheng P, Luo W (2019) Privacy-preserving outsourcing computation of QR decomposition in the encrypted domain. In: 18th IEEE International Conference On Trust, Security And Privacy In Computing And Communications\/13th IEEE International Conference On Big Data Science And Engineering (TrustCom\/BigDataSE)","DOI":"10.1109\/TrustCom\/BigDataSE.2019.00059"},{"key":"5206_CR28","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. Advances in Cryptology \u2014 EUROCRYPT \u201999, LNCS, vol 1592, pp. 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"5206_CR29","doi-asserted-by":"crossref","unstructured":"Elgamal T (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. In: IEEE transactions on information theory","DOI":"10.1109\/TIT.1985.1057074"},{"issue":"2","key":"5206_CR30","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"Rivest R, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120\u2013126","journal-title":"Commun ACM"},{"key":"5206_CR31","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: STOC '09: proceedings of the forty-first annual ACM symposium on theory of computing","DOI":"10.1145\/1536414.1536440"},{"issue":"3","key":"5206_CR32","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) (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans Comput Theory 6(3):1\u201336","journal-title":"ACM Trans Comput Theory"},{"key":"5206_CR33","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Alt A, Tromer E, Vaikuntanathan V (2012) On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: STOC '12: Proceedings of the forty-fourth annual ACM symposium on theory of computing.","DOI":"10.1145\/2213977.2214086"},{"key":"5206_CR34","doi-asserted-by":"crossref","unstructured":"Brakerski Z (2012) Fully homomorphic encryption without modulus switching from classical GapSVP. Advances in cryptology \u2013 CRYPTO 2012 (LNCS), vol 7417, pp 868\u2013886","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"5206_CR35","unstructured":"Fan J, Vercauteren F (2012) Somewhat practical fully homomorphic encryption. IACR Cryptology ePrint Archive 2012\/144"},{"key":"5206_CR36","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O (2010) On ideal lattices and learning with errors over rings. Advances in cryptology \u2013 EUROCRYPT 2010. Lecture Notes in Computer Science, vol 6110, pp 1\u201323","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"5206_CR37","volume-title":"Numerical analysis and scientific computation","author":"JJ Leader","year":"2004","unstructured":"Leader JJ (2004) Numerical analysis and scientific computation. Addison-Wesley, New Yrok"},{"key":"5206_CR38","doi-asserted-by":"crossref","unstructured":"Govindarajan S, Gasti P, Balagani KS (2013) Secure privacy-preserving protocols for outsourcing continuous authentication of smartphone users with touch data. In 2013 IEEE sixth International Conference on Biometrics: Theory, Applications And Systems (BTAS)","DOI":"10.1109\/BTAS.2013.6712742"},{"key":"5206_CR39","volume-title":"Numerical methods for large eigenvalue problems","author":"Y Saad","year":"1992","unstructured":"Saad Y (1992) Numerical methods for large eigenvalue problems. Manchester University Press, Manchester"},{"issue":"4","key":"5206_CR40","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/1024100","volume":"24","author":"DS Watkins","year":"1982","unstructured":"Watkins DS (1982) Understanding the QR algorithm. SIAM Rev 24(4):427\u2013440","journal-title":"SIAM Rev"},{"issue":"4","key":"5206_CR41","doi-asserted-by":"publisher","first-page":"255","DOI":"10.6028\/jres.045.026","volume":"45","author":"C Lanczos","year":"1950","unstructured":"Lanczos C (1950) An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J Res Natl Bur Stand 45(4):255\u2013282","journal-title":"J Res Natl Bur Stand"},{"key":"5206_CR42","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/BF02162154","volume":"9","author":"W Barth","year":"1967","unstructured":"Barth W, Martin R, Wilkinson J (1967) Calculation of the eigenvalues of a symmetric tridiagonal matrix by the bisection method. Numer Math 9:386\u2013393","journal-title":"Numer Math"},{"key":"5206_CR43","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01396757","volume":"36","author":"JJM Cuppen","year":"1980","unstructured":"Cuppen JJM (1980) A divide and conquer method for the symmetric tridiagonal eigenproblem. Numer Math 36:177\u2013195","journal-title":"Numer Math"},{"key":"5206_CR44","unstructured":"Dua D, Graff C (2018) UCI machine learning repository. University of California, School of Information and Computer Science, Irvine, CA. http:\/\/archive.ics.uci.edu\/ml. Accessed 6 Sept 2022."},{"key":"5206_CR45","doi-asserted-by":"crossref","unstructured":"Fawaz SM, Belal N, ElRefaey A, Fakhr MW (2021) A comparative study of homomorphic encryption schemes using microsoft SEAL. J Phys Conf Ser 2128","DOI":"10.1088\/1742-6596\/2128\/1\/012021"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05206-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05206-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05206-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T11:10:45Z","timestamp":1687864245000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05206-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,6]]},"references-count":45,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["5206"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05206-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,6]]},"assertion":[{"value":"16 March 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest\/competing interests to report regarding the present work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable for the present work.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"All authors have agreed and given their consent for submission of this paper to the Journal of Supercomputing.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Financial and non-financial interests"}}]}}