{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T23:34:37Z","timestamp":1648769677744},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T00:00:00Z","timestamp":1558483200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T00:00:00Z","timestamp":1558483200000},"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":["J Cryptol"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s00145-019-09323-1","type":"journal-article","created":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T05:08:54Z","timestamp":1558588134000},"page":"1200-1262","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["What Security Can We Achieve Within 4 Rounds?"],"prefix":"10.1007","volume":"32","author":[{"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,22]]},"reference":[{"key":"9323_CR1","unstructured":"P. Ananth, A. R. Choudhuri, A. Jain, A new approach to round-optimal secure multiparty computation, in CRYPTO (2017), pp. 468\u2013499"},{"issue":"2","key":"9323_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y Aumann","year":"2010","unstructured":"Y. Aumann, Y. Lindell. Security against covert adversaries: Efficient protocols for realistic adversaries. J. Cryptology, 23(2). 281\u2013343 (2010)","journal-title":"J. Cryptology"},{"issue":"4","key":"9323_CR3","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1109\/49.839935","volume":"18","author":"N Asokan","year":"2000","unstructured":"N. Asokan, V. Shoup, M. Waidner, Optimistic fair exchange of digital signatures. IEEE J. Sel. Areas Commun.\n                           18(4), 593\u2013610 (2000)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9323_CR4","unstructured":"R. Bendlin, I. Damg\u00e5rd, C. Orlandi, S. Zakarias, Semi-homomorphic encryption and multiparty computation, in EUROCRYPT (2011), pp. 169\u2013188"},{"key":"9323_CR5","unstructured":"D. Beaver, Foundations of secure interactive computing, in CRYPTO (1991), pp. 377\u2013391"},{"key":"9323_CR6","first-page":"1088","volume":"2017","author":"S Badrinarayanan","year":"2017","unstructured":"S. Badrinarayanan, V. Goyal, A. Jain, Y. T. Kalai, D. Khurana, A. Sahai. Promise zero knowledge and its applications to round optimal mpc. IACR Cryptol. ePrint Arch.\n                           2017, 1088 (2017)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9323_CR7","unstructured":"S. Badrinarayanan, V. Goyal, A. Jain, D. Khurana, A. Sahai, Round optimal concurrent MPC via strong simulation, in TCC (2017), pp. 743\u2013775"},{"key":"9323_CR8","unstructured":"S. Badrinarayanan, V. Goyal, A. Jain, Y. T. Kalai, D. Khurana, A. Sahai, Promise zero knowledge and its applications to round optimal MPC, in CRYPTO (2018), pp. 459\u2013487"},{"key":"9323_CR9","unstructured":"Z. Brakerski, S. Halevi, A. Polychroniadou, Four round secure computation without setup, in TCC (2017), pp. 645\u2013677"},{"key":"9323_CR10","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-662-44381-1_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"Iddo Bentov","year":"2014","unstructured":"I. Bentov, R. Kumaresan, How to use bitcoin to design fair protocols, in CRYPTO (2014), pp. 421\u2013439"},{"key":"9323_CR11","unstructured":"F. Benhamouda, H. Lin, k-round multiparty computation from k-round oblivious transfer via garbled interactive circuits, in EUROCRYPT (2018), pp. 500\u2013532"},{"key":"9323_CR12","unstructured":"M. Blum, How to prove a theorem so no one else can claim it, in Proceedings of the International Congress of Mathematicians, USA, pp. 1444\u20131451"},{"key":"9323_CR13","first-page":"106","volume":"2005","author":"B Barak","year":"2005","unstructured":"B. Barak, A. Sahai, How to play almost any mental game over the net\u2014concurrent composition via super-polynomial simulation. IACR Cryptol. ePrint Arch., 106 (2005)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"1","key":"9323_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"R. Canetti, Security and composition of multiparty cryptographic protocols. J. Cryptol.\n                           13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"9323_CR15","unstructured":"R. Cramer, I. Damg\u00e5rd, B. Schoenmakers, Proofs of partial knowledge and simplified design of witness hiding protocols, in CRYPTO (1994), pp. 174\u2013187"},{"key":"9323_CR16","unstructured":"D. Chaum, J.-H. Evertse, J. van de Graaf, An improved protocol for demonstrating possession of discrete logarithms and some generalizations, in EUROCRYPT (1987), pp. 127\u2013141"},{"key":"9323_CR17","unstructured":"R. Cleve, Limits on the security of coin flips when half the processors are faulty (extended abstract), in STOC (1986), pp. 364\u2013369"},{"key":"9323_CR18","unstructured":"R. Canetti, H. Lin, R. Pass, Adaptive hardness and composable security in the plain model from standard assumptions, in FOCS (2010), pp. 541\u2013550"},{"key":"9323_CR19","unstructured":"K.-M. Chung, E. Lui, R. Pass, From weak to strong zero-knowledge and applications, in TCC (2015), pp. 66\u201392"},{"key":"9323_CR20","unstructured":"M. Ciampi, R. Ostrovsky, L. Siniscalchi, I. Visconti, Round-optimal secure two-party computation from trapdoor permutations, in TCC (2017), pp. 678\u2013710"},{"key":"9323_CR21","unstructured":"J. Doerner, Y. Kondi, E. Lee, A. Shelat. Secure two-party threshold ECDSA from ECDSA assumptions, in IEEE Symposium on Security and Privacy, SP (2018), pp. 980\u2013997"},{"key":"9323_CR22","unstructured":"I. Damg\u00e5rd, V. Pastro, N. P. Smart, S. Zakarias, Multiparty computation from somewhat homomorphic encryption, in CRYPTO (2012), pp. 643\u2013662"},{"issue":"6","key":"9323_CR23","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"S. Even, O. Goldreich, A. Lempel. A randomized protocol for signing contracts. Commun. ACM\n                           28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"9323_CR24","unstructured":"M. Fischlin, Trapdoor commitment schemes and their applications. Ph.D. Thesis (2001)"},{"key":"9323_CR25","unstructured":"T. K. Frederiksen, Y. Lindell, V. Osheter, B. Pinkas, Fast distributed RSA key generation for semi-honest and malicious adversaries, in CRYPTO (2018), pp. 331\u2013361"},{"key":"9323_CR26","unstructured":"U. Feige, A. Shamir, Witness indistinguishable and witness hiding protocols, in STOC (1990), pp. 416\u2013426"},{"issue":"4","key":"9323_CR27","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T El Gamal","year":"1985","unstructured":"T. El Gamal, A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory, 31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9323_CR28","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O Goldreich","year":"1996","unstructured":"O. Goldreich, H. Krawczyk, On the composition of zero-knowledge proof systems. SIAM J. Comput., 25(1), 169\u2013192 (1996)","journal-title":"SIAM J. Comput."},{"key":"9323_CR29","unstructured":"S. Dov Gordon, J. Katz, Partial fairness in secure two-party computation, in EUROCRYPT (2010), pp. 157\u2013176"},{"key":"9323_CR30","unstructured":"J. A. Garay, J. Katz, B. Tackmann, V. Zikas, How fair is your protocol?: A utility-based approach to protocol optimality, in PODC (2015), pp. 281\u2013290"},{"key":"9323_CR31","unstructured":"O. Goldreich, L. A. Levin, A hard-core predicate for all one-way functions, in STOC (1989), pp. 25\u201332"},{"key":"9323_CR32","doi-asserted-by":"crossref","unstructured":"S. Garg, P. Mukherjee, O. Pandey, A. Polychroniadou, The exact round complexity of secure computation. In M. Fischlin, J.S. Coron, editors, Advances in Cryptology - EUROCRYPT, 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8\u201312, 2016, Proceedings, Part II, pages 448\u2013476. Springer, Berlin, Heidelberg (2016)","DOI":"10.1007\/978-3-662-49896-5_16"},{"key":"9323_CR33","unstructured":"S. Goldwasser, S. Micali, R. L. Rivest, A \u201cparadoxical\u201d solution to the signature problem (extended abstract), in FOCS (1984), pp. 441\u2013448"},{"key":"9323_CR34","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, in STOC (1987), pp. 218\u2013229"},{"key":"9323_CR35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Vol. 2, Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"O. Goldreich, Foundations of cryptography: Vol. 2, Basic Applications (Cambridge University Press, New York, 2004)"},{"key":"9323_CR36","unstructured":"S. Garg, A. Srinivasan, Two-round multiparty secure computation from minimal assumptions, in EUROCRYPT (2018), pp. 468\u2013499"},{"key":"9323_CR37","unstructured":"I. Haitner, Semi-honest to malicious oblivious transfer\u2014the black-box way, in TCC (2008), pp. 412\u2013426"},{"key":"9323_CR38","unstructured":"S. Halevi, C. Hazay, A. Polychroniadou, M. Venkitasubramaniam. Round-optimal secure multi-party computation, in CRYPTO (2018), pp. 488\u2013520"},{"issue":"2","key":"9323_CR39","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/100790537","volume":"40","author":"I Haitner","year":"2011","unstructured":"I. Haitner, Y. Ishai, E. Kushilevitz, Y. Lindell, E. Petrank, Black-box constructions of protocols for secure computation. SIAM J. Comput.\n                           40(2), 225\u2013266 (2011)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9323_CR40","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s00145-010-9092-8","volume":"25","author":"S Halevi","year":"2012","unstructured":"S. Halevi, Y. T. Kalai, Smooth projective hashing and two-message oblivious transfer. J. Cryptol.\n                           25(1), 158\u2013193 (2012)","journal-title":"J. Cryptol."},{"key":"9323_CR41","unstructured":"C. Hazay, G. L. Mikkelsen, T. Rabin, T. Toft, Efficient RSA key generation and threshold Paillier in the two-party setting, in CT-RSA (2012), pp. 313\u2013331"},{"key":"9323_CR42","unstructured":"C. Hazay, P. Scholl, E. Soria-Vazquez, Low cost constant round MPC combining BMR and oblivious transfer, in ASIACRYPT (2017), pp. 598\u2013628"},{"key":"9323_CR43","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, M. Prabhakaran, A. Sahai, Efficient non-interactive secure computation, in EUROCRYPT (2011), pp. 406\u2013425"},{"issue":"3","key":"9323_CR44","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1137\/080725398","volume":"39","author":"Y Ishai","year":"2009","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai, Zero-knowledge proofs from secure multiparty computation. SIAM J. Comput.\n                           39(3), 1121\u20131152 (2009)","journal-title":"SIAM J. Comput."},{"key":"9323_CR45","unstructured":"J. Katz, R. Ostrovsky, Round-optimal secure two-party computation, in CRYPTO (2004), pp. 335\u2013354"},{"key":"9323_CR46","unstructured":"M. Keller, E. Orsini, P. Scholl, MASCOT: faster malicious arithmetic secure computation with oblivious transfer, in CCS (2016), pp. 830\u2013842"},{"key":"9323_CR47","unstructured":"Y. Lindell, Parallel coin-tossing and constant-round secure two-party computation, in CRYPTO (2001), pp. 171\u2013189"},{"key":"9323_CR48","unstructured":"Y. Lindell, A. Nof, Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody, in CCS (2018), pp. 1837\u20131854"},{"key":"9323_CR49","unstructured":"S. Micali, Simple and fast optimistic protocols for fair electronic exchange, in PODC (2003), pp. 12\u201319"},{"key":"9323_CR50","unstructured":"T. Moran, M. Naor, G. Segev, An optimally fair coin toss, in TCC (2009), pp. 1\u201318"},{"key":"9323_CR51","unstructured":"S. Micali, R. Pass, A. Rosen, Input-indistinguishable computation, in FOCS (2006), pp. 367\u2013378"},{"key":"9323_CR52","unstructured":"S. Micali, P. Rogaway, Secure computation (abstract), in CRYPTO (1991), pp. 392\u2013404"},{"key":"9323_CR53","unstructured":"J. B. Nielsen, P. S. Nordholt, C. Orlandi, S. S. Burra, A new approach to practical active-secure two-party computation, in CRYPTO (2012), pp. 681\u2013700"},{"key":"9323_CR54","unstructured":"M. Naor, B. Pinkas, Efficient oblivious transfer protocols, in SODA (2001), pp. 448\u2013457"},{"key":"9323_CR55","unstructured":"R. Ostrovsky, S. Richelson, A. Scafuro, Round-optimal black-box two-party computation, in CRYPTO (2015), pp. 339\u2013358"},{"key":"9323_CR56","unstructured":"R. Pass, Simulation in quasi-polynomial time, and its application to protocol composition, in EUROCRYPT (2003), pp. 160\u2013176"},{"key":"9323_CR57","unstructured":"T. P. Pedersen, Non-interactive and information-theoretic secure verifiable secret sharing, in CRYPTO (1991), pp. 129\u2013140"},{"key":"9323_CR58","unstructured":"M. Prabhakaran, A. Sahai, New notions of security: achieving universal composability without trusted setup, in STOC (2004), pp. 242\u2013251"},{"key":"9323_CR59","unstructured":"C. Peikert, V. Vaikuntanathan, B. Waters, A framework for efficient and composable oblivious transfer, in CRYPTO (2008), pp. 554\u2013571"},{"key":"9323_CR60","unstructured":"R. Pass, H. Wee, Black-box constructions of two-party protocols from one-way functions, in TCC (2009), pp. 403\u2013418"},{"issue":"11","key":"9323_CR61","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret. Commun. ACM\n                           22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"9323_CR62","unstructured":"A. C.-C. Yao, Theory and applications of trapdoor functions (extended abstract), in FOCS (1982), pp. 80\u201391"},{"key":"9323_CR63","unstructured":"A. C.-C. Yao, How to generate and exchange secrets (extended abstract), in FOCS (1986), pp. 162\u2013167"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-019-09323-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-019-09323-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-019-09323-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T23:14:45Z","timestamp":1590016485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-019-09323-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,22]]},"references-count":63,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["9323"],"URL":"https:\/\/doi.org\/10.1007\/s00145-019-09323-1","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,22]]},"assertion":[{"value":"24 August 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}