{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:37:57Z","timestamp":1740181077030,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T00:00:00Z","timestamp":1653436800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T00:00:00Z","timestamp":1653436800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J BANK FINANC TECHNOL"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s42786-022-00042-z","type":"journal-article","created":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T07:03:06Z","timestamp":1653462186000},"page":"31-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A novel cryptographic protocol for privacy preserving classification over distributed encrypted databases"],"prefix":"10.1007","volume":"6","author":[{"given":"Ashutosh","family":"Saxena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8298-7571","authenticated-orcid":false,"given":"P. Radha","family":"Krishna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,25]]},"reference":[{"key":"42_CR1","volume-title":"Introduction to data mining","author":"P-N Tan","year":"2006","unstructured":"Tan P-N, Steinbach M, Kumar V (2006) Introduction to data mining. Addison-Wesley, Boston"},{"key":"42_CR2","unstructured":"Kumar A, Madanu M, Prakash H, Jonnavithula L, Aravilli SR Advaita: big duplicity detection system. https:\/\/arxiv.org\/abs\/2001.10376"},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.datak.2012.03.003","volume":"76\u201378","author":"MG Kaosar","year":"2012","unstructured":"Kaosar MG, Paulet R, Yi X (2012) Fully homomorphic encryption based two-party association rule mining. Data Knowl Eng 76\u201378:1\u201315","journal-title":"Data Knowl Eng"},{"key":"42_CR4","unstructured":"Clifton C, Kantarcioglu M, Vaidya J (2002) Defining privacy for data mining. In: National science foundation workshop on next generation data mining"},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/772862.772867","volume":"4","author":"C Clifton","year":"2002","unstructured":"Clifton C, Kantarcioglu M, Vaidya J, Lin X, Zhu MY (2002) Tools for privacy preserving distributed data mining. SIGKDD Explor Newsl 4:28\u201334","journal-title":"SIGKDD Explor Newsl"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Bellovin SM, Merritt M (1993) Augmented encrypted key exchange: a password-based protocol secure against dictionary attacks and password file compromise. In: Proceedings of the 1st ACM conference on computer and communications security. ACM, pp 244\u2013250","DOI":"10.1145\/168588.168618"},{"key":"42_CR7","first-page":"100403","volume-title":"Computer science review","author":"M Cunha","year":"2021","unstructured":"Cunha M, Mendes R, Vilela JP (2021) A survey of privacy-preserving mechanisms for heterogeneous data types. Computer science review, vol 41. Elsevier, Amsterdam, p 100403"},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1186\/s40064-015-1481-x","volume":"4","author":"YAAS Aldeen","year":"2015","unstructured":"Aldeen YAAS, Salleh M, Razzaque MA (2015) A comprehensive review on privacy preserving data mining. Springerplus 4:694","journal-title":"Springerplus"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Zhang N, Wang S, Zhao W (2005) A new scheme on privacy-preserving data classification. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining, pp 374\u2013383. ACM","DOI":"10.1145\/1081870.1081913"},{"key":"42_CR10","unstructured":"Wang Q, Datta KS, Sivakumar K (2003) On the privacy preserving properties of random data perturbation techniques. In: 3rd IEEE international conference on data mining, pp 99\u2013106"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Dachman-Soled D, Malkin T, Raykova M, Yung M (2009) Efficient robust private set intersection. In: Applied cryptography and network security, volume 5536 of lecture notes in computer science. Springer, pp 125\u2013142","DOI":"10.1007\/978-3-642-01957-9_8"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Chitti S, Xiong L, Liu L (2006) k nearest neighbor classification across multiple private databases. In: Proceedings of the 15th ACM international conference on information and knowledge management (CIKM), pp 840\u2013841","DOI":"10.1145\/1183614.1183757"},{"key":"42_CR13","first-page":"40","volume":"2004","author":"G Aggarwal","year":"2004","unstructured":"Aggarwal G, Mishra N, Pinkas B (2004) Secure computation of the kth ranked element. Adv Cryptol Eurocrypt 2004:40\u201355","journal-title":"Adv Cryptol Eurocrypt"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Kissner L, Song D (2005) Privacy-preserving set operations. In: Proceedings of CRYPTO. Springer, pp 241\u2013257","DOI":"10.1007\/11535218_15"},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y Lindell","year":"2002","unstructured":"Lindell Y, Pinkas B (2002) Privacy preserving data mining. J Cryptol 15:177\u2013206","journal-title":"J Cryptol"},{"key":"42_CR16","unstructured":"Kao B, Mamoulis N, Wong WK, Cheung DW (2009) Secure knn computation on encrypted databases. In: Proceedings of the 35th international conference on management of data, (SIGMOD). ACM, pp 139\u2013152"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Upmanyu M, Namboodiri A, Srinathan K, Jawahar C (2010) Efficient privacy preserving k-means clustering. In: Intelligence and security informatics, vol 6122, LNCS. Springer Berlin\/Heidelberg, pp 154\u2013166","DOI":"10.1007\/978-3-642-13601-6_17"},{"key":"42_CR18","unstructured":"Resende A, Railsback D, Dowsley R, Nascimento ACA, Aranha DF (2021) Fast privacy-preserving text classification based on secure multiparty computation. arXiv:2101.07365v2 [cs.CR]. 8 Jun 2021"},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"Yao AC (1986) How to generate and exchange secrets. In: 27th IEEE symposium on foundations of computer science, pp 162\u2013167","DOI":"10.1109\/SFCS.1986.25"},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"Qi Y, Atallah MJ (2008) Efficient privacy-preserving k-nearest neighbor search. In: Proceedings of 28th international conference on distributed computing (ICDCS). IEEE Computer Society, pp 311\u2013319","DOI":"10.1109\/ICDCS.2008.79"},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Wu W, Parampalli U, Liu J, Xian M (2019) Privacy preserving k-nearest neighbor classification over encrypted database in outsourced cloud environments, vol 22. World Wide Web, Springer,\u00a0pp 101\u2013123","DOI":"10.1007\/s11280-018-0539-4"},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"Singh MD, Krishna PR, Saxena A (2010) A cryptography based privacy preserving solution to mine cloud data. In: ACM compute, 2010","DOI":"10.1145\/1754288.1754302"},{"key":"42_CR23","first-page":"28","volume":"2","author":"O Goldreich","year":"2004","unstructured":"Goldreich O (2004) The foundations of cryptography. Cambr Univ Press 2:28\u201334","journal-title":"Cambr Univ Press"},{"key":"42_CR24","doi-asserted-by":"crossref","unstructured":"Ishai Y, Kushilevitz E, Ostrovsky R (2005) Sufficient conditions for collision-resistant hashing. In: Theory of cryptography, vol. 3378, lecture notes in computer science. Springer, pp 445\u2013456","DOI":"10.1007\/978-3-540-30576-7_24"},{"key":"42_CR25","unstructured":"SP 800-78-3: cryptographic algorithms and key sizes for personal identification verification (piv). December 2010. http:\/\/csrc.nist.gov\/publications\/PubsSPs.html"},{"issue":"3","key":"42_CR26","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"MJ Wiener","year":"1990","unstructured":"Wiener MJ (1990) Cryptanalysis of short RSA secret exponents. IEEE Trans Inf Theory 36(3):553\u2013558","journal-title":"IEEE Trans Inf Theory"},{"key":"42_CR27","unstructured":"Lou D-C, Wu C-L, Chang T-J (2006) Computational complexity analyses of modular arithmetic for RSA cryptosystem. In: 23rd workshop on combinatorial mathematics and computation theory, 2006"},{"issue":"3","key":"42_CR28","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y Lindell","year":"2002","unstructured":"Lindell Y, Pinkas B (2002) Privacy preserving data mining. J Cryptol 15(3):177\u2013206","journal-title":"J Cryptol"},{"key":"42_CR29","doi-asserted-by":"crossref","unstructured":"Yang Z, Zhong S, Wright R (2005) Privacy-preserving classification of customer data without loss of accuracy. In: Proc. 5th SIAM international conference on data mining, pp 92\u2013102, 2005","DOI":"10.1137\/1.9781611972757.9"}],"container-title":["Journal of Banking and Financial Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42786-022-00042-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42786-022-00042-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42786-022-00042-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T14:06:42Z","timestamp":1655993202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42786-022-00042-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,25]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["42"],"URL":"https:\/\/doi.org\/10.1007\/s42786-022-00042-z","relation":{},"ISSN":["2524-7956","2524-7964"],"issn-type":[{"type":"print","value":"2524-7956"},{"type":"electronic","value":"2524-7964"}],"subject":[],"published":{"date-parts":[[2022,5,25]]},"assertion":[{"value":"27 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Nil.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}