{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,20]],"date-time":"2026-11-20T18:39:54Z","timestamp":1795199994971,"version":"4.10.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540262268","type":"print"},{"value":"9783540320838","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496618_9","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T16:27:32Z","timestamp":1279038452000},"page":"104-120","source":"Crossref","is-referenced-by-count":155,"title":["On Private Scalar Product Computation for Privacy-Preserving Data Mining"],"prefix":"10.1007","author":[{"given":"Bart","family":"Goethals","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sven","family":"Laur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Helger","family":"Lipmaa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Taneli","family":"Mielik\u00e4inen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"W. Aiello","year":"2001","unstructured":"Aiello, W., Ishai, Y., Reingold, O.: Priced Oblivious Transfer: How to Sell Digital Goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 119\u2013135. Springer, Heidelberg (2001)"},{"key":"9_CR2","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI\/MIT Press (1996)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-45571-X_9","volume-title":"Knowledge Discovery and Data Mining. Current Issues and New Applications","author":"J.-F. Boulicaut","year":"2000","unstructured":"Boulicaut, J.-F., Bykowski, A.: Frequent Closures as a Concise Representation for Binary Data Mining. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol.\u00a01805, pp. 62\u201373. Springer, Heidelberg (2000)"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J.-F. Boulicaut","year":"2003","unstructured":"Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries. Data Mining and Knowledge Discovery\u00a07(1), 5\u201322 (2003)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A Secure and Optimally Efficient Multi-Authority Election Scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Heidelberg (1997)"},{"key":"9_CR6","unstructured":"Du, W., Atallah, M.J.: Privacy-Preserving Statistical Analysis. In: Proceedings of the 17th Annual Computer Security Applications Conference, New Orleans, Louisiana, USA, December 10\u201314, pp. 102\u2013110 (2001)"},{"key":"9_CR7","unstructured":"Du, W., Atallah, M.J.: Protocols for Secure Remote Database Access with Approximate Matching. Advances in Information Security, vol. 2, pp. 192. Kluwer Academic Publishers, Boston (2001), \n                    \n                      http:\/\/www.wkap.nl\/prod\/b\/0-7923-7399-5"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A Generalisation, a Simplification and Some Applications of Paillier\u2019s Probabilistic Public-Key System. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"9_CR9","first-page":"127","volume-title":"Proceedings of New Security Paradigms Workshop","author":"W. Du","year":"2002","unstructured":"Du, W., Zhan, Z.: A Practical Approach to Solve Secure Multi-party Computation Problems. In: Marceau, C., Foley, S. (eds.) Proceedings of New Security Paradigms Workshop, Virginia Beach, virginia, USA, September\u00a023\u201326, pp. 127\u2013135. ACM Press, New York (2002)"},{"key":"9_CR10","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)"},{"key":"9_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-36504-4_7","volume-title":"Financial Cryptography","author":"H. Lipmaa","year":"2003","unstructured":"Lipmaa, H., Asokan, N., Niemi, V.: Secure Vickrey Auctions without Threshold Trust. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, pp. 87\u2013101. Springer, Heidelberg (2003)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-40061-5_26","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"H. Lipmaa","year":"2003","unstructured":"Lipmaa, H.: On Diophantine Complexity and Statistical Zero-Knowledge Arguments. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 398\u2013415. Springer, Heidelberg (2003)"},{"key":"9_CR14","unstructured":"Lipmaa, H.: An Oblivious Transfer Protocol with Log-Squared Total Communication. Technical Report 2004\/063, International Association for Cryptologic Research, February\u00a025 (2004)"},{"key":"9_CR15","unstructured":"Laur, S., Lipmaa, H.: On Private Similarity Search Protocols. In: Liimatainen, S., Virtanen, T. (eds.) Proceedings of the Ninth Nordic Workshop on Secure IT Systems (NordSec 2004), Espoo, Finland, November\u00a04\u20135, pp. 73\u201377 (2004)"},{"key":"9_CR16","unstructured":"Laur, S., Lipmaa, H.: Additive Conditional Disclosure of Secrets (manuscript) (January 2005)"},{"key":"9_CR17","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":"9_CR18","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An efficient algorithm for mining frequent closed itemsets. In: 2000 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (2000)"},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/772862.772865","volume":"4","author":"B. Pinkas","year":"2002","unstructured":"Pinkas, B.: Cryptographic Techniques for Privacy-Preserving Data Mining. KDD Explorations\u00a04(2), 12\u201319 (2002)","journal-title":"KDD Explorations"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1145\/775047.775142","volume-title":"Proceedings of The 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"J. Vaidya","year":"2002","unstructured":"Vaidya, J., Clifton, C.: 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\u201326, pp. 639\u2013644. ACM, New York (2002)"},{"key":"9_CR21","volume-title":"A Cource in Combinatorics","author":"J.H. Lint van","year":"1992","unstructured":"van Lint, J.H., Wilson, R.M.: A Cource in Combinatorics. Cambridge University Press, Cambridge (1992)"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1145\/1014052.1014145","volume-title":"Proceedings of The Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"R.N. Wright","year":"2004","unstructured":"Wright, R.N., Yang, Z.: Privacy-Preserving Bayesian Network Structure Computation on Distributed Heterogeneous Data. In: Proceedings of The Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, Washington, USA, pp. 713\u2013718. ACM, New York (2004)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496618_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:01:41Z","timestamp":1558281701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496618_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262268","9783540320838"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11496618_9","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b137120","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}