{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T04:05:52Z","timestamp":1761969952869,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642304279"},{"type":"electronic","value":"9783642304286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30428-6_9","type":"book-chapter","created":{"date-parts":[[2012,5,23]],"date-time":"2012-05-23T12:03:15Z","timestamp":1337774595000},"page":"112-126","source":"Crossref","is-referenced-by-count":20,"title":["A Universal Toolkit for Cryptographically Secure Privacy-Preserving Data Mining"],"prefix":"10.1007","author":[{"given":"Dan","family":"Bogdanov","sequence":"first","affiliation":[]},{"given":"Roman","family":"Jagom\u00e4gis","sequence":"additional","affiliation":[]},{"given":"Sven","family":"Laur","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. of VLDB 1994, pp. 487\u2013499. Morgan Kaufmann (1994)"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10618-008-0119-9","volume":"18","author":"S. Agrawal","year":"2009","unstructured":"Agrawal, S., Haritsa, J.R., Prakash, B.A.: FRAPP: a framework for high-accuracy privacy-preserving mining. Knowledge Discovery and Data Mining\u00a018(1), 101\u2013139 (2009)","journal-title":"Knowledge Discovery and Data Mining"},{"key":"9_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-88313-5_13","volume-title":"Computer Security - ESORICS 2008","author":"D. Bogdanov","year":"2008","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: A Framework for Fast Privacy-Preserving Computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol.\u00a05283, pp. 192\u2013206. Springer, Heidelberg (2008)"},{"key":"9_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11889663_10","volume-title":"Financial Cryptography and Data Security","author":"P. Bogetoft","year":"2006","unstructured":"Bogetoft, P., Damg\u00e5rd, I., Jakobsen, T., Nielsen, K., Pagter, J., Toft, T.: A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol.\u00a04107, pp. 142\u2013147. Springer, Heidelberg (2006)"},{"key":"9_CR5","unstructured":"Bramer, M.: Principles of Data Mining. Springer (2007)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Brijs, T., Swinnen, G., Vanhoof, K., Wets, G.: Using association rules for product assortment decisions: A case study. In: Proc. of KDD 1999, pp. 254\u2013260. ACM (1999)","DOI":"10.1145\/312129.312241"},{"key":"9_CR7","unstructured":"Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.: SEPIA: privacy-preserving aggregation of multi-domain network events and statistics. In: Proc. of USENIX Security 2010, p. 15. USENIX Association (2010)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. In: Proc. of STOC 1989, pp. 62\u201372. ACM Press (1989)","DOI":"10.1145\/73007.73013"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/11535218_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"I. Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 378\u2013394. Springer, Heidelberg (2005)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Evfimievski, A.V., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: Proc. of KDD 2002, pp. 217\u2013228 (2002)","DOI":"10.1145\/775079.775080"},{"key":"9_CR11","unstructured":"Frank, A., Asuncion, A.: UCI machine learning repository (2010)"},{"key":"9_CR12","unstructured":"Geisler, M.: Cryptographic Protocols: Theory and Implementation. PhD thesis, Aarhus University (2010)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Goethals, B.: Frequent set mining. In: The Data Mining and Knowledge Discovery Handbook, ch. 17, pp. 377\u2013397. Springer (2005)","DOI":"10.1007\/0-387-25465-X_17"},{"key":"9_CR14","series-title":"LNCS","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.\u00a03506, pp. 104\u2013120. Springer, Heidelberg (2005)"},{"issue":"9","key":"9_CR15","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 Transactions on Knowledge and Data Engineering\u00a016(9), 1026\u20131037 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9_CR16","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Efficient algorithms for discovering association rules. In: KDD Workshop, pp. 181\u2013192 (1994)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Rizvi, S., Haritsa, J.R.: Maintaining data privacy in association rule mining. In: Proc. of VLDB 2002, pp. 682\u2013693 (2002)","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"key":"9_CR18","unstructured":"The Sharemind framework, \n                    \n                      http:\/\/sharemind.cyber.ee\/"},{"issue":"11","key":"9_CR19","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"9_CR20","unstructured":"Toivonen, H.: Sampling large databases for association rules. In: Proc. of VLDB 1996, pp. 134\u2013145. Morgan Kaufmann (1996)"},{"key":"9_CR21","unstructured":"Yang, Z., Wright, R.N., Subramaniam, H.: Experimental analysis of a privacy-preserving scalar product protocol. Computer Systems: Science & Engineering\u00a021(1) (2006)"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"M.J. Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng.\u00a012(3), 372\u2013390 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. In: Proc. of KDD 2003, pp. 326\u2013335 (2003)","DOI":"10.1145\/956750.956788"}],"container-title":["Lecture Notes in Computer Science","Intelligence and Security Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30428-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:39:18Z","timestamp":1620128358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30428-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642304279","9783642304286"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30428-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}