{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:23:53Z","timestamp":1725585833816},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214233"},{"type":"electronic","value":"9783642214240"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21424-0_18","type":"book-chapter","created":{"date-parts":[[2011,6,15]],"date-time":"2011-06-15T11:52:47Z","timestamp":1308138767000},"page":"223-234","source":"Crossref","is-referenced-by-count":0,"title":["Scalable Privacy-Preserving Data Mining with Asynchronously Partitioned Datasets"],"prefix":"10.1007","author":[{"given":"Hiroaki","family":"Kikuchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daisuke","family":"Kagawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anirban","family":"Basu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhiko","family":"Ishii","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masayuki","family":"Terada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sadayuki","family":"Hongo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","first-page":"522","volume-title":"SIAM International Conference on Data Mining","author":"J. Vaidya","year":"2004","unstructured":"Vaidya, J., Clifton, C.: Privacy Preserving Na\u00efve Bayes Classifier for Vertically Partitioned Data. In: SIAM International Conference on Data Mining, Lake Buena Vista, Florida, pp. 522\u2013526. Society of Industrial and Applied Mathematics, Philadelphia (2004)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","volume-title":"Peer-to-Peer Systems","author":"J. Douceur","year":"2002","unstructured":"Douceur, J.: The sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 251\u2013260. Springer, Heidelberg (2002)"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1109\/SP.2009.26","volume-title":"30th IEEE Symposium on Security and Privacy","author":"H. Yu","year":"2009","unstructured":"Yu, H., Shi, C., Kaminsky, M., Gibbons, P.B., Xiao, F.: DSybil: Optimal Sybil-resistance for Recommendation Systems. In: 30th IEEE Symposium on Security and Privacy, pp. 283\u2013298. IEEE, Los Alamitos (2009)"},{"key":"18_CR4","first-page":"162","volume-title":"27th Annual Symposium on Foundations of Computer Science","author":"A.C.C. Yao","year":"1986","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE, Los Alamitos (1986)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1109\/ICNSC.2010.5461512","volume-title":"International Conference on Networking, Sensing and Control (ICNSC)","author":"J. Zhou","year":"2010","unstructured":"Zhou, J., Luo, T.: A novel approach to solve the sparsity problem in collaborative filtering. In: International Conference on Networking, Sensing and Control (ICNSC), pp. 165\u2013170. IEEE, Los Alamitos (2010)"},{"key":"18_CR6","unstructured":"GroupLens: GroupLens Research, \n                    \n                      http:\/\/www.grouplens.org\/\n                    \n                    \n                   (2010)"},{"key":"18_CR7","first-page":"86","volume-title":"The ACM SIGMOD International Conference on Management of Data","author":"R. Agrawal","year":"2003","unstructured":"Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: The ACM SIGMOD International Conference on Management of Data, pp. 86\u201397. ACM, New York (2003)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M.J. Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"issue":"4","key":"18_CR9","doi-asserted-by":"crossref","first-page":"593","DOI":"10.3233\/JCS-2005-13401","volume":"13","author":"J. Vaidya","year":"2005","unstructured":"Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. Journal of Computer Security\u00a013(4), 593\u2013622 (2005)","journal-title":"Journal of Computer Security"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","first-page":"223","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":"18_CR11","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay \u2013 a secure two-party computation system. In: The 13th USENIX Conference on Security Symposium, p. 20. USENIX Association (2004)"},{"key":"18_CR12","first-page":"102","volume-title":"17th Annual Computer Security Applications Conference, ACSAC","author":"W. Du","year":"2001","unstructured":"Du, W., Atallah, M.J.: Privacy-preserving cooperative statistical analysis. In: 17th Annual Computer Security Applications Conference, ACSAC, pp. 102\u2013110. IEEE, Los Alamitos (2001)"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/ARES.2009.148","volume-title":"International Conference on Availability, Reliability and Security, ARES 2009","author":"H. Kikuchi","year":"2009","unstructured":"Kikuchi, H., Kizawa, H., Tada, M.: Privacy-Preserving Collaborative Filtering Schemes. In: International Conference on Availability, Reliability and Security, ARES 2009, pp. 911\u2013916. IEEE, Los Alamitos (2009)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1145\/371920.372071","volume-title":"The 10th International Conference on World Wide Web","author":"B. Sarwar","year":"2001","unstructured":"Sarwar, B., Karypis, G., Konstan, J., Reidl, J.: Item-based collaborative filtering recommendation algorithms. In: The 10th International Conference on World Wide Web, pp. 285\u2013295. ACM, New York (2001)"}],"container-title":["IFIP Advances in Information and Communication Technology","Future Challenges in Security and Privacy for Academia and Industry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21424-0_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T13:23:38Z","timestamp":1619789018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21424-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214233","9783642214240"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21424-0_18","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1861-2288"}],"subject":[],"published":{"date-parts":[[2011]]}}}