{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T18:29:01Z","timestamp":1725820141065},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181226"},{"type":"electronic","value":"9783319181233"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18123-3_20","type":"book-chapter","created":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T07:51:48Z","timestamp":1428479508000},"page":"329-345","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Large-Scale Multi-party Counting Set Intersection Using a Space Efficient Global Synopsis"],"prefix":"10.1007","author":[{"given":"Dimitrios","family":"Karapiperis","sequence":"first","affiliation":[]},{"given":"Dinusha","family":"Vatsalan","sequence":"additional","affiliation":[]},{"given":"Vassilios S.","family":"Verykios","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Christen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,9]]},"reference":[{"key":"20_CR1","unstructured":"OTS SA (2014). http:\/\/www.ots.gr\/"},{"key":"20_CR2","first-page":"143","volume":"11","author":"L Adamic","year":"2002","unstructured":"Adamic, L., Huberman, B.: Zipf\u2019s law and the internet. Glottonmetrics 11, 143\u2013150 (2002)","journal-title":"Glottonmetrics"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-0-387-70992-5_2","volume":"34","author":"C Aggarwal","year":"2008","unstructured":"Aggarwal, C., Yu, P.: A general survey of privacy-preserving data mining models and algorithms. Adv. Datab. Sys. 34, 11\u201352 (2008)","journal-title":"Adv. Datab. Sys."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: SIGMOD, San Diego, California, USA, pp. 86\u201397 (2003)","DOI":"10.1145\/872757.872771"},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y Aumann","year":"2010","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: Efficient protocols for realistic adversaries. J. of Cryptol. 23(2), 281\u2013343 (2010)","journal-title":"J. of Cryptol."},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2002","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of Bloom filters: A survey. Internet Math. 1(4), 485\u2013509 (2002)","journal-title":"Internet Math."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Burkhart, M., Dimitropoulos, X.: Privacy-preserving distributed network troubleshooting - bridging the gap between theory and practice. ACM Trans. Inf. Sys. Sec. 14(4) (2011)","DOI":"10.1145\/2043628.2043632"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Automata, Languages and Programming","author":"Moses Charikar","year":"2002","unstructured":"Charikar, Moses, Chen, Kevin, Farach-Colton, Mart\u00edn: Finding frequent items in data streams. In: Widmayer, Peter, Triguero, Francisco, Morales, R., Hennessy, Matthew, Eidenbenz, Stephan, Conejo, Ricardo (eds.) ICALP 2002. LNCS, vol. 2380, pp. 693\u2013703. Springer, Heidelberg (2002)"},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/772862.772867","volume":"4","author":"C Clifton","year":"2002","unstructured":"Clifton, C., Kantarcioglou, M., Vaidya, J., Lin, X., Zhu, M.Y.: Tools for privacy preserving distributed data mining. ACM SIGKDD Explor. Newsl. 4(2), 28\u201334 (2002)","journal-title":"ACM SIGKDD Explor. Newsl."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, S., Matias, Y.: Spectral Bloom filters. In: SIGMOD, San Diego, California, pp. 241\u2013252 (2003)","DOI":"10.1145\/872757.872787"},{"key":"20_CR11","unstructured":"Cormode, G., Garofalakis, M.: Sketching streams through the net distributed approximate query tracking. In: VLDB, Trondheim, Norway, pp. 13\u201324 (2005)"},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the Count-Min sketch and its applications. J. of Algor. 55(1), 58\u201375 (2005)","journal-title":"J. of Algor."},{"issue":"4","key":"20_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1504\/IJACT.2012.048080","volume":"2","author":"D Dachman-Soled","year":"2012","unstructured":"Dachman-Soled, D., Malkin, T., Raykova, M., Yung, M.: Efficient robust private set intersection. Appl. Cryptog. 2(4), 289\u2013303 (2012)","journal-title":"Appl. Cryptog."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Dong, C., Chen, L., Wan, Z.: When private set intersection meets big data: an efficient and scalable protocol. In: SIGSAC, Berlin, Germany, pp. 789\u2013800 (2013)","DOI":"10.1145\/2508859.2516701"},{"key":"20_CR15","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":"Michael J Freedman","year":"2004","unstructured":"Freedman, Michael J., Nissim, Kobbi, Pinkas, Benny: Efficient private matching and set intersection. In: Cachin, Christian, Camenisch, Jan L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-72738-5_16","volume":"4521","author":"K Frikken","year":"2007","unstructured":"Frikken, K.: Privacy-preserving set union. Appl. Cryptog. Network Sec. 4521, 237\u2013252 (2007)","journal-title":"Appl. Cryptog. Network Sec."},{"issue":"2","key":"20_CR17","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0169-7552(94)90130-9","volume":"27","author":"S Glassman","year":"1994","unstructured":"Glassman, S.: A caching relay for the world wide web. Comput. Netw. ISDN Syst. 27(2), 165\u2013173 (1994)","journal-title":"Comput. Netw. ISDN Syst."},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: STOC, New York, USA, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-642-15838-4_24","volume-title":"Privacy in Statistical Databases","author":"Rob Hall","year":"2010","unstructured":"Hall, Rob, Fienberg, Stephen E.: Privacy-preserving record linkage. In: Domingo-Ferrer, Josep, Magkos, Emmanouil (eds.) PSD 2010. LNCS, vol. 6344, pp. 269\u2013283. Springer, Heidelberg (2010)"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-78524-8_10","volume-title":"Theory of Cryptography","author":"Carmit Hazay","year":"2008","unstructured":"Hazay, Carmit, Lindell, Yehuda: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti, Ran (ed.) TCC 2008. LNCS, vol. 4948, pp. 155\u2013175. Springer, Heidelberg (2008)"},{"key":"20_CR21","first-page":"81","volume":"54","author":"M Jauhari","year":"2007","unstructured":"Jauhari, M., Saxena, A., Gautam, J.: Zipf\u2019s law and the number of hits on the world wide web. Annals of Lib. and Inf. Studies 54, 81\u201384 (2007)","journal-title":"Annals of Lib. and Inf. Studies"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-87471-3_25","volume-title":"Privacy in Statistical Databases","author":"Murat Kantarcioglu","year":"2008","unstructured":"Kantarcioglu, Murat, Jiang, Wei, Malin, Bradley: A privacy-preserving framework for integrating person-specific databases. In: Domingo-Ferrer, Josep, Sayg\u0131n, Y\u00fccel (eds.) PSD 2008. LNCS, vol. 5262, pp. 298\u2013314. Springer, Heidelberg (2008)"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/11507840_13","volume-title":"Financial Cryptography and Data Security","author":"A Kiayias","year":"2005","unstructured":"Kiayias, A., Mitrofanova, A.: Testing disjointness of private datasets. In: Patrick, Andrew S., Yung, M. (eds.) FC 2005. LNCS 3570, vol. 3570, pp. 109\u2013124. Springer, Heidelberg (2005)"},{"key":"20_CR24","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":"Lea Kissner","year":"2005","unstructured":"Kissner, Lea, Song, Dawn: Privacy-preserving set operations. In: Shoup, Victor (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"issue":"11","key":"20_CR25","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1016\/j.comnet.2005.07.009","volume":"50","author":"S Krashakov","year":"2006","unstructured":"Krashakov, S., Teslyuk, A., Shchur, L.: On the universality of rank distributions of website popularity. Comp. Netw. 50(11), 1769\u20131780 (2006)","journal-title":"Comp. Netw."},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Krawczyk, H., Bellare, M., Canetti, R.: HMAC: keyed-hashing for message authentication, Internet RFC 2104 (1997). http:\/\/tools.ietf.org\/html\/rfc2104","DOI":"10.17487\/rfc2104"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Pinkas, B.: Secure multiparty computation for privacy-preserving data mining. J. Priv. Conf. 1(1) (2009)","DOI":"10.29012\/jpc.v1i1.566"},{"key":"20_CR28","unstructured":"Many, D., Burkhart, M., Dimitropoulos, X.: Fast private set operations with sepia. Tech. Rep. no. 345, ETH Zurich (2012)"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511814075"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: STOC, Atlanta, Georgia, USA, pp. 245\u2013254 (1999)","DOI":"10.1145\/301250.301312"},{"key":"20_CR31","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":"Pascal Paillier","year":"1999","unstructured":"Paillier, Pascal: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, Jacques (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 223. Springer, Heidelberg (1999)"},{"key":"20_CR32","unstructured":"Pierre, K., Lai, S., Yiu, K., Chow, C., Chong, L., Hui, C.: An efficient Bloom filter based solution for multiparty private matching. In: SAM (2006)"},{"issue":"1","key":"20_CR33","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/1111322.1111326","volume":"36","author":"M Roughan","year":"2006","unstructured":"Roughan, M., Zhang, Y.: Secure distributed data-mining and its application to large-scale network measurements. SIGCOMM Comput. Commun. Rev. 36(1), 7\u201314 (2006)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"Rusu, F., Dobra, A.: Statistical analysis of sketch estimators. In: SIGMOD, Beijing, China, pp. 187\u2013198 (2007)","DOI":"10.1145\/1247480.1247503"},{"issue":"6","key":"20_CR35","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1016\/j.is.2012.11.005","volume":"38","author":"D Vatsalan","year":"2013","unstructured":"Vatsalan, D., Christen, P., Verykios, V.S.: A taxonomy of privacy-preserving record linkage techniques. J. Inf. Sys. 38(6), 946\u2013969 (2013)","journal-title":"J. Inf. Sys."},{"key":"20_CR36","doi-asserted-by":"crossref","unstructured":"Yao, A.: How to generate and exchange secrets. In: SFCS, Toronto, Canada, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18123-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:10:51Z","timestamp":1676938251000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18123-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181226","9783319181233"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18123-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1007%2F978-3-319-18123-3_20', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid123' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:123', '*');; return false;" style='text-decoration: none; '>INTERN </a> <a style='color: white;' href='#diffid123'><sup>5</sup></a></div><div><a href='#diffid878' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:878', '*');; return false;" style='text-decoration: none; '>Note </a> <a style='color: white;' href='#diffid878'><sup>9</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>