{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:58:02Z","timestamp":1769299082657,"version":"3.49.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319066073","type":"print"},{"value":"9783319066080","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06608-0_50","type":"book-chapter","created":{"date-parts":[[2014,5,8]],"date-time":"2014-05-08T01:40:40Z","timestamp":1399513240000},"page":"606-617","source":"Crossref","is-referenced-by-count":21,"title":["A Fast Secure Dot Product Protocol with Application to Privacy Preserving Association Rule Mining"],"prefix":"10.1007","author":[{"given":"Changyu","family":"Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liqun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Evfimievski, A.V., Srikant, R.: Information sharing across private databases. In: SIGMOD Conference, pp. 86\u201397 (2003)","DOI":"10.1145\/872757.872771"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: SIGMOD Conference, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"50_CR3","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487\u2013499 (1994)"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: SIGMOD Conference, pp. 439\u2013450 (2000)","DOI":"10.1145\/335191.335438"},{"key":"50_CR5","unstructured":"Amirbekyan, A., Estivill-Castro, V.: A new efficient privacy-preserving scalar product protocol. In: AusDM, pp. 209\u2013214 (2007)"},{"key":"50_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-35404-5_17","volume-title":"Cryptology and Network Security","author":"E. Cristofaro De","year":"2012","unstructured":"De Cristofaro, E., Gasti, P., Tsudik, G.: Fast and private computation of cardinality of set intersection and union. In: Pieprzyk, J., Sadeghi, A.-R., Manulis, M. (eds.) CANS 2012. LNCS, vol.\u00a07712, pp. 218\u2013231. Springer, Heidelberg (2012)"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Dong, C., Chen, L., Wen, Z.: When private set intersection meets big data: An efficient and scalable protocol. In: ACM Conference on Computer and Communications Security (2013)","DOI":"10.1145\/2508859.2516701"},{"key":"50_CR8","unstructured":"Du, W., Atallah, M.J.: Privacy-preserving cooperative statistical analysis. In: ACSAC, pp. 102\u2013110 (2001)"},{"key":"50_CR9","unstructured":"Du, W., Zhan, Z.: Building decision tree classifier on private data. In: Proceedings of the IEEE International Conference on Privacy, Security and Data Mining, CRPIT \u201914, Darlinghurst, Australia, vol.\u00a014, pp. 1\u20138. Australian Computer Society, Inc. (2002)"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"Evfimievski, A.V., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: KDD, pp. 217\u2013228 (2002)","DOI":"10.1145\/775079.775080"},{"key":"50_CR11","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":"50_CR12","unstructured":"GMP, http:\/\/gmplib.org\/"},{"key":"50_CR13","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., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 104\u2013120. Springer, Heidelberg (2005)"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography, Basic Applications, vol.\u00a02. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: STOC, pp. 365\u2013377 (1982)","DOI":"10.1145\/800070.802212"},{"key":"50_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-01307-2_5","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"X. He","year":"2009","unstructured":"He, X., Vaidya, J., Shafiq, B., Adam, N., Terzi, E., Grandison, T.: Efficient privacy-preserving link discovery. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS, vol.\u00a05476, pp. 16\u201327. Springer, Heidelberg (2009)"},{"key":"50_CR17","doi-asserted-by":"crossref","unstructured":"Huang, Z., Du, W., Chen, B.: Deriving private information from randomized data. In: SIGMOD Conference, pp. 37\u201348 (2005)","DOI":"10.1145\/1066157.1066163"},{"key":"50_CR18","doi-asserted-by":"crossref","unstructured":"Ioannidis, I., Grama, A., Atallah, M.J.: A secure protocol for computing dot-products in clustered and distributed environments. In: ICPP, pp. 379\u2013384 (2002)","DOI":"10.1109\/ICPP.2002.1040894"},{"key":"50_CR19","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. In: DMKD (2002)"},{"key":"50_CR20","unstructured":"Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: On the privacy preserving properties of random data perturbation techniques. In: ICDM, pp. 99\u2013106 (2003)"},{"key":"50_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Lindell","year":"2000","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 36\u201354. Springer, Heidelberg (2000)"},{"key":"50_CR22","unstructured":"OpenSSL, http:\/\/www.openssl.org\/"},{"key":"50_CR23","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":"50_CR24","doi-asserted-by":"crossref","unstructured":"Rizvi, S., Haritsa, J.R.: Maintaining data privacy in association rule mining. In: VLDB, pp. 682\u2013693 (2002)","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"key":"50_CR25","unstructured":"Tassa, T.: Secure mining of association rules in horizontally distributed databases. IEEE Transactions on Knowledge and Data Engineering\u00a099(PrePrints), 1 (2013)"},{"issue":"1","key":"50_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc-2012-0007","volume":"7","author":"T. Tassa","year":"2013","unstructured":"Tassa, T., Jarrous, A., Ben-Ya\u2019akov, Y.: Oblivious evaluation of multivariate polynomials. J. Mathematical Cryptology\u00a07(1), 1\u201329 (2013)","journal-title":"J. Mathematical Cryptology"},{"key":"50_CR27","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C., Zhu, Y.: Privacy Preserving Data Mining. Advances in Information Security. Springer (2006)","DOI":"10.1007\/11362197_11"},{"key":"50_CR28","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: KDD, pp. 639\u2013644 (2002)","DOI":"10.1145\/775107.775142"},{"issue":"4","key":"50_CR29","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"},{"issue":"4","key":"50_CR30","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s00778-006-0041-y","volume":"17","author":"J. Vaidya","year":"2008","unstructured":"Vaidya, J., Kantarcioglu, M., Clifton, C.: Privacy-preserving na\u00efve bayes classification. VLDB J.\u00a017(4), 879\u2013898 (2008)","journal-title":"VLDB J."},{"key":"50_CR31","doi-asserted-by":"crossref","unstructured":"Wong, W.K., Cheung, D.W.L., Kao, B., Mamoulis, N.: Secure knn computation on encrypted databases. In: SIGMOD Conference, pp. 139\u2013152 (2009)","DOI":"10.1145\/1559845.1559862"},{"key":"50_CR32","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-30116-5_44","volume-title":"Knowledge Discovery in Databases: PKDD 2004","author":"N. Zhang","year":"2004","unstructured":"Zhang, N., Wang, S., Zhao, W.: A new scheme on privacy preserving association rule mining. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol.\u00a03202, pp. 484\u2013495. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06608-0_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T20:50:30Z","timestamp":1746219030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06608-0_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319066073","9783319066080"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06608-0_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}