{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:25Z","timestamp":1725558985326},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259992"},{"type":"electronic","value":"9783540320630"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427995_7","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T23:27:06Z","timestamp":1279063626000},"page":"72-80","source":"Crossref","is-referenced-by-count":6,"title":["Private Mining of Association Rules"],"prefix":"10.1007","author":[{"given":"Justin","family":"Zhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stan","family":"Matwin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LiWu","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-24676-3_3","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"G. Aggarwal","year":"2004","unstructured":"Aggarwal, G., Mishra, N., Pinkas, B.: Secure computation of the k th-ranked element. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 40\u201355. Springer, Heidelberg (2004)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) Proceedings of ACM SIGMOD Conference on Management of Data, Washington D.C, May 1993, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1145\/342009.335438","volume-title":"Proceedings of the ACM SIGMOD Conference on Management of Data","author":"R. Agrawal","year":"2000","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the ACM SIGMOD Conference on Management of Data, May 2000, pp. 439\u2013450. ACM Press, New York (2000)"},{"key":"7_CR4","unstructured":"Du, W., Zhan, Z.: Building decision tree classifier on private data. In: Workshop on Privacy, Security, and Data Mining at The 2002 IEEE International Conference on Data Mining (ICDM 2002), Maebashi City, Japan, December 9 (2002)"},{"key":"7_CR5","unstructured":"Dwork, C., Nissim, K.: Privacy-preserving datamining on vertically partitioned databases"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Freedman, M., Nissim, K., Pinkas, B.: Effiicent private matching and set intersection. In: EUROCRYPT, pp. 1\u201319 (2004)","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"7_CR7","unstructured":"Goldreich, O.: Secure multi-party computation (working draft) (1998), http:\/\/www.wisdom.weizmann.ac.il\/home\/oded\/public_html\/foc.html"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.W.: Privacy preserving association rule mining in vertically partitioned data. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, July 23-26 (2002)","DOI":"10.1145\/775047.775142"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (2000)"},{"key":"7_CR10","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 1999","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":"7_CR11","doi-asserted-by":"crossref","unstructured":"Sweeney, L.: k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems\u00a010(5), 557\u2013570","DOI":"10.1142\/S0218488502001648"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Wright, R., Yang, Z.: Privacy-preserving bayesian network structure computation on distributed heterogeneous data. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD (2004)","DOI":"10.1145\/1014052.1014145"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Intelligence and Security Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427995_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:56:53Z","timestamp":1605643013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427995_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259992","9783540320630"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11427995_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}