{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T11:56:58Z","timestamp":1669723018992},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s11390-013-1319-3","type":"journal-article","created":{"date-parts":[[2013,2,1]],"date-time":"2013-02-01T16:52:54Z","timestamp":1359737574000},"page":"152-158","source":"Crossref","is-referenced-by-count":4,"title":["A Secure Scalar Product Protocol Against Malicious Adversaries"],"prefix":"10.1007","volume":"28","author":[{"given":"Bo","family":"Yang","sequence":"first","affiliation":[]},{"given":"Yong","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Chung-Huang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,1]]},"reference":[{"key":"1319_CR1","doi-asserted-by":"crossref","unstructured":"Tran D H, Ng W K, Lim H W et al. An efficient cacheable secure scalar product protocol for privacy-preserving data mining. In Proc. the 13th Int. Conf. Data Warehousing and Knowledge Discovery, Aug. 29-Sept. 2, 2011, pp.354-366.","DOI":"10.1007\/978-3-642-23544-3_27"},{"key":"1319_CR2","doi-asserted-by":"crossref","unstructured":"Goethals B, Laur S, Lipmaa H, Mielikainen T. On private scalar product computation for privacy-preserving data mining. In Proc. the 7th Int. Conf. Information Security and Cryptology, Dec. 2004, pp.104-120.","DOI":"10.1007\/11496618_9"},{"key":"1319_CR3","doi-asserted-by":"crossref","unstructured":"Vaidya J, Clifton C. Privacy preserving association rule mining in vertically partitioned data. In Proc. the 8th SIGKDD Int. Conf. Knowledge Discovery and Data Mining, July 2002, pp.639-644.","DOI":"10.1145\/775047.775142"},{"key":"1319_CR4","unstructured":"Du W, Atallah M. Privacy-preserving cooperative statistical analysis. In Proc. the 17th Annual Computer Security Applications Conference, Dec. 2001, pp.102-110."},{"key":"1319_CR5","doi-asserted-by":"crossref","unstructured":"Atallah M J, Du W. Secure multiparty computational geometry. In Proc. the 7th International Workshop on Algorithms and Data Structures, Aug. 2011, pp.165-179.","DOI":"10.1007\/3-540-44634-6_16"},{"issue":"1","key":"1319_CR6","first-page":"1","volume":"9","author":"T Thomas","year":"2009","unstructured":"Thomas T. Secure Two-party protocols for point inclusion problem. Int. J. Network Security, 2009, 9(1): 1-7.","journal-title":"Int. J. Network Security"},{"issue":"1","key":"1319_CR7","first-page":"29","volume":"8","author":"B Yang","year":"2011","unstructured":"Yang B, Sun A D, Zhang W Z. Secure two-party protocols on planar circles. Journal of Information & Computational Science, 2011, 8(1): 29-40.","journal-title":"Journal of Information & Computational Science"},{"issue":"4","key":"1319_CR8","first-page":"915","volume":"9","author":"B Yang","year":"2012","unstructured":"Yang B, Shao Z Y, Zhang W Z. Secure two-party protocols on planar convex hulls. Journal of Information & Computational Science, 2012, 9(4): 915-929.","journal-title":"Journal of Information & Computational Science"},{"key":"1319_CR9","unstructured":"Du W, Zhan Z. Building decision tree classifier on private data. In Proc. IEEE ICDM Workshop on Privacy, Security, and Data Mining, Dec. 2002, Vol.14, pp.1-8."},{"key":"1319_CR10","unstructured":"Amirbekyan A, Estivill-Castro V E C. A new efficient privacy-preserving scalar product protocol. In Proc. the 6th Australasian Data Mining Conference, Dec. 2007, pp.209-214."},{"key":"1319_CR11","unstructured":"Hazay C. Efficient two-party computation with simulation based security [Ph.D. Thesis]. Senate of Bar-Ilan University, Israel, 2009."},{"key":"1319_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography (Vol.2): Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich O. Foundations of Cryptography (Vol.2): Basic Applications. London, UK: Cambridge University Press, 2004."},{"issue":"3","key":"1319_CR13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"CP Schnorr","year":"1991","unstructured":"Schnorr C P. Efficient signature generation by smart cards. Journal of Cryptology, 1991, 4(3): 161-174.","journal-title":"Journal of Cryptology"},{"key":"1319_CR14","doi-asserted-by":"crossref","unstructured":"Camenisch J, Shoup V. Practical verifiable encryption and decryption of discrete logarithms. In Proc. CRYPTO 2003, Aug. 2003, pp.126-144.","DOI":"10.1007\/978-3-540-45146-4_8"},{"key":"1319_CR15","doi-asserted-by":"crossref","unstructured":"Paillier P. Public-key cryptosystems based on composite degree residue classes. In Proc. the 17th Theory and Application of Cryptographic Techniques, May 1999, pp.223-238.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"1319_CR16","doi-asserted-by":"crossref","unstructured":"Jarecki S, Liu X. Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In Proc. the 6th Theory of Cryptography Conference, March 2009, pp.577-594.","DOI":"10.1007\/978-3-642-00457-5_34"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-013-1319-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-013-1319-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-013-1319-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T03:54:06Z","timestamp":1562644446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-013-1319-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["1319"],"URL":"https:\/\/doi.org\/10.1007\/s11390-013-1319-3","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]}}}