{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:22:08Z","timestamp":1725906128242},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319641997"},{"type":"electronic","value":"9783319642000"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-64200-0_10","type":"book-chapter","created":{"date-parts":[[2017,7,26]],"date-time":"2017-07-26T12:58:41Z","timestamp":1501073921000},"page":"159-178","source":"Crossref","is-referenced-by-count":0,"title":["Security Analysis of a Verifiable Server-Aided Approximate Similarity Computation"],"prefix":"10.1007","author":[{"given":"Rui","family":"Xu","sequence":"first","affiliation":[]},{"given":"Kirill","family":"Morozov","sequence":"additional","affiliation":[]},{"given":"Anirban","family":"Basu","sequence":"additional","affiliation":[]},{"given":"Mohammad Shahriar","family":"Rahman","sequence":"additional","affiliation":[]},{"given":"Shinsaku","family":"Kiyomoto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,27]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-35890-6_7","volume-title":"Data Privacy Management and Autonomous Spontaneous Security","author":"C Blundo","year":"2013","unstructured":"Blundo, C., Cristofaro, E., Gasti, P.: EsPRESSo: efficient privacy-preserving evaluation of sample set similarity. In: Pietro, R., Herranz, J., Damiani, E., State, R. (eds.) DPM\/SETOP -2012. LNCS, vol. 7731, pp. 89\u2013103. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-35890-6_7"},{"key":"10_CR2","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. In: Compression and Complexity of Sequences 1997, Proceedings, pp. 21\u201329. IEEE (1997)"},{"key":"10_CR3","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","year":"2012","unstructured":"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. 7712, pp. 218\u2013231. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-35404-5_17"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Dong, C., Chen, L., Wen, Z.: When private set intersection meets big data: an efficient and scalable protocol. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 789\u2013800. ACM (2013)","DOI":"10.1145\/2508859.2516701"},{"issue":"1","key":"10_CR5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s00145-014-9190-0","volume":"29","author":"MJ Freedman","year":"2016","unstructured":"Freedman, M.J., Hazay, C., Nissim, K., Pinkas, B.: Efficient set intersection with simulation-based security. J. Cryptology 29(1), 115\u2013155 (2016)","journal-title":"J. Cryptology"},{"key":"10_CR6","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: NDSS (2012)"},{"key":"10_CR7","first-page":"81","volume":"31","author":"P Jaccard","year":"1902","unstructured":"Jaccard, P.: Distribution compar\u00e9e de la flore alpine dans quelques r\u00e9gions des alpes occidentales et orientales. Bulletin de la Murithienne 31, 81\u201392 (1902)","journal-title":"Bulletin de la Murithienne"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-662-45472-5_13","volume-title":"Financial Cryptography and Data Security","author":"S Kamara","year":"2014","unstructured":"Kamara, S., Mohassel, P., Raykova, M., Sadeghian, S.: Scaling private set intersection to billion-element sets. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014. LNCS, vol. 8437, pp. 195\u2013215. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-662-45472-5_13"},{"key":"10_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139924801","volume-title":"Mining of Massive Datasets","author":"J Leskovec","year":"2014","unstructured":"Leskovec, J., Rajaraman, A., Ullman, J.D.: Mining of Massive Datasets. Cambridge University Press, New York (2014)"},{"key":"10_CR10","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 \u2014 CRYPTO 2000","author":"Y Lindell","year":"2000","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 36\u201354. Springer, Heidelberg (2000). doi:\n10.1007\/3-540-44598-6_3"},{"key":"10_CR11","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: 23rd USENIX Security Symposium (USENIX Security 2014), pp. 797\u2013812 (2014)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Qiu, S., Wang, B., Li, M., Victors, J., Liu, J., Shi, Y., Wang, W.: Fast, private and verifiable: server-aided approximate similarity computation over large-scale datasets. In: Proceedings of the 4th ACM International Workshop on Security in Cloud Computing, pp. 29\u201336. ACM (2016)","DOI":"10.1145\/2898445.2898453"},{"key":"10_CR13","unstructured":"Qui, S.: Personal communication (2017)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-39884-1_23","volume-title":"Financial Cryptography and Data Security","author":"T Schneider","year":"2013","unstructured":"Schneider, T., Zohner, M.: GMW vs. Yao? efficient secure two-party computation with low depth circuits. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 275\u2013292. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-39884-1_23"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science, SFCS\u201908, pp. 160\u2013164. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"10_CR16","unstructured":"Zhu, E.: Datasketch. \nhttps:\/\/github.com\/ekzhu\/datasketch"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64200-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,26]],"date-time":"2017-07-26T13:01:13Z","timestamp":1501074073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64200-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319641997","9783319642000"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64200-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}