{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:51:28Z","timestamp":1725637888626},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642271885"},{"type":"electronic","value":"9783642271892"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-27189-2_1","type":"book-chapter","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T09:52:18Z","timestamp":1322819538000},"page":"1-10","source":"Crossref","is-referenced-by-count":2,"title":["On Fast Private Scalar Product Protocols"],"prefix":"10.1007","author":[{"given":"Ju-Sung","family":"Kang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dowon","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Amirbekyan, A., Estivill-Castro, V.: A new efficient privacy-preserving scalar product protocol. In: The 6th Australian Data Mining Conference (AusDM 2007), pp. 205\u2013210 (2007)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-44634-6_16","volume-title":"Algorithms and Data Structures","author":"M.J. Atallah","year":"2001","unstructured":"Atallah, M.J., Du, W.: Secure Multi-Party Computational Geometry. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 165\u2013179. Springer, Heidelberg (2001)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-47721-7_17","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"G. Brassard","year":"1987","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.M.: All-or-Nothing Disclosure of Secrets. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 234\u2013238. Springer, Heidelberg (1987)"},{"issue":"2","key":"1_CR4","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., Vaida, J., Zhu, M.: Tools for privacy preserving distributed data mining. SIGKDD Explorations\u00a04(2), 28\u201334 (2003)","journal-title":"SIGKDD Explorations"},{"key":"1_CR5","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":"1_CR6","unstructured":"Du, W., Atallah, M.: Privacy-preserving statistical analysis. In: Proceedings of the 17th Annual Computer Security Applications Conference, pp. 102\u2013110 (2001)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Du, W., Atallah, M.: Protocols for secure remote database access with approximate matching, CERIAS Tech Report 2001-02, Department of Computer Sciences, Purdue University (2001)","DOI":"10.1007\/978-1-4615-1467-1_6"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully Homomorphic Encryption Using Ideal Lattices. In: The 41st ACM Symposium on Theory of Computing, STOC (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"1_CR9","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 Private 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":"1_CR10","unstructured":"Goldreich, O.: Secure Multi-Party Computation, Final Draft Version 1.4 (2002), http:\/\/www.wisdom.weizmann.ac.il\/"},{"key":"1_CR11","unstructured":"Huang, Y., Lu, Z., Hu, H.: Privacy preserving association rule mining with scalar product. In: Proceedings of NLP-KE 2005, pp. 750\u2013755. IEEE (2005)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Ioannidis, I., Grama, A., Atallah, M.: A secure protocol for computing dot-products in clustered and distributed environments. In: Proceedings of the International Conference on Parallel Processing, ICPP 2002 (2002)","DOI":"10.1109\/ICPP.2002.1040894"},{"key":"1_CR13","unstructured":"Laur, S., Lipma, H.: On private similarity search protocols. In: Proceedings of 9th Nordic Workshop on Secure IT Systems (NordSec 2004), pp. 73\u201377 (2004)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proceedings of the 31st ACM Symposium on Theory of Computing, pp. 245\u2013254 (1999)","DOI":"10.1145\/301250.301312"},{"key":"1_CR15","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":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-540-74553-2_39","volume-title":"Data Warehousing and Knowledge Discovery","author":"D. Trinc\u0103","year":"2007","unstructured":"Trinc\u0103, D., Rajasekaran, S.: Fast Cryptographic Multi-Party Protocols for Computing Boolean Scalar Products with Applications to Privacy-Preserving Association Rule Mining in Vertically Partitioned Data. In: Song, I.-Y., Eder, J., Nguyen, T.M. (eds.) DaWaK 2007. LNCS, vol.\u00a04654, pp. 418\u2013427. Springer, Heidelberg (2007)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partioned data. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 639\u2013634 (2002)","DOI":"10.1145\/775107.775142"}],"container-title":["Communications in Computer and Information Science","Security Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27189-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T01:48:52Z","timestamp":1560995332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27189-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642271885","9783642271892"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27189-2_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}