{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:12:15Z","timestamp":1759133535995},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439357"},{"type":"electronic","value":"9783662439364"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43936-4_26","type":"book-chapter","created":{"date-parts":[[2014,6,27]],"date-time":"2014-06-27T08:05:04Z","timestamp":1403856304000},"page":"382-389","source":"Crossref","is-referenced-by-count":9,"title":["A Scalable and Efficient Privacy Preserving Global Itemset Support Approximation Using Bloom Filters"],"prefix":"10.1007","author":[{"given":"Vikas G.","family":"Ashok","sequence":"first","affiliation":[]},{"given":"Ravi","family":"Mukkamala","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TKDE.2006.14","volume":"18","author":"K. Liu","year":"2006","unstructured":"Liu, K., Kargupta, H., Ryan, J.: Random projection-based multiplicative data perturbation for privacy preserving distributed data mining. IEEE Trans. Knowledge and Data Engg.\u00a018(1), 92\u2013106 (2006)","journal-title":"IEEE Trans. Knowledge and Data Engg."},{"key":"26_CR2","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":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-01307-2_48","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M. Kantarcioglu","year":"2009","unstructured":"Kantarcioglu, M., Nix, R., Vaidya, J.: An efficient approximate protocol for privacy-preserving association rule mining. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS, vol.\u00a05476, pp. 515\u2013524. Springer, Heidelberg (2009)"},{"key":"26_CR4","volume-title":"Proceedings of the Third IEEE International Conference on Data Mining (ICDM 2003)","author":"H. Kargupta","year":"2003","unstructured":"Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: On the privacy preserving properties of random data perturbation techniques. In: Proceedings of the Third IEEE International Conference on Data Mining (ICDM 2003), November 19-22. IEEE Computer Society, Los Alamitos (2003)"},{"issue":"7","key":"26_CR5","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time Trade-offs in Hash coding with Allowable Errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"issue":"3","key":"26_CR6","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10844-006-0018-8","volume":"29","author":"L. Qiu","year":"2007","unstructured":"Qiu, L., Li, Y., Wu, X.: Preserving privacy in association rule mining with Bloom filters. Journal of Intelligent Information Systems\u00a029(3), 253\u2013278 (2007)","journal-title":"Journal of Intelligent Information Systems"},{"issue":"4","key":"26_CR7","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"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"L. Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"issue":"4","key":"26_CR9","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A. Andrei","year":"2004","unstructured":"Andrei, A., Mitzenmacher, M.: Network applications of Bloom filters: A survey. Internet Mathematics\u00a01(4), 485\u2013509 (2004)","journal-title":"Internet Mathematics"},{"key":"26_CR10","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol.\u00a02. Cambridge University Press (2009)"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XXVIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43936-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T00:54:00Z","timestamp":1558918440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43936-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439357","9783662439364"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43936-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}