{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:10:54Z","timestamp":1748751054346,"version":"3.41.0"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319271606"},{"type":"electronic","value":"9783319271613"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27161-3_22","type":"book-chapter","created":{"date-parts":[[2015,11,18]],"date-time":"2015-11-18T04:38:40Z","timestamp":1447821520000},"page":"251-263","source":"Crossref","is-referenced-by-count":0,"title":["Collaborative Multiparty Association Rules Mining with Threshold Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Gorawski","sequence":"first","affiliation":[]},{"given":"Zacheusz","family":"Siedlecki","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Gorawska","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,29]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, D., Aggarwal, C.C.: On the design and quantification of privacy preserving data mining algorithms. In: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS 2001, pp. 247\u2013255. ACM, New York, NY, USA (2001)","DOI":"10.1145\/375551.375602"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, SIGMOD 2003, pp. 86\u201397. ACM Press, New York, NY, USA (2003)","DOI":"10.1145\/872757.872771"},{"key":"22_CR3","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proceedings of 20th International Conference on Very Large Data Bases VLDB 1994, pp. 487\u2013499. Morgan Kaufmann, Santiago de Chile, Chile, 12\u201315 September 1994"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Canny, J.: Collaborative filtering with privacy. In: Proceedings of the 2002 IEEE Symposium on Security and Privacy, SP 2002, pp. 45\u201357. IEEE Computer Society, Washington, DC, USA (2002)","DOI":"10.1109\/SECPRI.2002.1004361"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D Chaum","year":"1981","unstructured":"Chaum, D., Acm, C.O.T., Rivest, R., Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24, 84\u201388 (1981)","journal-title":"Commun. ACM"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., Han, J., Ng, V.T., Fu, A., Fu, Y.: A fast distributed algorithm for mining association rules. In: International Conference on Parallel and Distributed Information Systems, PDIS, pp. 31\u201342. IEEE Computer Society Technical Committee on Data Engineering, and ACM SIGMOD, Los Alamitos, CA, USA (1996)","DOI":"10.1109\/PDIS.1996.568665"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/772862.772867","volume":"4","author":"C Clifton","year":"2003","unstructured":"Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.Y.: Tools for privacy preserving distributed data mining. ACM SIGKDD Explor. 4, 28\u201334 (2003)","journal-title":"ACM SIGKDD Explor."},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, p. 280. Springer, Heidelberg (2001)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/3-540-45539-6_39","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"YG Desmedt","year":"2000","unstructured":"Desmedt, Y.G., Kurosawa, K.: How to break a practical MIX and design a new one. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, p. 557. Springer, Heidelberg (2000)"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-17316-5_36","volume-title":"Advanced Data Mining and Applications","author":"K Emura","year":"2010","unstructured":"Emura, K., Miyaji, A., Rahman, M.S.: Efficient privacy-preserving data mining in malicious model. In: Cao, L., Feng, Y., Zhong, J. (eds.) ADMA 2010, Part I. LNCS, vol. 6440, pp. 370\u2013382. Springer, Heidelberg (2010)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-48298-9_41","volume-title":"Data Warehousing and Knowledge Discovery","author":"V Estivill-Castro","year":"1999","unstructured":"Estivill-Castro, V., Brankovic, L.: Data swapping: balancing privacy against precision in mining for logic rules. In: Mohania, M., Tjoa, A.M. (eds.) DaWaK 1999. LNCS, vol. 1676, pp. 389\u2013398. Springer, Heidelberg (1999)"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2002, pp. 217\u2013228. ACM, New York, NY, USA (2002)","DOI":"10.1145\/775079.775080"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"MJ Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"22_CR14","unstructured":"Fu, A.W.-C., Wong, R.C.-W., Wang, K.: Privacy-preserving frequent pattern mining across private databases. In: Proceedings of the Fifth IEEE International Conference on Data Mining, ICDM 2005, pp. 613\u2013616. IEEE Computer Society, Washington, DC, USA (2005)"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-44647-8_22","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"J Furukawa","year":"2001","unstructured":"Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, p. 368. Springer, Heidelberg (2001)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/11496618_9","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"B Goethals","year":"2005","unstructured":"Goethals, B., Laur, S., Lipmaa, H., Mielik\u00e4inen, T.: On private scalar product computation for privacy-preserving data mining. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 104\u2013120. Springer, Heidelberg (2005)"},{"key":"22_CR17","unstructured":"Goldreich, O.: Secure multi-party computation, manuscript (2002)"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the nineteenth annual ACM symposium on Theory of computing, STOC 1987, pp. 218\u2013229. ACM, New York, NY, USA (1987)","DOI":"10.1145\/28395.28420"},{"issue":"2","key":"22_CR19","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR20","unstructured":"Gorawski, M.: Advanced data warehouses. Studia Informatica, 30(3B) (2009)"},{"issue":"4","key":"22_CR21","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1504\/IJBIDM.2007.016380","volume":"2","author":"M Gorawski","year":"2007","unstructured":"Gorawski, M., Bularz, J.: Distribution-based methods of preserving data privacy in distributed spatial data warehouse. IJBIDM 2(4), 383\u2013400 (2007)","journal-title":"IJBIDM"},{"key":"22_CR22","series-title":"Communications in Computer and Information Science","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1007\/978-3-319-18422-7_48","volume-title":"Beyond Databases, Architectures and Structures","author":"M Gorawski","year":"2015","unstructured":"Gorawski, M., Gorawska, A., Pasterak, K.: Liquefied petroleum storage and distribution problems and research thesis. In: Kozielski, S., Mrozek, D., Kasprowski, P., Mrozek, B.M., Kostrzewa, D. (eds.) BDAS 2015. Communications in Computer and Information Science, vol. 521, pp. 540\u2013550. Springer, Heidelberg (2015)"},{"key":"22_CR23","unstructured":"Gorawski, M., Stachurski, K.: On efficiency and data privacy level of association rules mining algorithms within parallel spatial data warehouse. In: First International Conference on Availability, Reliability and Security, ARES 2006, pp. 936\u2013943. IEEE Computer Society (2006)"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Hazay, C., Nissim, K.: Efficient set operations in the presence of malicious adversaries. In: IACR PKC (2010)","DOI":"10.1007\/978-3-642-14303-8_4"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Jagannathan, G., Pillaipakkamnatt, K., Wright, R.N.: A new privacy-preserving distributed K-clustering algorithm. In: SDM (2006)","DOI":"10.1137\/1.9781611972764.47"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Jagannathan, G., Wright, R.N.: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, KDD 2005, pp. 593\u2013599. ACM, New York, NY, USA (2005)","DOI":"10.1145\/1081870.1081942"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/BFb0054145","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M Jakobsson","year":"1998","unstructured":"Jakobsson, M.: A practical mix. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 448\u2013461. Springer, Heidelberg (1998)"},{"issue":"9","key":"22_CR28","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TKDE.2004.45","volume":"16","author":"M Kantarcioglu","year":"2004","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowl. Data Eng. 16(9), 1026\u20131037 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"22_CR29","first-page":"353","volume":"2","author":"M Kantarcioglu","year":"2008","unstructured":"Kantarcioglu, M., Kardes, O.: Privacy-preserving data mining in the malicious model. Int. J. Inf. Comput. Secur. 2(4), 353\u2013375 (2008)","journal-title":"Int. J. Inf. Comput. Secur."},{"key":"22_CR30","unstructured":"Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: On the privacy preserving properties of random data perturbation techniques. In: Proceedings of the Third IEEE International Conference on Data Mining, ICDM 2003, p. 99. IEEE Computer Society, Washington, DC, USA (2003)"},{"key":"22_CR31","doi-asserted-by":"crossref","unstructured":"Kissner, L., Song, D.: Private and threshold set-intersection. Technical report CMU-CS-05-113, Carnegie Mellon University, February 2005","DOI":"10.21236\/ADA461119"},{"key":"22_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y Lindell","year":"2000","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, p. 36. Springer, Heidelberg (2000)"},{"key":"22_CR33","doi-asserted-by":"crossref","unstructured":"Meng, D., Sivakumar, K., Kargupta, H.: Privacy-sensitive bayesian network parameter learning. In: Proceedings of the Fourth IEEE International Conference on Data Mining, ICDM 2004, pp. 487\u2013490. IEEE Computer Society, Washington, DC, USA (2004)","DOI":"10.1109\/ICDM.2004.10076"},{"key":"22_CR34","doi-asserted-by":"crossref","unstructured":"Neff, C.A.: A verifiable secret shuffle and its application to E-voting. pp. 116\u2013125. ACM Press (2001)","DOI":"10.1145\/501997.502000"},{"issue":"2","key":"22_CR35","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/64.395352","volume":"10","author":"DE O\u2019Leary","year":"1995","unstructured":"O\u2019Leary, D.E.: Some privacy issues in knowledge discovery: the OECD personal privacy guidelines. IEEE Expert: Intell. Syst. Appl. 10(2), 48\u201352 (1995)","journal-title":"IEEE Expert: Intell. Syst. Appl."},{"key":"22_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 223. Springer, Heidelberg (1999)"},{"issue":"3","key":"22_CR37","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MITP.2015.34","volume":"17","author":"C Perera","year":"2015","unstructured":"Perera, C., Ranjan, R., Wang, L., Khan, S.U., Zomaya, A.Y.: Big data privacy in the internet of things era. IT Prof. 17(3), 32\u201339 (2015)","journal-title":"IT Prof."},{"key":"22_CR38","doi-asserted-by":"crossref","unstructured":"Rizvi, S.J., Haritsa, J.R.: Maintaining data privacy in association rule mining. In: Proceedings of the 28th international conference on Very Large Data Bases, VLDB 2002, pp. 682\u2013693. VLDB Endowment (2002)","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"issue":"4","key":"22_CR39","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1109\/TKDE.2013.41","volume":"26","author":"T Tassa","year":"2014","unstructured":"Tassa, T.: Secure mining of association rules in horizontally distributed databases. IEEE Trans. Knowl. Data Eng. 26(4), 970\u2013983 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"22_CR40","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2002, pp. 639\u2013644. ACM, New York, NY, USA (2002)","DOI":"10.1145\/775047.775142"},{"key":"22_CR41","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2003 pp. 206\u2013215. ACM, New York, NY, USA (2003)","DOI":"10.1145\/956750.956776"},{"key":"22_CR42","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving naive bayes classifier on vertically partitioned data. In: 2004 SIAM International Conference on Data Mining (2004)","DOI":"10.1137\/1.9781611972740.59"},{"issue":"4","key":"22_CR43","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s00778-006-0041-y","volume":"17","author":"J Vaidya","year":"2008","unstructured":"Vaidya, J., Kantarcioglu, M., Clifton, C.: Privacy-preserving naive bayes classification. VLDB J. 17(4), 879\u2013898 (2008)","journal-title":"VLDB J."},{"key":"22_CR44","doi-asserted-by":"crossref","unstructured":"Wright, R., Yang, Z.: Privacy-preserving bayesian network structure computation on distributed heterogeneous data. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2004, pp. 713\u2013718. ACM, New York, NY, USA (2004)","DOI":"10.1145\/1014052.1014145"},{"key":"22_CR45","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1109\/ACCESS.2014.2362522","volume":"2","author":"L Xu","year":"2014","unstructured":"Xu, L., Jiang, C., Wang, J., Yuan, J., Ren, Y.: Information security in big data: privacy and data mining. IEEE Access 2, 1149\u20131176 (2014)","journal-title":"IEEE Access"},{"key":"22_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-30073-1_5","volume-title":"Secure Data Management","author":"H Subramaniam","year":"2004","unstructured":"Subramaniam, H., Wright, R.N., Yang, Z.: Experimental analysis of privacy-preserving statistics computation. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2004. LNCS, vol. 3178, pp. 55\u201366. Springer, Heidelberg (2004)"},{"key":"22_CR47","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE Computer Society, Washington, DC, USA (1986)","DOI":"10.1109\/SFCS.1986.25"},{"issue":"2","key":"22_CR48","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.datak.2007.04.001","volume":"63","author":"X Yi","year":"2007","unstructured":"Yi, X., Zhang, Y.: Privacy-preserving distributed association rule mining via semi-trusted mixer. Data Knowl. Eng. 63(2), 550\u2013567 (2007)","journal-title":"Data Knowl. Eng."},{"issue":"3","key":"22_CR49","first-page":"365","volume":"21","author":"Y Yu","year":"2015","unstructured":"Yu, Y., Mu, Y., Ateniese, G.: Recent advances in security and privacy in big data. J. UCS 21(3), 365\u2013368 (2015)","journal-title":"J. UCS"},{"issue":"3","key":"22_CR50","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1016\/j.jnca.2006.04.010","volume":"30","author":"J Zhan","year":"2007","unstructured":"Zhan, J., Matwin, S., Chang, L.: Privacy-preserving collaborative association rule mining. J. Netw. Comput. Appl. 30(3), 1216\u20131227 (2007)","journal-title":"J. Netw. Comput. Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27161-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T12:33:40Z","timestamp":1748694820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27161-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319271606","9783319271613"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27161-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}