{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T01:09:25Z","timestamp":1746407365956,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T00:00:00Z","timestamp":1711584000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T00:00:00Z","timestamp":1711584000000},"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":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-024-02657-z","type":"journal-article","created":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T16:02:24Z","timestamp":1711641744000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Data Confidentiality in Machine Learning: Exploring Multivariate Regression and Its Application on Encrypted Medical Data"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8089-0116","authenticated-orcid":false,"given":"Eric","family":"Affum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marian","family":"Enchill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,28]]},"reference":[{"key":"2657_CR1","doi-asserted-by":"crossref","unstructured":"Gentry C. Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st annual ACM symposium on theory of computing STOC 09, 2009. 19 September. (7)9.","DOI":"10.1145\/1536414.1536440"},{"key":"2657_CR2","first-page":"253","volume-title":"Secure ranked keyword search over encrypted cloud data","author":"C Wang","year":"2010","unstructured":"Wang C, Cao N, Li J, et al. Secure ranked keyword search over encrypted cloud data. In: Proceedings-30th IEEE International Conference on Distributed Computing Systems. Genova, Itay, 2010. p. 253\u2013262."},{"issue":"2","key":"2657_CR3","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems. Commun ACM. 1978;21(2):120\u20136.","journal-title":"Commun ACM"},{"key":"2657_CR4","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V. Fully homomorphic encryption from ring-LWE and security for key dependent messages, vol. 6841. LNCS. Lecture notes in computer science. 2011. pp. 505\u2013524.","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"2657_CR5","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S, Smart NP. Homomorphic evaluation of the AES circuit, vol. 7417. LNCS. Lecture notes in computer science. 2012. pp.850\u2013867.","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"2657_CR6","doi-asserted-by":"publisher","DOI":"10.1155\/2007\/13801","author":"C Fontaine","year":"2007","unstructured":"Fontaine C, Galand F. A survey of homomorphic encryption for nonspecialists. Eurasip J Inf Secur. 2007. https:\/\/doi.org\/10.1155\/2007\/13801.","journal-title":"Eurasip J Inf Secur"},{"issue":"6","key":"2657_CR7","first-page":"2278","volume":"17","author":"S Khamitkar","year":"2015","unstructured":"Khamitkar S. A survey on fully homomorphic encryption. IOSR J Comput Eng Ver III. 2015;17(6):2278\u2013661.","journal-title":"IOSR J Comput Eng Ver III"},{"issue":"1","key":"2657_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s12095-017-0243-8","volume":"10","author":"S Bogos","year":"2018","unstructured":"Bogos S, Gaspoz J, Vaudenay S. Cryptanalysis of a homomorphic encryption scheme. Cryptogr Commun. 2018;10(1):27\u201339.","journal-title":"Cryptogr Commun"},{"key":"2657_CR9","unstructured":"Basilakis J, Javadi B, Maeder A. The potential for machine learning analysis over encrypted data in cloud - based clinical decision support\u2014background and review. In: Australasian workshop on health informatics and knowledge management (HIKM), January 2015. pp. 27\u201330."},{"key":"2657_CR10","first-page":"1","volume-title":"ML confidential: Machine learning on encrypted data","author":"M Naehrig","year":"2012","unstructured":"Naehrig M, Lauter K, Graepel T. ML confidential: Machine learning on encrypted data. In: In: International conference on information security and cryptology Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. p. 1\u201321."},{"key":"2657_CR11","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.jbi.2014.04.003","volume":"50","author":"JW Bos","year":"2014","unstructured":"Bos JW, Lauter K, Naehrig M. Private predictive analysis on encrypted medical data. J Biomed Inform. 2014;50:234\u201343.","journal-title":"J Biomed Inform"},{"key":"2657_CR12","doi-asserted-by":"crossref","unstructured":"Barni M, Failla P, Kolesnikov V, et al. Secure evaluation of private linear branching programs with medical applications, vol. 5789. LNCS. Lecture notes in computer science. 2009. pp. 424\u2013439.","DOI":"10.1007\/978-3-642-04444-1_26"},{"key":"2657_CR13","unstructured":"Wu D, Haven J. Using homomorphic encryption for large scale statistical analysis. FHE-SI-Report, University Stanford. Technical Report TR-dwu4 (2012)."},{"key":"2657_CR14","unstructured":"Dwork C. Proceedings of the 5th international conference on theory and applications of models of computation. 2008. pp. 1\u201319."},{"key":"2657_CR15","first-page":"1","volume":"2021","author":"Z Jianan","year":"2021","unstructured":"Jianan Z, Huang R, Yang B. Efficient GSW-style fully homomorphic encryption over the integers. Secur Commun Netw. 2021;2021:1\u201313.","journal-title":"Secur Commun Netw"},{"key":"2657_CR16","first-page":"223","volume-title":"Eurocrypt","author":"P Paillier","year":"1999","unstructured":"Paillier P, et al. Public-key cryptosystems based on composite degree residuosity classes. In: Eurocrypt, vol. 99. Berlin: Springer; 1999. p. 223\u201338."},{"issue":"2009","key":"2657_CR17","first-page":"169","volume":"9","author":"C Gentry","year":"2009","unstructured":"Gentry C, et al. Fully homomorphic encryption using ideal lattices. STOC. 2009;9(2009):169\u201378.","journal-title":"STOC"},{"issue":"6","key":"2657_CR18","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O. On lattices, learning with errors, random linear codes, and cryptography. J ACM (JACM). 2009;56(6):34.","journal-title":"J ACM (JACM)"},{"key":"2657_CR19","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings. In: Annual international conference on the theory and applications of cryptographic techniques. Springer; 2010. pp. 1\u201323.","DOI":"10.1007\/978-3-642-13190-5_1"},{"issue":"2","key":"2657_CR20","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from (standard) LWE. SIAM J Comput. 2014;43(2):831\u201371.","journal-title":"SIAM J Comput"},{"key":"2657_CR21","doi-asserted-by":"crossref","unstructured":"Chillotti I, Gama N, Georgieva M, Izabachene M. Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds. In: Advances in cryptology\u2014ASIACRYPT 2016: 22nd international conference on the theory and application of cryptology and information security, Hanoi, Vietnam, December 4\u20138, 2016, proceedings, part I 22. Springer; 2016. pp. 3\u201333.","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"2657_CR22","doi-asserted-by":"crossref","unstructured":"Zhou H, Wornell G. Efficient homomorphic encryption on integer vectors and its applications. In: 2014 Information Theory and applications workshop, ITA 2014\u2014conference proceedings, 2014.","DOI":"10.1109\/ITA.2014.6804228"},{"issue":"11","key":"2657_CR23","doi-asserted-by":"publisher","first-page":"10945","DOI":"10.1109\/JIOT.2020.2992349","volume":"7","author":"Y Haomiao","year":"2020","unstructured":"Haomiao Y, et al. Secure and efficient knn classification for industrial internet of things. IEEE Internet Things J. 2020;7(11):10945\u201354.","journal-title":"IEEE Internet Things J"},{"issue":"4","key":"2657_CR24","first-page":"669","volume":"27","author":"R Hall","year":"2011","unstructured":"Hall R, Fienberg SE, Nardi Y. Secure multiple linear regression based on homomorphic encryption. J Off Stat. 2011;27(4):669.","journal-title":"J Off Stat"},{"key":"2657_CR25","doi-asserted-by":"crossref","unstructured":"Yao C-C. How to generate and exchange secrets. In: 27th annual symposium on foundations of computer science, 1986. IEEE; 1986. pp. 162\u2013167.","DOI":"10.1109\/SFCS.1986.25"},{"key":"2657_CR26","doi-asserted-by":"crossref","unstructured":"Bost R, Popa RA, Tu S, Goldwasser S. Machine learning classification over encrypted data. In: NDSS. 2015.","DOI":"10.14722\/ndss.2015.23241"},{"key":"2657_CR27","unstructured":"Gilad-Bachrach R, Dowlin N, Laine K, Lauter K, Naehrig M, Wernsing J. Cryptonets: applying neural networks to encrypted data with high throughput and accuracy. In: International conference on machine learning, 2016. pp. 201\u2013210."},{"issue":"1","key":"2657_CR28","doi-asserted-by":"publisher","first-page":"e14","DOI":"10.2196\/medinform.8286","volume":"6","author":"MN Sadat","year":"2018","unstructured":"Sadat MN, Jiang X, Al Aziz MM, Wang S, Mohammed N. Secure and efficient regression analysis using a hybrid cryptographic framework: development and evaluation. JMIR Med Inform. 2018;6(1):e14.","journal-title":"JMIR Med Inform"},{"key":"2657_CR29","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/TCBB.2018.2833463","volume":"16","author":"Y Jiang","year":"2018","unstructured":"Jiang Y, Hamer J, Wang C, Jiang X, Kim M, Song Y, Xia Y, Mohammed N, Sadat MN, Wang S. Securelr: secure logistic regression model via a hybrid cryptographic protocol. IEEE\/ACM Trans Comput Biol Bioinform. 2018;16:113\u201323.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"2657_CR30","doi-asserted-by":"crossref","unstructured":"Hoekstra M, Lal R, Pappachan P, Phegade V, Del Cuvillo J. Using innovative instructions to create trustworthy software solutions. HASP@ ISCA, vol. 11, 2013.","DOI":"10.1145\/2487726.2488370"},{"key":"2657_CR31","doi-asserted-by":"crossref","unstructured":"Morshed T, Alhadidi D, Mohammed N. Parallel linear regression on encrypted data. In: 2018 16th Annual conference on privacy, security and trust (PST). IEEE; 2018.","DOI":"10.1109\/PST.2018.8514158"},{"key":"2657_CR32","volume-title":"Multivariate statistical modelling based on generalized linear models","author":"F Ludwig","year":"1994","unstructured":"Ludwig F, Tutz G. Multivariate statistical modelling based on generalized linear models. New York: Springer; 1994."},{"key":"2657_CR33","volume-title":"Handbook of research on cloud infrastructures for big data analytics","author":"MB Nirmala","year":"2014","unstructured":"Nirmala MB, Raj P, Johnston L, et al. Handbook of research on cloud infrastructures for big data analytics. Hershey: IGI Global; 2014."},{"key":"2657_CR34","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S, Smart NP. Better bootstrapping in fully homomorphic encryption, Vol. 7293 LNCS. Lecture notes in computer science. 2012. pp. 1.","DOI":"10.1007\/978-3-642-30057-8_1"},{"key":"2657_CR35","doi-asserted-by":"crossref","unstructured":"Peikert C, Vaikuntanathan V, Waters B. A framework for efficient and composable oblivious transfer, vol. 5157. LNCS Lecture notes in computer science, 2008. pp. 554\u2013571.","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"2657_CR36","doi-asserted-by":"crossref","unstructured":"Naehrig M, Lauter K, Vaikuntanathan V. Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM workshop on cloud computing security workshop\u2014CCSW\u201911. 2011. pp. 113\u2013124.","DOI":"10.1145\/2046660.2046682"},{"key":"2657_CR37","unstructured":"A F., Asuncion A. UCI machine learning repository. 2022. http:\/\/archive.ics.uci.edu\/ml."},{"key":"2657_CR38","doi-asserted-by":"crossref","unstructured":"Emad EA, Kanaan FA, Helmy T, Azzedin F, Al-Suhaim A. Evaluation of breast cancer tumor classification with unconstrained functional networks classifier. In: Computer systems and applications, IEEE international conference, 2006. pp. 281\u2013287.","DOI":"10.1109\/AICCSA.2006.205102"},{"issue":"9","key":"2657_CR39","doi-asserted-by":"publisher","first-page":"14055","DOI":"10.1007\/s11042-022-13807-x","volume":"82","author":"Y Sahu","year":"2023","unstructured":"Sahu Y, Tripathi A, Gupta RK, Gautam P, Pateriya RK, Gupta A. A CNN-SVM based computer aided diagnosis of breast cancer using histogram K-means segmentation technique. Multimedia Tools Appl. 2023;82(9):14055\u201375.","journal-title":"Multimedia Tools Appl"},{"key":"2657_CR40","unstructured":"Hu Y. Improving the efficiency of homomorphic encryption schemes. 2013, 103."},{"key":"2657_CR41","doi-asserted-by":"crossref","unstructured":"Barni M, Failla P, Lazzeretti R, et al. Efficient privacy-preserving classification of ECG signals. In: Proceedings of the 2009 1st IEEE international workshop on information forensics and security, WIFS 2009. 2009. pp. 91\u201395.","DOI":"10.1109\/WIFS.2009.5386475"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-02657-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-024-02657-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-02657-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T05:53:56Z","timestamp":1731650036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-024-02657-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,28]]},"references-count":41,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,4]]}},"alternative-id":["2657"],"URL":"https:\/\/doi.org\/10.1007\/s42979-024-02657-z","relation":{},"ISSN":["2661-8907"],"issn-type":[{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2024,3,28]]},"assertion":[{"value":"22 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors wish to confirm that there are no known conflicts of interest associated with this publication.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"355"}}