{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T12:43:21Z","timestamp":1725626601254},"publisher-location":"Berlin, Heidelberg","reference-count":48,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642251085"},{"type":"electronic","value":"9783642251092"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25109-2_23","type":"book-chapter","created":{"date-parts":[[2011,10,29]],"date-time":"2011-10-29T02:33:52Z","timestamp":1319855632000},"page":"347-366","source":"Crossref","is-referenced-by-count":4,"title":["Implementation, Optimization and Performance Tests of\u00a0Privacy Preserving Mechanisms in\u00a0Homogeneous Collaborative Association Rules Mining"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Gorawski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zacheusz","family":"Siedlecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"U. N. S. Agency. The Case for Elliptic Curve Cryptography web page, http:\/\/www.nsa.gov\/business\/programs\/elliptic_curve.shtml"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1145\/375551.375602","volume-title":"PODS 2001: Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems","author":"D. Agrawal","year":"2001","unstructured":"Agrawal, D., Aggarwal, C.C.: On the design and quantification of privacy preserving data mining algorithms. In: PODS 2001: Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 247\u2013255. ACM, New York (2001)"},{"key":"23_CR3","first-page":"86","volume-title":"SIGMOD 2003: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data","author":"R. Agrawal","year":"2003","unstructured":"Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: SIGMOD 2003: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 86\u201397. ACM Press, New York (2003)"},{"issue":"6","key":"23_CR4","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Shafer, J.C.: Parallel mining of association rules. IEEE Transactions on Knowledge and Data Engineering\u00a08(6), 962\u2013969 (1996)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"23_CR5","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, Santiago de Chile, Chile, September 12-15, pp. 487\u2013499. Morgan Kaufmann (1994)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-44634-6_16","volume-title":"Algorithms and Data Structures","author":"M.J. Atallah","year":"2001","unstructured":"Atallah, M.J., Du, W.: Secure Multi-Party Computational Geometry. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 165\u2013179. Springer, Heidelberg (2001)"},{"key":"23_CR7","volume-title":"Elliptic curves in cryptography","author":"I.F. Blake","year":"2000","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic curves in cryptography. Cambridge University Press, Cambridge (2000)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/383962.384047","volume-title":"PODC 2001: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Ishai, Y., Kumar, R., Reiter, M.K., Rubinfeld, R., Wright, R.N.: Selective private function evaluation with applications to private statistics. In: PODC 2001: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, pp. 293\u2013304. ACM, New York (2001)"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/SECPRI.2002.1004361","volume-title":"SP 2002: Proceedings of the 2002 IEEE Symposium on Security and Privacy","author":"J. Canny","year":"2002","unstructured":"Canny, J.: Collaborative filtering with privacy. In: SP 2002: Proceedings of the 2002 IEEE Symposium on Security and Privacy, pp. 45\u201357. IEEE Computer Society, Washington, DC, USA (2002)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/PDIS.1996.568665","volume-title":"PDIS: International Conference on Parallel and Distributed Information Systems","author":"Cheung","year":"1996","unstructured":"Cheung, Han, Ng, Fu, Fu: A fast distributed algorithm for mining association rules. In: PDIS: International Conference on Parallel and Distributed Information Systems, pp. 31\u201342. IEEE Computer Society Technical Committee on Data Engineering, and ACM SIGMOD, Los Alamitos (1996)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.Y.: Tools for privacy preserving distributed data mining. ACM SIGKDD Explorations\u00a04 (2003)","DOI":"10.1145\/772862.772867"},{"key":"23_CR12","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.\u00a01676, pp. 389\u2013398. Springer, Heidelberg (1999)"},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/775047.775080","volume-title":"KDD 2002: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"A. Evfimievski","year":"2002","unstructured":"Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: KDD 2002: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 217\u2013228. ACM, New York (2002)"},{"key":"23_CR14","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":"M.J. 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.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"23_CR15","unstructured":"Frieser, J., Popelinsky, L.: Dioda: Secure mining in horizontally partitioned data. In: International Workshop on Privacy and Security Issues in Data Mining, PSDM 2004 (September 2004)"},{"key":"23_CR16","first-page":"613","volume-title":"ICDM 2005: Proceedings of the Fifth IEEE International Conference on Data Mining","author":"A.W.-C. Fu","year":"2005","unstructured":"Fu, A.W.-C., Wong, R.C.-W., Wang, K.: Privacy-preserving frequent pattern mining across private databases. In: ICDM 2005: Proceedings of the Fifth IEEE International Conference on Data Mining, pp. 613\u2013616. IEEE Computer Society, Washington, DC, USA (2005)"},{"key":"23_CR17","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.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 104\u2013120. Springer, Heidelberg (2005)"},{"key":"23_CR18","unstructured":"Goldreich, O.: Secure multi-party computation (2002) (manuscript)"},{"key":"23_CR19","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/28395.28420","volume-title":"STOC 1987: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC 1987: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 218\u2013229. ACM, New York (1987)"},{"key":"23_CR20","unstructured":"Gorawski, M.: Advanced data warehouses. Studia Informatica\u00a030(3B) (2009)"},{"key":"#cr-split#-23_CR21.1","unstructured":"7. Gorawski, M., Slabinski, L.: Implementation of homomorphic encryption in privacy-preserving clustering distributed data. In: 2nd ADBIS Workshop on Data Mining and Knowledge Discovery, Thessaloniki, Greece September 6 (2006)"},{"key":"#cr-split#-23_CR21.2","unstructured":"8. in conjunction with 10th East-European Conference on Advances in Databases and Information Systems ADBIS 2006, pp. 37-47 (September 2006)"},{"key":"23_CR22","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":"23_CR23","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":"23_CR24","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1145\/1081870.1081942","volume-title":"KDD 2005: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining","author":"G. Jagannathan","year":"2005","unstructured":"Jagannathan, G., Wright, R.N.: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: KDD 2005: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 593\u2013599. ACM, New York (2005)"},{"issue":"9","key":"23_CR25","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.\u00a016(9), 1026\u20131037 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"23_CR26","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/ICDM.2003.1250908","volume-title":"ICDM 2003: Proceedings of the Third IEEE International Conference on Data Mining","author":"H. Kargupta","year":"2003","unstructured":"Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: On the privacy preserving properties of random data perturbation techniques. In: ICDM 2003: Proceedings of the Third IEEE International Conference on Data Mining, page 99. IEEE Computer Society, Washington, DC, USA (2003)"},{"key":"23_CR27","volume-title":"A Course in Number Theory and Cryptography","author":"N. Kolbitz","year":"1994","unstructured":"Kolbitz, N.: A Course in Number Theory and Cryptography. Springer, Heidelberg (1994)"},{"key":"23_CR28","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.\u00a01880, pp. 36\u201353. Springer, Heidelberg (2000)"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Meng, D., Sivakumar, K., Kargupta, H.: Privacy-sensitive bayesian network parameter learning. In: ICDM 2004: Proceedings of the Fourth IEEE International Conference on Data Mining, pp. 487\u2013490. IEEE Computer Society, Washington, DC, USA (2004)","DOI":"10.1109\/ICDM.2004.10076"},{"key":"23_CR30","unstructured":"N.I. of\u00a0Standards and Technology. FIPS PUB 186-2: Digital Signature Standard (DSS). National Institute for Standards and Technology, Gaithersburg, MD, USA (January 2000)"},{"issue":"2","key":"23_CR31","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/64.395352","volume":"10","author":"D.E. O\u2019Leary","year":"1995","unstructured":"O\u2019Leary, D.E.: Some privacy issues in knowledge discovery: The oecd personal privacy guidelines. IEEE Expert: Intelligent Systems and Their Applications\u00a010(2), 48\u201352 (1995)","journal-title":"IEEE Expert: Intelligent Systems and Their Applications"},{"key":"23_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/3-540-44448-3_44","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"P. Paillier","year":"2000","unstructured":"Paillier, P.: Trapdooring Discrete Logarithms on Elliptic Curves Over Rings. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 573\u2013584. Springer, Heidelberg (2000)"},{"key":"23_CR33","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S.C. Pohlig","year":"1978","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over gf(p) and its cryptographic significance. IEEE Transactions on Information Theory\u00a024, 106\u2013110 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"23_CR34","unstructured":"Qu, M.: Standards for efficient cryptography sec 2: Recommended elliptic curve domain parameters (2010)"},{"key":"23_CR35","doi-asserted-by":"crossref","unstructured":"Rizvi, S.J., Haritsa, J.R.: Maintaining data privacy in association rule mining. In: VLDB 2002: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 682\u2013693, VLDB Endowment (2002)","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"key":"23_CR36","unstructured":"Schneier, B.: Applied Cryptography, 2nd edn. Protocols, Algorthms, and Source Code in C. John Wiley & Sons (2002)"},{"key":"23_CR37","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1145\/775047.775142","volume-title":"KDD 2002: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"J. Vaidya","year":"2002","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: KDD 2002: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 639\u2013644. ACM, New York (2002)"},{"key":"23_CR38","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/956750.956776","volume-title":"KDD 2003: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"J. Vaidya","year":"2003","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: KDD 2003: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 206\u2013215. ACM, New York (2003)"},{"key":"23_CR39","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":"23_CR40","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.\u00a017(4), 879\u2013898 (2008)","journal-title":"VLDB J."},{"key":"23_CR41","series-title":"Computational Mathematics Series","volume-title":"Cryptanalysis of Number Theoretic Ciphers","author":"J. Wagstaff","year":"2003","unstructured":"Wagstaff, J., Samuel, S.: Cryptanalysis of Number Theoretic Ciphers, 1st edn. Computational Mathematics Series. Chapman & Hall\/CRC Press, Boca Raton, FL, USA (2003)","edition":"1"},{"key":"23_CR42","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1145\/1014052.1014145","volume-title":"KDD 2004: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"R. Wright","year":"2004","unstructured":"Wright, R., Yang, Z.: Privacy-preserving bayesian network structure computation on distributed heterogeneous data. In: KDD 2004: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 713\u2013718. ACM, New York (2004)"},{"key":"23_CR43","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.\u00a03178, pp. 55\u201366. Springer, Heidelberg (2004)"},{"key":"23_CR44","first-page":"162","volume-title":"Proceedings of the 27th Annual Symposium on Foundations of Computer Science","author":"A.C. Yao","year":"1986","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)"},{"issue":"2","key":"23_CR45","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.\u00a063(2), 550\u2013567 (2007)","journal-title":"Data Knowl. Eng."},{"issue":"4","key":"23_CR46","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/4434.806975","volume":"7","author":"M.J. Zaki","year":"1999","unstructured":"Zaki, M.J.: Parallel and distributed association mining: A survey. IEEE Concurrency\u00a07(4), 14\u201325 (1999); Special issue on Parallel Mechanisms for Data Mining","journal-title":"IEEE Concurrency"},{"issue":"3","key":"23_CR47","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.\u00a030(3), 1216\u20131227 (2007)","journal-title":"J. Netw. Comput. Appl."}],"container-title":["Lecture Notes in Computer Science","On the Move to Meaningful Internet Systems: OTM 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25109-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T16:30:40Z","timestamp":1686414640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25109-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642251085","9783642251092"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25109-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}