{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:03:14Z","timestamp":1783008194634,"version":"3.54.5"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319294841","type":"print"},{"value":"9783319294858","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-29485-8_10","type":"book-chapter","created":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T05:33:40Z","timestamp":1454304820000},"page":"164-179","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Concurrent Covert Computation of String Equality and Set Intersection"],"prefix":"10.1007","author":[{"given":"Chongwon","family":"Cho","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dana","family":"Dachman-Soled","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stanis\u0142aw","family":"Jarecki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,2,2]]},"reference":[{"key":"10_CR1","unstructured":"Balfanz, D., Durfee, G., Shankar, N., Smetters, D., Staddon, J., Wong, H.C.: Secret handshakes from pairing-based key agreements. In: IEEE Symposium on Security and Privacy (2003)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, CCS 1993, pp. 62\u201373. ACM, New York (1993)","DOI":"10.1145\/168588.168596"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-40041-4_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"F Benhamouda","year":"2013","unstructured":"Benhamouda, F., Blazy, O., Chevalier, C., Pointcheval, D., Vergnaud, D.: New techniques for SPHFs and efficient one-round PAKE protocols. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 449\u2013475. Springer, Heidelberg (2013)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings of the 42Nd IEEE Symposium on Foundations of Computer Science, FOCS 2001, p. 136. IEEE Computer Society, Washington, DC (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Chandran, N., Goyal, V., Ostrovsky, R., Sahai, A.: Covert multi-party computation. In: FOCS, pp. 238\u2013248 (2007)","DOI":"10.1109\/FOCS.2007.4389496"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-85174-5_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J-S Coron","year":"2008","unstructured":"Coron, J.-S., Patarin, J., Seurin, Y.: The random oracle model and the ideal cipher model are equivalent. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 1\u201320. Springer, Heidelberg (2008)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Dong, C., Chen, L., Wen, Z.: When private set intersection meets big data: an efficient and scalable protocol. In: Computer and Communications Security (CCS), pp. 789\u2013800 (2013)","DOI":"10.1145\/2508859.2516701"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00145-014-9190-0","volume":"29","author":"Michael J. Freedman","year":"2014","unstructured":"Freedman, M.J., Hazay, C., Nissim, K., Pinkas, B.: Efficient set intersection with simulation-based security. J. Crypt., 1\u201341 (2014). doi:\n                      10.1007\/s00145-014-9190-0","journal-title":"Journal of Cryptology"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Goyal, V., Jain, A.: On the round complexity of covert computation. In: Proceedings of the Forty-second ACM Symposium on Theory of Computing, STOC 2010, pp. 191\u2013200. ACM, New York (2010)","DOI":"10.1145\/1806689.1806717"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Holenstein, T., K\u00fcnzler, R., Tessaro, S.: The equivalence of the random oracle model and the ideal cipher model, revisited. In: Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6\u20138 June 2011, pp. 89\u201398 (2011)","DOI":"10.1145\/1993636.1993650"},{"key":"10_CR11","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: Network and Distributed System Security (NDSS) (2012)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-642-54631-0_35","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"S Jarecki","year":"2014","unstructured":"Jarecki, S.: Practical covert authentication. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 611\u2013629. Springer, Heidelberg (2014)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-642-15317-4_26","volume-title":"Security and Cryptography for Networks","author":"S Jarecki","year":"2010","unstructured":"Jarecki, S., Liu, X.: Fast secure computation of set intersection. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 418\u2013435. Springer, Heidelberg (2010)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-13708-2_25","volume-title":"Applied Cryptography and Network Security","author":"M Manulis","year":"2010","unstructured":"Manulis, M., Pinkas, B., Poettering, B.: Privacy-preserving group discovery with linear complexity. In: Zhou, J., Yung, M. (eds.) ACNS 2010. LNCS, vol. 6123, pp. 420\u2013437. Springer, Heidelberg (2010)"},{"key":"10_CR15","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: Fu, K., Jung, J. (eds.) Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, 20\u201322 August 2014, pp. 797\u2013812. USENIX Association (2014)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"von Ahn, L., Hopper, N., Langford, J.: Covert two-party computation. In: Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing, STOC 2005, pp. 513\u2013522. ACM, New York (2005)","DOI":"10.1145\/1060590.1060668"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology - CT-RSA 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29485-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T08:28:39Z","timestamp":1559377719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29485-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319294841","9783319294858"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29485-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}