{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:03:28Z","timestamp":1725865408934},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319470719"},{"type":"electronic","value":"9783319470726"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-47072-6_12","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T21:20:20Z","timestamp":1474406420000},"page":"181-195","source":"Crossref","is-referenced-by-count":6,"title":["Secure Frequent Pattern Mining by Fully Homomorphic Encryption with Ciphertext Packing"],"prefix":"10.1007","author":[{"given":"Hiroki","family":"Imabayashi","sequence":"first","affiliation":[]},{"given":"Yu","family":"Ishimaki","sequence":"additional","affiliation":[]},{"given":"Akira","family":"Umayabara","sequence":"additional","affiliation":[]},{"given":"Hiroki","family":"Sato","sequence":"additional","affiliation":[]},{"given":"Hayato","family":"Yamana","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,22]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD record, vol. 22, pp. 207\u2013216. ACM (1993)","DOI":"10.1145\/170035.170072"},{"key":"12_CR2","unstructured":"Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large data bases, VLDB, vol. 1215, pp. 487\u2013499 (1994)"},{"issue":"4","key":"12_CR3","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/s00778-006-0034-x","volume":"17","author":"M Atzori","year":"2008","unstructured":"Atzori, M., Bonchi, F., Giannotti, F., Pedreschi, D.: Anonymity preserving pattern discovery. VLDB J. 17(4), 703\u2013727 (2008). Springer","journal-title":"VLDB J."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Bhaskar, R., Laxman, S., Smith, A., Thakurta, A.: Discovering frequent patterns in sensitive data. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 503\u2013512. ACM (2010)","DOI":"10.1145\/1835804.1835869"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 309\u2013325. ACM (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Gehrke, J., Srikant, R.: Limiting privacy breaches in privacy preserving data mining. In: Proceedings of the 22th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 211\u2013222. ACM (2003)","DOI":"10.1145\/773153.773174"},{"key":"12_CR7","unstructured":"Gellman, R.: Privacy in the clouds: risks to privacy and confidentiality from cloud computing. In: Proceedings of the World Privacy Forum, 23 February 2012"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41th Annual ACM Symposium on Theory of Computing, pp. 169\u2013178. ACM (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-37682-5_1","volume-title":"Information Security and Cryptology \u2013 ICISC 2012","author":"T Graepel","year":"2013","unstructured":"Graepel, T., Lauter, K., Naehrig, M.: ML Confidential: machine learning on encrypted data. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 1\u201321. Springer, Heidelberg (2013)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-662-44371-2_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S Halevi","year":"2014","unstructured":"Halevi, S., Shoup, V.: Algorithms in HElib. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 554\u2013571. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-44371-2_31"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Kaosar, M.G., Paulet, R., Yi, X.: Fully homomorphic encryption based two-party association rule mining, vol. 76, pp. 1\u201315. Elsevier (2012)","DOI":"10.1016\/j.datak.2012.03.003"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Kapoor, V., Poncelet, P., Trousset, F., Teisseire, M.: Privacy preserving sequential pattern mining in distributed databases. In: Proceedings of the 15th ACM international conference on Information and knowledge management, pp. 758\u2013767. ACM (2006)","DOI":"10.1145\/1183614.1183722"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Khedr, A., Gulak, G., Vaikuntanathan, V.: Shield: Scalable homomorphic implementation of encrypted data-classifiers. In: IEEE Transactions on Computers. IEEE (2015)","DOI":"10.1109\/TC.2015.2500576"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-319-22729-0_6","volume-title":"Big Data Analytics and Knowledge Discovery","author":"J Liu","year":"2015","unstructured":"Liu, J., Li, J., Xu, S., Fung, B.C.M.: Secure outsourced frequent pattern mining by fully homomorphic encryption. In: Madria, S., Hara, T. (eds.) DaWaK 2015. LNCS, vol. 9263, pp. 70\u201381. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-22729-0_6"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, pp. 113\u2013124. ACM (2011)","DOI":"10.1145\/2046660.2046682"},{"issue":"1","key":"12_CR16","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10115-007-0113-3","volume":"17","author":"L Qiu","year":"2009","unstructured":"Qiu, L., Li, Y., Wu, X.: Protecting business intelligence and customer privacy while outsourcing data mining tasks. Knowl. Inf. Syst. 17(1), 99\u2013120 (2009). Springer","journal-title":"Knowl. Inf. Syst."},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-13013-7_25","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"NP Smart","year":"2010","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 420\u2013443. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13013-7_25"},{"key":"12_CR18","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10623-012-9720-4","volume":"71","author":"NP Smart","year":"2014","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic simd operations. Des. Codes Crypt. 71, 57\u201381 (2014). Springer","journal-title":"Des. Codes Crypt."},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Tai, C.H., Yu, P.S., Chen, M.S.: k-support anonymity based on pseudo taxonomy for outsourcing of frequent itemset mining. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 473\u2013482. ACM (2010)","DOI":"10.1145\/1835804.1835866"},{"key":"12_CR20","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 Dijk","year":"2010","unstructured":"Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24\u201343. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13190-5_2"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Wang, Y., Wu, X.: Approximate inverse frequent itemset mining: Privacy, complexity, and approximation. In: 5th IEEE International Conference on Data Mining (ICDM), pp. 482\u2013489. IEEE (2005)","DOI":"10.1109\/ICDM.2005.27"}],"container-title":["Lecture Notes in Computer Science","Data Privacy Management and Security Assurance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47072-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T16:27:57Z","timestamp":1568392077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47072-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319470719","9783319470726"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47072-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}