{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T04:11:07Z","timestamp":1741925467465,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642246494"},{"type":"electronic","value":"9783642246500"}],"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-24650-0_31","type":"book-chapter","created":{"date-parts":[[2011,10,22]],"date-time":"2011-10-22T14:08:55Z","timestamp":1319292535000},"page":"360-370","source":"Crossref","is-referenced-by-count":2,"title":["Optimized Two Party Privacy Preserving Association Rule Mining Using Fully Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Md. Golam","family":"Kaosar","sequence":"first","affiliation":[]},{"given":"Russell","family":"Paulet","sequence":"additional","affiliation":[]},{"given":"Xun","family":"Yi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","first-page":"487","volume-title":"Proceedings of the 20th International Conference on Very Large Data Bases","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487\u2013499. VLDB, Santiago (1994)"},{"key":"31_CR2","first-page":"45","volume-title":"KDEX 1999: Proceedings of the 1999 Workshop on Knowledge and Data Engineering Exchange","author":"M. Atallah","year":"1999","unstructured":"Atallah, M., Elmagarmid, A., Ibrahim, M., Bertino, E., Verykios, V.: Disclosure limitation of sensitive rules. In: KDEX 1999: Proceedings of the 1999 Workshop on Knowledge and Data Engineering Exchange, p. 45. IEEE Computer Society, Washington, DC, USA (1999)"},{"key":"31_CR3","first-page":"589","volume-title":"ICDM 2005: Proceedings of the Fifth IEEE International Conference on Data Mining","author":"K. Chen","year":"2005","unstructured":"Chen, K., Liu, L.: Privacy preserving data classification with rotation perturbation. In: ICDM 2005: Proceedings of the Fifth IEEE International Conference on Data Mining, pp. 589\u2013592. IEEE Computer Society, Washington, DC, USA (2005)"},{"key":"31_CR4","unstructured":"Chen, K., Liu, L.: A random geometric perturbation approach to privacy-preserving data classification. Technical Report, College of Computing, Georgia Tech. (2005)"},{"key":"31_CR5","unstructured":"Clarkson, J.B.: Dense probabilistic encryption. In: Proceedings of the Workshop on Selected Areas of Cryptography, pp. 120\u2013128 (1994)"},{"key":"31_CR6","first-page":"369","volume-title":"IHW 2001: Proceedings of the 4th International Workshop on Information Hiding","author":"E. Dasseni","year":"2001","unstructured":"Dasseni, E., Verykios, V.s., Elmagarmid, A.K., Bertino, E.: Hiding association rules by using confidence and support. In: IHW 2001: Proceedings of the 4th International Workshop on Information Hiding, London, UK, pp. 369\u2013383. Springer, Heidelberg (2001)"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M.V. Dijk","year":"2010","unstructured":"Dijk, M.V., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 24\u201343. Springer, Heidelberg (2010)"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Duan, Y., Canny, J., Zhan, J.: Efficient privacy-preserving association rule mining: P4p style. In: IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2007, March 1-April 5, pp. 654\u2013660 (2007)","DOI":"10.1109\/CIDM.2007.368938"},{"key":"31_CR9","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 (2002)","DOI":"10.1145\/775047.775080"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T. El Gamal","year":"1984","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1984)"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"R. Gennaro","year":"2010","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 465\u2013482. Springer, Heidelberg (2010)"},{"key":"31_CR12","first-page":"169","volume-title":"STOC 2009: Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"C. Gentry","year":"2009","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC 2009: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 169\u2013178. ACM, New York (2009)"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S.: Implementing gentry\u2019s fully-homomorphic encryption scheme. Cryptology ePrint Archive, Report 2010\/520 (2010)","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"31_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6569-1","volume-title":"Association Rule Hiding for Data Mining","author":"A. Gkoulalas-Divanis","year":"2010","unstructured":"Gkoulalas-Divanis, A., Verykios, S.V.: Association Rule Hiding for Data Mining. Springer, Heidelberg (2010) ISBN:9781441965691"},{"key":"31_CR15","volume-title":"Data Mining Concepts and Techniques","author":"J. Han","year":"2006","unstructured":"Han, J., Kamber, M.: Data Mining Concepts and Techniques, 2nd edn. Elsevier Inc., Amsterdam (2006)","edition":"2"},{"key":"31_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/978-3-540-85565-1_75","volume-title":"Knowledge-Based Intelligent Information and Engineering Systems","author":"M. Hussein","year":"2008","unstructured":"Hussein, M., El-Sisi, A., Ismail, N.: Fast cryptographic privacy preserving association rules mining on distributed homogenous data base. In: Lovrek, I., Howlett, R.J., Jain, L. (eds.) KES 2008, Part II. LNCS (LNAI), vol.\u00a05178, pp. 607\u2013616. Springer, Heidelberg (2008)"},{"issue":"9","key":"31_CR17","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TKDE.2004.45","volume":"16","author":"M. Kantarcioglut","year":"2004","unstructured":"Kantarcioglut, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. on Knowl. and Data Eng.\u00a016(9), 1026\u20131037 (2004)","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"key":"31_CR18","unstructured":"Kaosar, M.G., Paulet, R., Yi, X.: Secure two-party association rule mining. In: Australasian Information Security Conference (AISC 2011), pp. 17\u201320 (January 2011)"},{"issue":"1","key":"31_CR19","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TKDE.2006.14","volume":"18","author":"K. Liu","year":"2006","unstructured":"Liu, K., Kargupta, H., Ryan, J.: Random projection-based multiplicative data perturbation for privacy preserving distributed data mining. IEEE Trans. on Knowl. and Data Eng.\u00a018(1), 92\u2013106 (2006)","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"key":"31_CR20","unstructured":"Oliveira, S., Oliveira, S.R.M., Zaane, O.R.: Toward standardization in privacy-preserving data mining. In: Proc. of the 3nd Workshop on Data Mining Standards (DM-SSP 2004), in conjuction with KDD 2004, pp. 7\u201317 (2004)"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Oliveira, S.R.M., Zaane, O.R.: Achieving privacy preservation when sharing data for clustering. In: Proc. of the Workshop on Secure Data Management in a Connected World (SDM 2004) in conjunction with VLDB 2004, Toronto, Canada, pp. 67\u201382 (2004)","DOI":"10.1007\/978-3-540-30073-1_6"},{"key":"31_CR22","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.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"31_CR23","doi-asserted-by":"crossref","unstructured":"Ramaiah, B.J., Rama, A.R.M., Kumari, M.K.: Parallel privacy preserving association rule mining on pc clusters, pp. 1538\u20131542 (March 2009)","DOI":"10.1109\/IADCC.2009.4809247"},{"issue":"2","key":"31_CR24","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Rizvi, S., Haritsa, J.R.: Maintaining data privacy in association rule mining. In: Proceedings of the 28th VLDB Conference, Hong Kong, pp. 682\u2013693 (2002)","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"key":"31_CR26","unstructured":"Saha, A., Manna, N.: Digital Principles and Logic Design. Laxmi Publications (2008)"},{"key":"31_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-17373-8_22","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"D. Stehl\u00e9","year":"2010","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Faster fully homomorphic encryption. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 377\u2013394. Springer, Heidelberg (2010)"},{"key":"31_CR28","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-88192-6_17","volume-title":"Advanced Data Mining and Applications","author":"C. Su","year":"2008","unstructured":"Su, C., Sakurai, K.: A distributed privacy-preserving association rules mining scheme using frequent-pattern tree. In: Tang, C., Ling, C., Zhou, X., Cercone, N.J., Li, X. (eds.) ADMA 2008. LNCS (LNAI), vol.\u00a05139, pp. 170\u2013181. Springer, Heidelberg (2008)"},{"key":"31_CR29","volume-title":"Introduction to Data Mining","author":"P.N. Tan","year":"2006","unstructured":"Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Pearson Education, Inc., London (2006)"},{"key":"31_CR30","doi-asserted-by":"crossref","unstructured":"Wu, C.M., Huang, Y.F., Chen, J.Y.: Privacy preserving association rules by using greedy approach. In: World Congress on Computer Science and Information Engineering, vol.\u00a04, pp. 61\u201365 (2009)","DOI":"10.1109\/CSIE.2009.812"},{"key":"31_CR31","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 & Knowledge Engineering\u00a063, 550\u2013567 (2007)","journal-title":"Data & Knowledge Engineering"}],"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-642-24650-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T05:51:01Z","timestamp":1741845061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24650-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642246494","9783642246500"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24650-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}