{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T21:13:31Z","timestamp":1654118011250},"reference-count":34,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4,1]]},"abstract":"<p>Frequent Path tree (FP-tree) is a popular method to compute association rules and is faster than Apriori-based solutions in some cases. Association rule mining using FP-tree method cannot ensure entire privacy since frequency of the itemsets are required to share among participants at the first stage. Moreover, FP-tree method requires two scans of database transactions which may not be the best solution if the database is very large or the database server does not allow multiple scans. In addition, one-pass FP-tree can accommodate continuous or periodically changing databases without restarting the process as opposed to a regular FP-tree based solution. In this paper, the authors propose a one-pass FP-tree method to perform association rule mining without compromising any data privacy among two parties. A fully homomorphic encryption system over integer numbers is applied to ensure secure computation among two data sites without disclosing any number belongs to themselves.<\/p>","DOI":"10.4018\/jisp.2011040102","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T16:28:54Z","timestamp":1319041734000},"page":"13-32","source":"Crossref","is-referenced-by-count":1,"title":["Secure Two-Party Association Rule Mining Based on One-Pass FP-Tree"],"prefix":"10.4018","volume":"5","author":[{"given":"Golam","family":"Kaosar","sequence":"first","affiliation":[{"name":"Victoria University, Australia"}]},{"given":"Xun","family":"Yi","sequence":"additional","affiliation":[{"name":"Victoria University, Australia"}]}],"member":"2432","reference":[{"key":"jisp.2011040102-0","doi-asserted-by":"crossref","unstructured":"Ackerman, M. S., Cranor, L. F., & Reagle, J. (1999). Privacy in e-commerce: examining user scenarios and privacy preferences. In Proceedings of the 1st ACM Conference on Electronic commerce (EC '99) (pp. 1-8). New York, NY: ACM.","DOI":"10.1145\/336992.336995"},{"key":"jisp.2011040102-1","unstructured":"Agrawal, R., & Srikant, R. (1994, September). Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Data Bases, Santiago, Chile (pp. 487-499)."},{"key":"jisp.2011040102-2","unstructured":"Atallah, M., Elmagarmid, A., Ibrahim, M., Bertino, E., & Verykios, V. (1999). Disclosure imitation of sensitive rules. In Proceedings of the 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX '99) (p. 45). Washington, DC: IEEE Computer Society."},{"key":"jisp.2011040102-3","author":"J. G.Brookshear","year":"2005","journal-title":"Computer Science: An Overview"},{"key":"jisp.2011040102-4","unstructured":"Clarkson, J. B. (1994). Dense probabilistic encryption. In Proceedings of the Workshop on Selected Areas of Cryptography (pp. 120-128)."},{"key":"jisp.2011040102-5","unstructured":"Cockcroft, S., & Clutterbuck, P. (2001). Attitudes towards information privacy. In Proceedings of the 12th Australasian Conference on Information Systems."},{"key":"jisp.2011040102-6","doi-asserted-by":"crossref","unstructured":"Dasseni, E., Verykios, V. S., Elmagarmid, A. K., & Bertino, E. (2001). Hiding association rules by using confidence and support. In Proceedings of the 4th International Workshop on Information Hiding (IHW '01), Pittsburgh, PA (LNCS 2137, pp. 369-383).","DOI":"10.1007\/3-540-45496-9_27"},{"key":"jisp.2011040102-7","doi-asserted-by":"crossref","unstructured":"Dijk, M. V., Gentry, C., Halevi, S., & Vaikuntanathan, V. (2010). Fully homomorphic encryption over the integers. In Proceedings of the Eurocrypt 2010 Conference (pp. 24-43).","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"jisp.2011040102-8","doi-asserted-by":"crossref","unstructured":"El Gamal, T. (1985). A public key cryptosystem and a signature scheme based on discrete logarithms. In Proceedings of the Advances in Cryptology Conference (CRYPTO 84) (LNCS 196, pp. 10-18).","DOI":"10.1007\/3-540-39568-7_2"},{"key":"jisp.2011040102-9","doi-asserted-by":"crossref","unstructured":"Evmievski, A., Gehrke, J., & Srikant, R. (2003). Limiting privacy breaches in privacy preserving data mining. In Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, San Diego, CA (pp. 211-222). New York, NY: ACM.","DOI":"10.1145\/773153.773174"},{"key":"jisp.2011040102-10","doi-asserted-by":"crossref","unstructured":"Evmievski, A., Srikant, R., Agrawal, R., & Gehrke, J. (2002). Privacy preserving mining of association rules. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, AB, Canada (pp. 217-228). New York, NY: ACM.","DOI":"10.1145\/775047.775080"},{"key":"jisp.2011040102-11","doi-asserted-by":"crossref","unstructured":"Gentry, C. (2009). Fully homomorphic encryption using ideal lattices, In Proceedings of the 41st Annual ACM Symposium on Theory of Computing, Bethesda, MD (pp. 169-178). New York, NY: ACM.","DOI":"10.1145\/1536414.1536440"},{"key":"jisp.2011040102-12","doi-asserted-by":"publisher","DOI":"10.1007\/BF02345483"},{"key":"jisp.2011040102-13","author":"J.Han","year":"2006","journal-title":"Data Mining Concepts and Techniques"},{"key":"jisp.2011040102-14","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, TX (pp. 1-12). New York, NY: ACM.","DOI":"10.1145\/335191.335372"},{"key":"jisp.2011040102-15","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"jisp.2011040102-16","author":"D.Harris","year":"2007","journal-title":"Digital Design and Computer Architecture: From Gates to Processors"},{"key":"jisp.2011040102-17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.45"},{"key":"jisp.2011040102-18","unstructured":"Kaosar, M. G., Paulet, R., & Yi, X. (2011, January 17-20). Secure two-party association rule mining. Paper presented at the Australasian Information Security Conference (AISC 2011), Perth, WA, Australia."},{"key":"jisp.2011040102-19","doi-asserted-by":"crossref","unstructured":"Luo, Y., Zhao, Y., & Le, J. (2009). A survey on the privacy preserving algorithm of association rule mining. In Proceedings of the 2009 2nd International Symposium on Electronic Commerce and Security (ISECS '09) (Vol. 1, pp. 241-245).","DOI":"10.1109\/ISECS.2009.136"},{"key":"jisp.2011040102-20","doi-asserted-by":"crossref","unstructured":"Ouyang, W., & Huang, Q. (2006). Privacy preserving association rules mining based on secure two-party computation. In Intelligent Control and Automation (LNCIS 344, pp. 969-975).","DOI":"10.1007\/978-3-540-37256-1_127"},{"key":"jisp.2011040102-21","doi-asserted-by":"crossref","unstructured":"Paillier, P. (1999). Public-key cryptosystems based on composite degree residuosity classes. In Proceedings of the Advances in Cryptology Conference (Eurocrypt 1999), Prague, Czech Republic (pp. 223-238).","DOI":"10.1007\/3-540-48910-X_16"},{"key":"jisp.2011040102-22","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"jisp.2011040102-23","doi-asserted-by":"crossref","unstructured":"Rizvi, S. J., & Haritsa, J. R. (2002, August 20-23). Maintaining data privacy in association rule mining. In Proceedings of the 28th International Conference on Very Large Data Bases, Hong Kong (pp. 682-693).","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"key":"jisp.2011040102-24","doi-asserted-by":"publisher","DOI":"10.1145\/604264.604271"},{"key":"jisp.2011040102-25","unstructured":"Saygin, Y., Verykios, V. S., & Elmagarmid, A. K. (2002). Privacy preserving association rule mining. In Proceedings of the 12th International Workshop on Research Issues in Data Engineering: Engineering E-Commerce\/E-Business Systems (RIDE'02), San Jose, CA (p. 151). Washington, DC: IEEE Computer Society."},{"key":"jisp.2011040102-26","doi-asserted-by":"crossref","unstructured":"Su, C., & Sakurai, K. (2008). A distributed privacy-preserving association rules mining scheme using frequent-pattern tree. In C. Tang, C. Ling, X. Zhou, N. Cercone, & X. Li (Eds.), Advanced Data Mining and Applications (LNCS 5139, pp. 170-181).","DOI":"10.1007\/978-3-540-88192-6_17"},{"key":"jisp.2011040102-27","author":"P. N.Tan","year":"2006","journal-title":"Introduction to Data Mining"},{"key":"jisp.2011040102-28","doi-asserted-by":"crossref","unstructured":"Vaidya, J., & Clifton, C. (2002). Privacy preserving association rule mining in vertically partitioned data. In Proceedings of the 8th ACM SIGKDD Conference, Edmonton, AB, Canada (pp. 639-644). New York, NY: ACM.","DOI":"10.1145\/775047.775142"},{"key":"jisp.2011040102-29","year":"1999","journal-title":"Information Privacy Principles"},{"key":"jisp.2011040102-30","doi-asserted-by":"crossref","unstructured":"Yao, A. C. (1982). Protocols for secure computations. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, Chicago, IL (pp. 160-164). Washington, DC: IEEE Computer Society.","DOI":"10.1109\/SFCS.1982.38"},{"key":"jisp.2011040102-31","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.04.001"},{"key":"jisp.2011040102-32","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"jisp.2011040102-33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.08.010"}],"container-title":["International Journal of Information Security and Privacy"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=55377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T20:52:56Z","timestamp":1654116776000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jisp.2011040102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,4,1]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jisp.2011040102","relation":{},"ISSN":["1930-1650","1930-1669"],"issn-type":[{"value":"1930-1650","type":"print"},{"value":"1930-1669","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,1]]}}}