{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:04:22Z","timestamp":1725570262161},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161605"},{"type":"electronic","value":"9783642161612"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16161-2_17","type":"book-chapter","created":{"date-parts":[[2010,11,27]],"date-time":"2010-11-27T03:17:14Z","timestamp":1290827834000},"page":"290-306","source":"Crossref","is-referenced-by-count":1,"title":["CED2: Communication Efficient Disjointness Decision"],"prefix":"10.1007","author":[{"given":"Luciana","family":"Marconi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauro","family":"Conti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Di Pietro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: Proceedings of the 22th ACM SIGMOD international conference on Management of data (SIGMOD 2003), pp. 86\u201397 (2003)","DOI":"10.1145\/872757.872771"},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/1498698.1564507","volume":"14","author":"J. Barbay","year":"2009","unstructured":"Barbay, J., L\u00f3pez-Ortiz, A., Lu, T., Salinger, A.: An experimental investigation of set intersection algorithms for text searching. Journal of Experimental Algorithmics 14, 3.7\u20133.24 (2009)","journal-title":"Journal of Experimental Algorithmics"},{"key":"17_CR3","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Ian Munro, J.: Adaptive set intersections, unions, and differences. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 743\u2013752 (2000)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Eschenauer, L., Gligor, V.: A key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS 2002), pp. 267\u2013282 (2002)","DOI":"10.1145\/586110.586117"},{"key":"17_CR5","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)"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.4086\/toc.2007.v003a011","volume":"3","author":"J. H\u00e5stad","year":"2007","unstructured":"H\u00e5stad, J., Wigderson, A.: The randomized communication complexity of set disjointness. Journal Theory of Computing\u00a03(1), 211\u2013219 (2007)","journal-title":"Journal Theory of Computing"},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0405044","volume":"5","author":"B. Kalyanasundaram","year":"1992","unstructured":"Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics\u00a05(4), 545\u2013557 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"17_CR8","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: S. Patrick, A., Yung, M. (eds.) FC 2005. LNCS, vol.\u00a03570, pp. 109\u2013124. Springer, Heidelberg (2005)"},{"key":"17_CR9","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.X.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"issue":"2-3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(87)90010-7","volume":"49","author":"T.G. Kurtz","year":"1987","unstructured":"Kurtz, T.G., Manber, U.: A probabilistic distributed algorithm for set intersection and its analysis. Journal of Theoretical Computer Science\u00a049(2-3), 267\u2013282 (1987)","journal-title":"Journal of Theoretical Computer Science"},{"key":"17_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, New York (1997)"},{"key":"17_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (2005)"},{"key":"17_CR13","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1997","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1997)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Some complexity questions related to distributive computing. In: Proceedings of the eleventh annual ACM symposium on Theory of computing (STOC 1979), pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"},{"issue":"3","key":"17_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1504\/IJACT.2009.023471","volume":"1","author":"Q. Ye","year":"2009","unstructured":"Ye, Q., Wang, H., Pieprzyk, J., Mo Zhang, X.: Unconditionally secure disjointness tests for private datasets. International Journal of Applied Cryptography\u00a01(3), 225\u2013235 (2009)","journal-title":"International Journal of Applied Cryptography"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16161-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:45:38Z","timestamp":1559835938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16161-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161605","9783642161612"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16161-2_17","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2010]]}}}