{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:21Z","timestamp":1750307481672,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T00:00:00Z","timestamp":1280016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,7,25]]},"DOI":"10.1145\/1835804.1835867","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"483-492","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Collusion-resistant privacy-preserving data mining"],"prefix":"10.1145","author":[{"given":"Bin","family":"Yang","sequence":"first","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}]},{"given":"Hiroshi","family":"Nakagawa","sequence":"additional","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}]},{"given":"Issei","family":"Sato","sequence":"additional","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}]},{"given":"Jun","family":"Sakuma","sequence":"additional","affiliation":[{"name":"University of Tsukuba, Tsukuba, Japan"}]}],"member":"320","published-online":{"date-parts":[[2010,7,25]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-70992-5","volume-title":"Yu, Privacy-Preserving Data Mining: Models and Algorithms","author":"Aggarwal Charu","year":"2008","unstructured":"Charu C. Aggarwal , and Philip S . Yu, Privacy-Preserving Data Mining: Models and Algorithms , Springer-Verlag , 2008 . Charu C.Aggarwal, and Philip S. Yu, Privacy-Preserving Data Mining: Models and Algorithms, Springer-Verlag, 2008."},{"key":"e_1_3_2_2_2_1","first-page":"120","volume-title":"Dense Probabilistic Encryption. In Proceedings of the Workshop on Selected Areas of Cryptography. Kingston, ON.","author":"Benaloh J.","year":"1994","unstructured":"J. Benaloh , Dense Probabilistic Encryption. In Proceedings of the Workshop on Selected Areas of Cryptography. Kingston, ON. May 1994 . pp. 120 -- 128 . J. Benaloh, Dense Probabilistic Encryption. In Proceedings of the Workshop on Selected Areas of Cryptography. Kingston, ON. May 1994. pp. 120--128."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/128861.128862"},{"key":"e_1_3_2_2_5_1","volume-title":"Pattern Recognition and Machine Learning","author":"Bishop Christopher M.","year":"2006","unstructured":"Christopher M. Bishop , Pattern Recognition and Machine Learning , Springer , 2006 . Christopher M. Bishop, Pattern Recognition and Machine Learning, Springer, 2006."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF00195209","article-title":"On the Structure of the Privacy Hierarchy","author":"Chor B.","year":"1994","unstructured":"B. Chor , M. Gereb-Graus , and E. Kushilevitz , On the Structure of the Privacy Hierarchy , Journal of Cryptology , 1994 , pp. 7: 53 -- 60 . B. Chor, M. Gereb-Graus, and E. Kushilevitz, On the Structure of the Privacy Hierarchy, Journal of Cryptology, 1994, pp. 7: 53--60.","journal-title":"Journal of Cryptology"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.3013"},{"key":"e_1_3_2_2_8_1","first-page":"119","article-title":"A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System","volume":"2001","author":"Damg\u00e5rd I.","unstructured":"I. Damg\u00e5rd , M. Jurik : A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System . Public Key Cryptography 2001 : 119 -- 136 . I. Damg\u00e5rd, M. Jurik: A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System. Public Key Cryptography 2001: 119--136.","journal-title":"Public Key Cryptography"},{"key":"e_1_3_2_2_9_1","first-page":"591","volume-title":"Wang: On secure multi-party computation in black-box groups","author":"Desmedt Y.","year":"2007","unstructured":"Y. Desmedt , J. Pieprzyk , R. Steinfeld , H. Wang: On secure multi-party computation in black-box groups . In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622 , pp. 591 -- 612 . Springer , Heidelberg ( 2007 ) Y.Desmedt, J. Pieprzyk, R. Steinfeld, H. Wang: On secure multi-party computation in black-box groups. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 591--612. Springer, Heidelberg (2007)"},{"key":"e_1_3_2_2_10_1","first-page":"31","article-title":"Cryptosystem and a Signature Scheme Based on Discrete Logarithms","author":"ElGamal T.","year":"1985","unstructured":"T. ElGamal , A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms , IEEE Transactions on Information Theory , v. I T- 31 , n. 4, 1985 , pp469--472 or CRYPTO 84, pp10--18, Springer-Verlag. T. ElGamal, A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Transactions on Information Theory, v. IT-31, n. 4, 1985, pp469--472 or CRYPTO 84, pp10--18, Springer-Verlag.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"Goldreich O.","year":"2001","unstructured":"O. Goldreich , Foundations of Cryptography : Volume 1 , Basic Tools, Cambridge University Press , 2001 . O. Goldreich, Foundations of Cryptography: Volume 1, Basic Tools, Cambridge University Press, 2001."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"Goldreich O.","year":"2004","unstructured":"O. Goldreich , Foundations of Cryptography : Volume 2 , Basic Applications, Cambridge University Press , 2004 . O. Goldreich, Foundations of Cryptography: Volume 2, Basic Applications, Cambridge University Press, 2004."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_14_1","volume-title":"April","author":"Goldwasser S.","year":"1984","unstructured":"S. Goldwasser and S. Micali . Probabilistic Encryption. Journal of Computer and System Sciences (JCSS), 28(2):270--299 , April 1984 . Preliminary version in: 14th Annual ACM Symposium on Theory of Computing (STOC) . S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Sciences (JCSS), 28(2):270--299, April 1984. Preliminary version in: 14th Annual ACM Symposium on Theory of Computing (STOC)."},{"key":"e_1_3_2_2_15_1","first-page":"24","volume-title":"The ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD'02)","author":"Kantarcioglu M.","year":"2002","unstructured":"M. Kantarcioglu and C. Clifton . Privacy-preserving distributed mining of association rules on horizontally partitioned data . In The ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD'02) , pages 24 -- 31 , Madison, Wisconsin , June 2 2002 . M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. In The ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD'02), pages 24--31, Madison, Wisconsin, June 2 2002."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11555827_23"},{"key":"e_1_3_2_2_17_1","first-page":"36","volume-title":"Advances in Cryptology - CRYPTO","author":"Lindell Y.","year":"2000","unstructured":"Y. Lindell , B. Pinkas: Privacy preserving data mining . In Advances in Cryptology - CRYPTO 2000 , pages 36 -- 54 . Springer-Verlag , Aug . 20--24 2000. Y. Lindell, B. Pinkas: Privacy preserving data mining. In Advances in Cryptology - CRYPTO 2000, pages 36--54. Springer-Verlag, Aug. 20--24 2000."},{"key":"e_1_3_2_2_18_1","volume-title":"Proceedings of Usenix Security '2004","author":"Malkhi D.","year":"2004","unstructured":"D. Malkhi , N. Nisan , B. Pinkas and Y. Sella , Fairplay - A Secure Two-Party Computation System . Proceedings of Usenix Security '2004 , August 9-13, 2004 . D. Malkhi, N. Nisan, B. Pinkas and Y. Sella, Fairplay - A Secure Two-Party Computation System. Proceedings of Usenix Security '2004, August 9-13, 2004."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090104"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/288090.288106"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054135"},{"key":"e_1_3_2_2_22_1","volume-title":"International Conference on Security of Information and Networks","author":"Ozarar M.","year":"2007","unstructured":"M. Ozarar and A. Ozgit , Secure Multiparty Overall Mean Computation via Oblivious Polynomial Evaluation , International Conference on Security of Information and Networks , 2007 . M. Ozarar and A. Ozgit, Secure Multiparty Overall Mean Computation via Oblivious Polynomial Evaluation, International Conference on Security of Information and Networks, 2007."},{"key":"e_1_3_2_2_23_1","first-page":"223","volume-title":"Proceedings of EuroCrypt 99","author":"Paillier P.","year":"1998","unstructured":"P. Paillier , Public-Key Cryptosystems based on Composite Degree Residue Classes , Proceedings of EuroCrypt 99 , Springer Verlag LNCS series , 1998 , pp. 223 -- 238 . P. Paillier, Public-Key Cryptosystems based on Composite Degree Residue Classes, Proceedings of EuroCrypt 99, Springer Verlag LNCS series, 1998, pp. 223--238."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjdc.3.442"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956776"},{"key":"e_1_3_2_2_27_1","first-page":"593","volume-title":"Journal of Computer Security, v.13 n.4","author":"Vaidya J.","year":"2005","unstructured":"J. Vaidya , C. Clifton , Secure set intersection cardinality with application to association rule mining , Journal of Computer Security, v.13 n.4 , p. 593 -- 622 , July 2005 . J. Vaidya, C. Clifton, Secure set intersection cardinality with application to association rule mining, Journal of Computer Security, v.13 n.4, p.593--622, July 2005."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0041-y"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"KDD '10: The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Washington DC USA","acronym":"KDD '10"},"container-title":["Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835804.1835867","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1835804.1835867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:09:02Z","timestamp":1750248542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835804.1835867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,25]]},"references-count":29,"alternative-id":["10.1145\/1835804.1835867","10.1145\/1835804"],"URL":"https:\/\/doi.org\/10.1145\/1835804.1835867","relation":{},"subject":[],"published":{"date-parts":[[2010,7,25]]},"assertion":[{"value":"2010-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}