{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T23:31:58Z","timestamp":1648683118586},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2011,5,15]],"date-time":"2011-05-15T00:00:00Z","timestamp":1305417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10207-011-0133-6","type":"journal-article","created":{"date-parts":[[2011,5,14]],"date-time":"2011-05-14T06:52:01Z","timestamp":1305355921000},"page":"301-319","source":"Crossref","is-referenced-by-count":1,"title":["CASSANDRA: a probabilistic, efficient, and privacy-preserving solution to compute set intersection"],"prefix":"10.1007","volume":"10","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","published-online":{"date-parts":[[2011,5,15]]},"reference":[{"key":"133_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 \u201903), pp. 86\u201397. (2003)","DOI":"10.1145\/872757.872771"},{"key":"133_CR2","doi-asserted-by":"crossref","first-page":"3.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. J. Exp. Algorithmics 14, 3.7\u20133.24 (2009)","journal-title":"J. Exp. Algorithmics"},{"key":"133_CR3","unstructured":"Chan, H., Perrig, A., Song, D.X.: Random key predistribution schemes for sensor networks. In: IEEE Symposium on Security and Privacy, p. 197. (2003)"},{"key":"133_CR4","doi-asserted-by":"crossref","unstructured":"Dachman-Soled, D., Malkin, T., Raykova, M., Yung, M.: Efficient robust private set intersection. In: Proceedings of the 7th International Conference on Applied Cryptography and Network Security, ACNS \u201909, pp. 125\u2013142. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-01957-9_8"},{"key":"133_CR5","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/MSP.2010.91","volume":"8","author":"E. De Cristofaro","year":"2010","unstructured":"De Cristofaro E., Kim J.: Some like it private: sharing confidential information based on oblivious authorization. IEEE Secur. Priv. 8, 18\u201324 (2010)","journal-title":"IEEE Secur. Priv."},{"key":"133_CR6","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Adaptive set intersections, unions, and differences. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201900), pp. 743\u2013752. (2000)"},{"key":"133_CR7","doi-asserted-by":"crossref","unstructured":"Di Pietro, R., Mancini, L.V., Mei, A., Panconesi, A., Radhakrishnan, J.: Redoubtable sensor networks. ACM Trans. Inf. Syst. Secur. 11(3), 13:1\u201313:22 (2008)","DOI":"10.1145\/1341731.1341734"},{"key":"133_CR8","doi-asserted-by":"crossref","unstructured":"Eschenauer, L., Gligor, V.: A key-management scheme for distributed sensor network. In: Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS \u201902), pp. 267\u2013282. (2002)","DOI":"10.1145\/586115.586117"},{"key":"133_CR9","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Proceedings of the 23rd Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT \u201904), pp. 1\u201319. (2004)","DOI":"10.1007\/978-3-540-24676-3_1"},{"issue":"1","key":"133_CR10","doi-asserted-by":"crossref","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. J. Theory Comput. 3(1), 211\u2013219 (2007)","journal-title":"J. Theory Comput."},{"key":"133_CR11","doi-asserted-by":"crossref","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Proceedings of the 5th Conference on Theory of Cryptography, TCC\u201908, pp. 155\u2013175. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"133_CR12","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Liu, X.: Fast secure computation of set intersection. In: Proceedings of the 7th International Conference on Security and Cryptography for Networks, SCN\u201910, pp. 418\u2013435. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15317-4_26"},{"issue":"4","key":"133_CR13","doi-asserted-by":"crossref","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 J. Discret. Math. 5(4), 545\u2013557 (1992)","journal-title":"SIAM J. Discret. Math."},{"key":"133_CR14","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Mitrofanova, A.: Testing disjointness of private datasets. In: Proceedings of the 9th International Conference on Financial Cryptography and Data Security (FC \u201905), pp. 109\u2013124. (2005)","DOI":"10.1007\/11507840_13"},{"key":"133_CR15","doi-asserted-by":"crossref","unstructured":"Kissner, L., Song, D.X.: Privacy-preserving set operations. In: Proceedings of the 25th Annual International Cryptology Conference (CRYPTO \u201905), pp. 241\u2013257. (2005)","DOI":"10.1007\/11535218_15"},{"issue":"2\u20133","key":"133_CR16","doi-asserted-by":"crossref","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. J. Theor. Comput. Sci. 49(2\u20133), 267\u2013282 (1987)","journal-title":"J. Theor. Comput. Sci."},{"key":"133_CR17","doi-asserted-by":"crossref","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, Cambridge (1997)"},{"key":"133_CR18","doi-asserted-by":"crossref","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":"133_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani R., Raghavan P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"133_CR20","doi-asserted-by":"crossref","unstructured":"Tsudik, G., Ateniese, G., De Cristofaro, E.: (if) size matters: size-hiding private set intersection. In: The 14th IACR International Conference on Practice and Theory of Public Key Cryptography (PKC) (2011)","DOI":"10.1007\/978-3-642-19379-8_10"},{"key":"133_CR21","doi-asserted-by":"crossref","unstructured":"Tsudik, G., De Cristofaro, E.: Practical private set intersection protocols with linear complexity. In: Financial Cryptography (2010)","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"133_CR22","doi-asserted-by":"crossref","unstructured":"Tsudik, G., De Cristofaro, E., Kim, J.: Linear-complexity private set intersection protocols secure in malicious model. In: The 16th Annual International Conference on the Theory and Application of Cryptology and Information Security (Asiacrypt) (2010)","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"133_CR23","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 \u201979), pp. 209\u2013213. (1979)","DOI":"10.1145\/800135.804414"},{"issue":"3","key":"133_CR24","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1504\/IJACT.2009.023471","volume":"1","author":"Q. Ye","year":"2009","unstructured":"Ye Q., Wang H., Pieprzyk J., Zhang X.M.: Unconditionally secure disjointness tests for private datasets. Int. J. Appl. Cryptogr. 1(3), 225\u2013235 (2009)","journal-title":"Int. J. Appl. Cryptogr."}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-011-0133-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-011-0133-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-011-0133-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T16:07:08Z","timestamp":1560182828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-011-0133-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,15]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["133"],"URL":"https:\/\/doi.org\/10.1007\/s10207-011-0133-6","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,15]]}}}