{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:34:26Z","timestamp":1794339266545,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540330523","type":"print"},{"value":"9783540330585","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11689522_14","type":"book-chapter","created":{"date-parts":[[2006,2,25]],"date-time":"2006-02-25T01:47:58Z","timestamp":1140832078000},"page":"142-152","source":"Crossref","is-referenced-by-count":2,"title":["More on Shared-Scalar-Product Protocols"],"prefix":"10.1007","author":[{"given":"Huafei","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Bao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tieyan","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Proc. of EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient Proofs that a Committed Number Lies in an Interval. In: Proc. of EUROCRYPT 2000, pp. 431\u2013444. Springer, Heidelberg (2000)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: FOCS 2001, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24638-1_13","volume-title":"Theory of Cryptography","author":"R. Cramer","year":"2004","unstructured":"Cramer, R., Damg\u00e5rd, I.B.: Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 223\u2013237. Springer, Heidelberg (2004)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"D. Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet Databases with Observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 89\u2013105. Springer, Heidelberg (1993)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J.L. Camenisch","year":"2003","unstructured":"Camenisch, J.L., Shoup, V.: Practical Verifiable Encryption and Decryption of Discrete Logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 126\u2013144. Springer, Heidelberg (2003)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"I.B. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I.B., Fujisaki, E.: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 125\u2013142. Springer, Heidelberg (2002)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-45664-3_9","volume-title":"Public Key Cryptography","author":"I.B. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I.B., Jurik, M.: Client\/Server Tradeoffs for Online Elections. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 125\u2013140. Springer, Heidelberg (2002)"},{"key":"14_CR8","unstructured":"Du, W., Zhan, Z.: Building decision tree classifier on private data. In: Proceedings of the IEEE ICDM Workshop on Privacy, Security and Data Mining (2002)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"14_CR10","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":"14_CR11","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 (2002)","DOI":"10.1109\/ICPP.2002.1040894"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Jagannathan, Wright, R.N.: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: KDD 2005, pp. 593\u2013599 (2005)","DOI":"10.1145\/1081870.1081942"},{"key":"14_CR13","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":"14_CR14","doi-asserted-by":"crossref","unstructured":"Pinkas, B.: Cryptographic Techniques for Privacy-Preserving Data Mining. In: Newsletter of the ACM Special Interest Group on Knowledge Discovery and Data Mining (January 2003)","DOI":"10.1145\/772862.772865"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Verykios, V.S., Bertino, E., Fovino, I.N., Provenza, L.P., Saygin, Y., Theodoridis, Y.: State-of-the-art in Privacy Preserving Data Mining. In: SIGMOD Record. (2004)","DOI":"10.1145\/974121.974131"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: The 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 639\u2013644 (2002)","DOI":"10.1145\/775047.775142"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/11555827_13","volume-title":"Computer Security \u2013 ESORICS 2005","author":"H. Zhu","year":"2005","unstructured":"Zhu, H., Bao, F.: Augmented Oblivious Polynomial Evaluation Protocol and Its Applications. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol.\u00a03679, pp. 222\u2013230. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11689522_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:17:50Z","timestamp":1619493470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11689522_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330523","9783540330585"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11689522_14","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11689522","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}