{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T10:42:40Z","timestamp":1789987360197,"version":"4.0.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319765778","type":"print"},{"value":"9783319765785","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-76578-5_22","type":"book-chapter","created":{"date-parts":[[2018,2,28]],"date-time":"2018-02-28T09:23:52Z","timestamp":1519809832000},"page":"644-674","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Covert Two-Party Computation"],"prefix":"10.1007","author":[{"given":"Stanislaw","family":"Jarecki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,3,1]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-55220-5_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Afshar","year":"2014","unstructured":"Afshar, A., Mohassel, P., Pinkas, B., Riva, B.: Non-interactive secure computation based on cut-and-choose. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 387\u2013404. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_22"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"B Aiello","year":"2001","unstructured":"Aiello, B., Ishai, Y., Reingold, O.: Priced oblivious transfer: how to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 119\u2013135. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_8"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-662-48000-7_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"F Benhamouda","year":"2015","unstructured":"Benhamouda, F., Couteau, G., Pointcheval, D., Wee, H.: Implicit zero-knowledge arguments and applications to the malicious setting. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 107\u2013129. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_6"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings of 42nd IEEE Symposium on Foundations of Computer Science, FOCS 2001, pp. 136\u2013145. IEEE Computer Society, Washington, DC (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"22_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.61"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-29485-8_10","volume-title":"Topics in Cryptology \u2013 CT-RSA 2016","author":"C Cho","year":"2016","unstructured":"Cho, C., Dachman-Soled, D., Jarecki, S.: Efficient concurrent covert computation of string equality and set intersection. In: Sako, K. (ed.) CT-RSA 2016. LNCS, vol. 9610, pp. 164\u2013179. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29485-8_10"},{"key":"22_CR7","unstructured":"Couteau, G.: Revisiting covert multiparty computation. Cryptology ePrint Archive, Report 2016\/951 (2016). http:\/\/eprint.iacr.org\/2016\/951"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"R Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 45\u201364. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_4"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-48910-X_6","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"G Di Crescenzo","year":"1999","unstructured":"Di Crescenzo, G., Ostrovsky, R., Rajagopalan, S.: Conditional oblivious transfer and timed-release encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 74\u201389. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_6"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Goyal, V., Jain, A.: On the round complexity of covert computation. In: Proceedings of 42nd ACM Symposium on Theory of Computing, STOC 2010, pp. 191\u2013200. ACM, New York (2010)","DOI":"10.1145\/1806689.1806717"},{"issue":"5","key":"22_CR11","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TC.2008.199","volume":"58","author":"NJ Hopper","year":"2009","unstructured":"Hopper, N.J., von Ahn, L., Langford, J.: Provably secure steganography. IEEE Trans. Comput. 58(5), 662\u2013676 (2009)","journal-title":"IEEE Trans. Comput."},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-40084-1_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"Y Huang","year":"2013","unstructured":"Huang, Y., Katz, J., Evans, D.: Efficient secure two-party computation using symmetric cut-and-choose. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 18\u201335. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_2"},{"key":"22_CR13","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). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_35"},{"key":"22_CR14","unstructured":"Jarecki, S.: Efficient covert two-party computation. Cryptology ePrint Archive, Report 2016\/1032 (2016). http:\/\/eprint.iacr.org\/2016\/1032"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-19571-6_18","volume-title":"Theory of Cryptography","author":"J Katz","year":"2011","unstructured":"Katz, J., Vaikuntanathan, V.: Round-optimal password-based authenticated key exchange. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 293\u2013310. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_18"},{"key":"22_CR16","unstructured":"Kreuter, B., Shelat, A., Shen, C.-H.: Billion-gate secure computation with malicious adversaries. In: USENIX Security, pp. 14\u201325 (2012)"},{"issue":"2","key":"22_CR17","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/s00145-015-9198-0","volume":"29","author":"Y Lindell","year":"2016","unstructured":"Lindell, Y.: Fast cut-and-choose-based protocols for malicious and covert adversaries. J. Cryptol. 29(2), 456\u2013490 (2016)","journal-title":"J. Cryptol."},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72540-4_4","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Y Lindell","year":"2007","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 52\u201378. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_4"},{"issue":"4","key":"22_CR19","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/s00145-011-9107-0","volume":"25","author":"Y Lindell","year":"2012","unstructured":"Lindell, Y., Pinkas, B.: Secure two-party computation via cut-and-choose oblivious transfer. J. Cryptol. 25(4), 680\u2013722 (2012)","journal-title":"J. Cryptol."},{"key":"22_CR20","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). https:\/\/doi.org\/10.1007\/978-3-642-13708-2_25"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/11745853_30","volume-title":"Public Key Cryptography - PKC 2006","author":"P Mohassel","year":"2006","unstructured":"Mohassel, P., Franklin, M.: Efficiency tradeoffs for malicious two-party computation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 458\u2013473. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_30"},{"issue":"1","key":"22_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-004-0102-6","volume":"18","author":"M Naor","year":"2005","unstructured":"Naor, M., Pinkas, B.: Computationally secure oblivious transfer. J. Cryptol. 18(1), 1\u201335 (2005)","journal-title":"J. Cryptol."},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority. In: Proceedings of 36th Annual ACM Symposium on Theory of Computing, 13\u201316 June 2004, Chicago, IL, USA, pp. 232\u2013241 (2004)","DOI":"10.1145\/1007352.1007393"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-10366-7_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"B Pinkas","year":"2009","unstructured":"Pinkas, B., Schneider, T., Smart, N.P., Williams, S.C.: Secure two-party computation is practical. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 250\u2013267. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_15"},{"issue":"6","key":"22_CR25","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1016\/j.jcss.2006.02.002","volume":"72","author":"MD Raimondo","year":"2006","unstructured":"Raimondo, M.D., Gennaro, R.: Provably secure threshold password-authenticated key exchange. J. Comput. Syst. Sci. 72(6), 978\u20131001 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-642-20465-4_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"A Shelat","year":"2011","unstructured":"Shelat, A., Shen, C.: Two-output secure computation with malicious adversaries. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 386\u2013405. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_22"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Shelat, A., Shen, C.-H.: Fast two-party secure computation with minimal assumptions. In: ACM Conference on Computer and Communications Security - CCS, pp. 523\u2013534 (2013)","DOI":"10.1145\/2508859.2516698"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"von Ahn, L., Hopper, N., Langford, J.: Covert two-party computation. In: Proceedings of 37th Annual ACM Symposium on Theory of Computing, STOC 2005, pp. 513\u2013522. ACM, New York (2005)","DOI":"10.1145\/1060590.1060668"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"Yao, A.: How to generate and exchange secrets. In: 27th FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-76578-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T10:11:20Z","timestamp":1693563080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-76578-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319765778","9783319765785"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-76578-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"1 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Workshop on Public Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rio de Janeiro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 March 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}