{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:54:58Z","timestamp":1725515698747},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705666"},{"type":"electronic","value":"9783540705673"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-70567-3_11","type":"book-chapter","created":{"date-parts":[[2008,7,15]],"date-time":"2008-07-15T03:57:37Z","timestamp":1216094257000},"page":"144-157","source":"Crossref","is-referenced-by-count":2,"title":["Secure Construction of Contingency Tables from Distributed Data"],"prefix":"10.1007","author":[{"given":"Haibing","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyun","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaideep","family":"Vaidya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nabil","family":"Adam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, D., Aggarwal, C.C.: On the design and quantification of privacy preserving data mining algorithms. In: Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 247\u2013255 (2001)","DOI":"10.1145\/375551.375602"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD Conference on Management of Data, pp. 439\u2013450 (2000)","DOI":"10.1145\/342009.335438"},{"key":"11_CR3","unstructured":"Bedi, R.: Money Laundering - Controls and Prevention, 1st edn. ISI Publications (2004)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-47721-7_19","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"J.C. Benaloh","year":"1987","unstructured":"Benaloh, J.C.: Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 251\u2013260. Springer, Heidelberg (1987)"},{"key":"11_CR5","volume-title":"Advances in Cryptology \u2013 Crypto 84 Proceedings","author":"M. Blum","year":"1984","unstructured":"Blum, M., Goldwasser, S.: An efficient probabilistic public-key encryption that hides all partial information. In: Blakely, R. (ed.) Advances in Cryptology \u2013 Crypto 84 Proceedings. Springer, Heidelberg (1984)"},{"key":"11_CR6","unstructured":"L.\u00a0Cauley.: Nsa has massive database of americans\u2019 phone calls (May 2006) (USA Today)."},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/772862.772867","volume":"4","author":"C. Clifton","year":"2003","unstructured":"Clifton, C., Kantarcioglu, M., Lin, X., Vaidya, J., Zhu, M.: Tools for privacy preserving distributed data mining. SIGKDD Explorations\u00a04(2), 28\u201334 (2003)","journal-title":"SIGKDD Explorations"},{"key":"11_CR8","first-page":"1269","volume":"11","author":"J. Cornfield","year":"1951","unstructured":"Cornfield, J.: A method of estimating comparative rates from clinical data: Applications to cancer of the lung, breast, and cervix. Journal of the National Cancer Institute\u00a011, 1269\u20131275 (1951)","journal-title":"Journal of the National Cancer Institute"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1111\/j.1467-9868.2005.00501.x","volume":"67","author":"P. Dellaportas","year":"2005","unstructured":"Dellaportas, P., Tarantola, C.: Model determination for categorical data with factor level merging. Journal of the Royal Statistical Society\u00a067, 269\u2013283 (2005)","journal-title":"Journal of the Royal Statistical Society"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 217\u2013228 (2002)","DOI":"10.1145\/775047.775080"},{"key":"11_CR11","volume-title":"The Analysis of Cross-classified Categorical Data","author":"S.E. Fienberg","year":"1980","unstructured":"Fienberg, S.E.: The Analysis of Cross-classified Categorical Data, 2nd edn. M.I.T. Press, Cambridge (1980)","edition":"2"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","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 Secure Scalar Product Computation for Privacy-Preserving Data Mining. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 104\u2013120. Springer, Heidelberg (2005)"},{"key":"11_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: General Cryptographic Protocols. In: The Foundations of Cryptography, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game - a completeness theorem for protocols with honest majority. In: 19th ACM Symposium on the Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Huang, Z., Du, W., Chen, B.: Deriving private information from randomized data. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, Baltimore, MD, June 13-16 (2005)","DOI":"10.1145\/1066157.1066163"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1145\/1081870.1081942","volume-title":"KDD 2005: Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining","author":"G. Jagannathan","year":"2005","unstructured":"Jagannathan, G., Wright, R.N.: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: KDD 2005: Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pp. 593\u2013599. ACM Press, New York (2005)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: On the privacy preserving properties of random data perturbation techniques. In: Proceedings of the Third IEEE International Conference on Data Mining (ICDM 2003) (2003)","DOI":"10.1109\/ICDM.2003.1250908"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","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, pp. 36\u201354. Springer, Heidelberg (2000)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/288090.288106","volume-title":"Proceedings of the 5th ACM conference on Computer and communications security","author":"D. Naccache","year":"1998","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: Proceedings of the 5th ACM conference on Computer and communications security, pp. 59\u201366. ACM Press, San Francisco (1998)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"T. Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A New Public-Key Cryptosystem as Secure as Factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 308\u2013318. Springer, Heidelberg (1998)"},{"key":"11_CR21","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":"11_CR22","doi-asserted-by":"crossref","unstructured":"Rizvi, S.J., Haritsa, J.R.: Maintaining data privacy in association rule mining. In: Proceedings of 28th International Conference on Very Large Data Bases. VLDB, Hong Kong, August 20-23, pp. 682\u2013693 (2002)","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. Journal of Computer Security\u00a013(4) (November 2005)","DOI":"10.3233\/JCS-2005-13401"},{"key":"11_CR24","series-title":"Advances in Information Security","volume-title":"Privacy-Preserving Data Mining","author":"J. Vaidya","year":"2005","unstructured":"Vaidya, J., Clifton, C., Zhu, M.: Privacy-Preserving Data Mining, 1st edn. Advances in Information Security. Springer, Heidelberg (2005)","edition":"1"},{"key":"11_CR25","first-page":"160","volume-title":"Proceedings of the 23th IEEE Symposium on Foundations of Computer Science","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computation (extended abstract). In: Proceedings of the 23th IEEE Symposium on Foundations of Computer Science, pp. 160\u2013164. IEEE, Los Alamitos (1982)"},{"key":"11_CR26","unstructured":"Yu, H., Vaidya, J.: Secure matrix addition (UIOWA Technical Report) (2004)"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security XXII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70567-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T13:15:35Z","timestamp":1557666935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70567-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705666","9783540705673"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70567-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}