{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:23:15Z","timestamp":1790814195117,"version":"4.1.0"},"reference-count":93,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T00:00:00Z","timestamp":1679443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T00:00:00Z","timestamp":1679443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00145-023-09446-6","type":"journal-article","created":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T23:02:26Z","timestamp":1679526146000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Adaptively Secure MPC with Sublinear Communication Complexity"],"prefix":"10.1007","volume":"36","author":[{"given":"Ran","family":"Cohen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abhi","family":"Shelat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,22]]},"reference":[{"key":"9446_CR1","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ajtai. Generating hard instances of the short basis problem. In Proceedings of the 26th International Colloquium on Automata, Languages, and Programming (ICALP), pages 1\u20139, 1999.","DOI":"10.1007\/3-540-48523-6_1"},{"key":"9446_CR2","unstructured":"J.\u00a0Alwen and C.\u00a0Peikert. Generating shorter bases for hard random lattices. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science STACS, pages 75\u201386, 2009."},{"key":"9446_CR3","doi-asserted-by":"crossref","unstructured":"P.\u00a0Ananth, A.\u00a0R. Choudhuri, A.\u00a0Goel, and A.\u00a0Jain. Round-optimal secure multiparty computation with honest majority. In Advances in Cryptology \u2013 CRYPTO 2018, part II, pages 395\u2013424, 2018.","DOI":"10.1007\/978-3-319-96881-0_14"},{"key":"9446_CR4","doi-asserted-by":"crossref","unstructured":"P.\u00a0Ananth, S.\u00a0Badrinarayanan, A.\u00a0Jain, N.\u00a0Manohar, and A.\u00a0Sahai. From FE combiners to secure MPC and back. In Proceedings of the 17th Theory of Cryptography Conference, TCC 2019, part I, pages 199\u2013228, 2019.","DOI":"10.1007\/978-3-030-36030-6_9"},{"key":"9446_CR5","doi-asserted-by":"crossref","unstructured":"G.\u00a0Asharov, A.\u00a0Jain, A.\u00a0L\u00f3pez-Alt, E.\u00a0Tromer, V.\u00a0Vaikuntanathan, and D.\u00a0Wichs. Multiparty computation with low communication, computation and interaction via threshold FHE. In Advances in Cryptology \u2013 EUROCRYPT 2012, pages 483\u2013501, 2012.","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"9446_CR6","doi-asserted-by":"crossref","unstructured":"S.\u00a0Badrinarayanan, A.\u00a0Jain, N.\u00a0Manohar, and A.\u00a0Sahai. Secure MPC: laziness leads to GOD. In Advances in Cryptology \u2013 ASIACRYPT 2020, part III, pages 120\u2013150, 2020.","DOI":"10.1007\/978-3-030-64840-4_5"},{"key":"9446_CR7","unstructured":"B.\u00a0Barak and A.\u00a0Sahai. How to play almost any mental game over the net - concurrent composition via super-polynomial simulation. In Proceedings of the 46th Annual Symposium on Foundations of Computer Science (FOCS), pages 543\u2013552, 2005."},{"key":"9446_CR8","doi-asserted-by":"crossref","unstructured":"B.\u00a0Barak, R.\u00a0Canetti, J.\u00a0B. Nielsen, and R.\u00a0Pass. Universally composable protocols with relaxed set-up assumptions. In Proceedings of the 45th Annual Symposium on Foundations of Computer Science (FOCS), pages 186\u2013195, 2004.","DOI":"10.1109\/FOCS.2004.71"},{"key":"9446_CR9","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beaver. Plug and play encryption. In Advances in Cryptology \u2013 CRYPTO \u201997, pages 75\u201389, 1997.","DOI":"10.1007\/BFb0052228"},{"key":"9446_CR10","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beaver and S.\u00a0Haber. Cryptographic protocols provably secure against dynamic adversaries. In Advances in Cryptology \u2013 EUROCRYPT \u201992, pages 307\u2013323, 1992.","DOI":"10.1007\/3-540-47555-9_26"},{"key":"9446_CR11","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ben-Or, S.\u00a0Goldwasser, and A.\u00a0Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pages 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"9446_CR12","doi-asserted-by":"crossref","unstructured":"R.\u00a0Bendlin, I.\u00a0Damg\u00e5rd, C.\u00a0Orlandi, and S.\u00a0Zakarias. Semi-homomorphic encryption and multiparty computation. In Advances in Cryptology \u2013 EUROCRYPT 2011, pages 169\u2013188, 2011.","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"9446_CR13","doi-asserted-by":"crossref","unstructured":"F.\u00a0Benhamouda, H.\u00a0Lin, A.\u00a0Polychroniadou, and M.\u00a0Venkitasubramaniam. Two-round adaptively secure multiparty computation from standard assumptions. In Proceedings of the 16th Theory of Cryptography Conference, TCC 2018, part I, pages 175\u2013205, 2018.","DOI":"10.1007\/978-3-030-03807-6_7"},{"key":"9446_CR14","doi-asserted-by":"crossref","unstructured":"N.\u00a0Bitansky, S.\u00a0Garg, H.\u00a0Lin, R.\u00a0Pass, and S.\u00a0Telang. Succinct randomized encodings and their applications. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC), pages 439\u2013448, 2015.","DOI":"10.1145\/2746539.2746574"},{"issue":"3","key":"9446_CR15","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1137\/15M1050963","volume":"47","author":"N Bitansky","year":"2018","unstructured":"N.\u00a0Bitansky, R.\u00a0Canetti, S.\u00a0Garg, J.\u00a0Holmgren, A.\u00a0Jain, H.\u00a0Lin, R.\u00a0Pass, S.\u00a0Telang, and V.\u00a0Vaikuntanathan. Indistinguishability obfuscation for RAM programs and succinct randomized encodings. SIAM Journal on Computing, 47 (3): 1123\u20131210, 2018.","journal-title":"SIAM Journal on Computing"},{"key":"9446_CR16","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh and X.\u00a0Boyen. Efficient selective-id secure identity-based encryption without random oracles. In Advances in Cryptology \u2013 EUROCRYPT 2004, pages 223\u2013238, 2004.","DOI":"10.1007\/978-3-540-24676-3_14"},{"key":"9446_CR17","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, R.\u00a0Gennaro, S.\u00a0Goldfeder, A.\u00a0Jain, S.\u00a0Kim, P.\u00a0M.\u00a0R. Rasmussen, and A.\u00a0Sahai. Threshold cryptosystems from threshold fully homomorphic encryption. In Advances in Cryptology \u2013 CRYPTO 2018, part I, pages 565\u2013596, 2018.","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"9446_CR18","doi-asserted-by":"crossref","unstructured":"E.\u00a0Boyle, N.\u00a0Gilboa, and Y.\u00a0Ishai. Breaking the circuit size barrier for secure computation under DDH. In Advances in Cryptology \u2013 CRYPTO 2016, part I, pages 509\u2013539, 2016.","DOI":"10.1007\/978-3-662-53018-4_19"},{"key":"9446_CR19","doi-asserted-by":"crossref","unstructured":"E.\u00a0Boyle, N.\u00a0Gilboa, and Y.\u00a0Ishai. Group-based secure computation: Optimizing rounds, communication, and computation. In Advances in Cryptology \u2013 EUROCRYPT 2017, part II, pages 163\u2013193, 2017.","DOI":"10.1007\/978-3-319-56614-6_6"},{"key":"9446_CR20","doi-asserted-by":"crossref","unstructured":"E.\u00a0Boyle, R.\u00a0Cohen, D.\u00a0Data, and P.\u00a0Hub\u00e1\u010dek. Must the communication graph of MPC protocols be an expander? In Advances in Cryptology \u2013 CRYPTO 2018, part III, pages 243\u2013272, 2018.","DOI":"10.1007\/978-3-319-96878-0_9"},{"issue":"1","key":"9446_CR21","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"R.\u00a0Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13 (1): 143\u2013202, 2000.","journal-title":"Journal of Cryptology"},{"key":"9446_CR22","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS), pages 136\u2013145, 2001.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9446_CR23","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, U.\u00a0Feige, O.\u00a0Goldreich, and M.\u00a0Naor. Adaptively secure multi-party computation. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), pages 639\u2013648, 1996.","DOI":"10.1145\/237814.238015"},{"key":"9446_CR24","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, Y.\u00a0Lindell, R.\u00a0Ostrovsky, and A.\u00a0Sahai. Universally composable two-party and multi-party secure computation. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 494\u2013503, 2002.","DOI":"10.1145\/509907.509980"},{"issue":"3","key":"9446_CR25","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00145-004-0135-x","volume":"17","author":"R Canetti","year":"2004","unstructured":"R.\u00a0Canetti, I.\u00a0Damg\u00e5rd, S.\u00a0Dziembowski, Y.\u00a0Ishai, and T.\u00a0Malkin. Adaptive versus non-adaptive security of multi-party protocols. Journal of Cryptology, 17 (3): 153\u2013207, 2004.","journal-title":"Journal of Cryptology"},{"key":"9446_CR26","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, R.\u00a0Pass, and A.\u00a0Shelat. Cryptography from sunspots: How to use an imperfect reference string. In Proceedings of the 48th Annual Symposium on Foundations of Computer Science (FOCS), pages 249\u2013259, 2007.","DOI":"10.1109\/FOCS.2007.70"},{"key":"9446_CR27","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, S.\u00a0Goldwasser, and O.\u00a0Poburinnaya. Adaptively secure two-party computation from indistinguishability obfuscation. In Proceedings of the 12th Theory of Cryptography Conference, TCC 2015, part II, pages 557\u2013585, 2015.","DOI":"10.1007\/978-3-662-46497-7_22"},{"key":"9446_CR28","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, J.\u00a0Holmgren, A.\u00a0Jain, and V.\u00a0Vaikuntanathan. Succinct garbling and indistinguishability obfuscation for RAM programs. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC), pages 429\u2013437, 2015.","DOI":"10.1145\/2746539.2746621"},{"key":"9446_CR29","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, O.\u00a0Poburinnaya, and M.\u00a0Venkitasubramaniam. Better two-round adaptive multi-party computation. In Proceedings of the 20th International Conference on the Theory and Practice of Public-Key Cryptography (PKC), part II, pages 396\u2013427, 2017.","DOI":"10.1007\/978-3-662-54388-7_14"},{"key":"9446_CR30","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, O.\u00a0Poburinnaya, and M.\u00a0Venkitasubramaniam. Equivocating yao: constant-round adaptively secure multiparty computation in the plain model. In Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC), pages 497\u2013509, 2017.","DOI":"10.1145\/3055399.3055495"},{"key":"9446_CR31","doi-asserted-by":"crossref","unstructured":"D.\u00a0Chaum, C.\u00a0Cr\u00e9peau, and I.\u00a0Damg\u00e5rd. Multiparty unconditionally secure protocols (extended abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pages 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"9446_CR32","doi-asserted-by":"crossref","unstructured":"C.\u00a0Cho, N.\u00a0D\u00f6ttling, S.\u00a0Garg, D.\u00a0Gupta, P.\u00a0Miao, and A.\u00a0Polychroniadou. Laconic oblivious transfer and its applications. In Advances in Cryptology \u2013 CRYPTO 2017, part II, pages 33\u201365, 2017.","DOI":"10.1007\/978-3-319-63715-0_2"},{"key":"9446_CR33","doi-asserted-by":"crossref","unstructured":"S.\u00a0G. Choi, D.\u00a0Dachman-Soled, T.\u00a0Malkin, and H.\u00a0Wee. Improved non-committing encryption with applications to adaptively secure protocols. In Advances in Cryptology \u2013 ASIACRYPT 2009, pages 287\u2013302, 2009.","DOI":"10.1007\/978-3-642-10366-7_17"},{"key":"9446_CR34","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cleve. Limits on the security of coin flips when half the processors are faulty (extended abstract). In Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC), pages 364\u2013369, 1986.","DOI":"10.1145\/12130.12168"},{"key":"9446_CR35","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cohen. Asynchronous secure multiparty computation in constant time. In Proceedings of the 19th International Conference on the Theory and Practice of Public-Key Cryptography (PKC), part II, pages 183\u2013207, 2016.","DOI":"10.1007\/978-3-662-49387-8_8"},{"issue":"4","key":"9446_CR36","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1007\/s00145-016-9245-5","volume":"30","author":"R Cohen","year":"2017","unstructured":"R.\u00a0Cohen and Y.\u00a0Lindell. Fairness versus guaranteed output delivery in secure multiparty computation. Journal of Cryptology, 30 (4): 1157\u20131186, 2017.","journal-title":"Journal of Cryptology"},{"key":"9446_CR37","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cohen and C.\u00a0Peikert. On adaptively secure multiparty computation with a short CRS. In Proceedings of the 10th Conference on Security and Cryptography for Networks (SCN), pages 129\u2013146, 2016.","DOI":"10.1007\/978-3-319-44618-9_7"},{"key":"9446_CR38","unstructured":"R.\u00a0Cohen, J.\u00a0A. Garay, and V.\u00a0Zikas. Completeness theorems for adaptively secure broadcast, 2021. https:\/\/eprint.iacr.org\/2021\/775."},{"key":"9446_CR39","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cramer, I.\u00a0Damg\u00e5rd, S.\u00a0Dziembowski, M.\u00a0Hirt, and T.\u00a0Rabin. Efficient multiparty computations secure against an adaptive adversary. In Advances in Cryptology \u2013 EUROCRYPT \u201999, pages 311\u2013326, 1999.","DOI":"10.1007\/3-540-48910-X_22"},{"key":"9446_CR40","doi-asserted-by":"crossref","unstructured":"D.\u00a0Dachman-Soled, T.\u00a0Malkin, M.\u00a0Raykova, and M.\u00a0Venkitasubramaniam. Adaptive and concurrent secure computation from new adaptive, non-malleable commitments. In Advances in Cryptology \u2013 ASIACRYPT 2013, part I, pages 316\u2013336, 2013.","DOI":"10.1007\/978-3-642-42033-7_17"},{"key":"9446_CR41","doi-asserted-by":"crossref","unstructured":"D.\u00a0Dachman-Soled, J.\u00a0Katz, and V.\u00a0Rao. Adaptively secure, universally composable, multiparty computation in constant rounds. In Proceedings of the 12th Theory of Cryptography Conference, TCC 2015, part II, pages 586\u2013613, 2015.","DOI":"10.1007\/978-3-662-46497-7_23"},{"key":"9446_CR42","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd and Y.\u00a0Ishai. Constant-round multiparty computation using a black-box pseudorandom generator. In Advances in Cryptology \u2013 CRYPTO 2005, pages 378\u2013394, 2005.","DOI":"10.1007\/11535218_23"},{"key":"9446_CR43","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd and J.\u00a0B. Nielsen. Improved non-committing encryption schemes based on a general complexity assumption. In Advances in Cryptology \u2013 CRYPTO 2000, pages 432\u2013450, 2000.","DOI":"10.1007\/3-540-44598-6_27"},{"key":"9446_CR44","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd and J.\u00a0B. Nielsen. Universally composable efficient multiparty computation from threshold homomorphic encryption. In Advances in Cryptology \u2013 CRYPTO 2003, pages 247\u2013264, 2003.","DOI":"10.1007\/978-3-540-45146-4_15"},{"key":"9446_CR45","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd, V.\u00a0Pastro, N.\u00a0P. Smart, and S.\u00a0Zakarias. Multiparty computation from somewhat homomorphic encryption. In Advances in Cryptology \u2013 CRYPTO 2012, pages 643\u2013662, 2012.","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"9446_CR46","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd, A.\u00a0Polychroniadou, and V.\u00a0Rao. Adaptively secure multi-party computation from LWE (via equivocal FHE). In Proceedings of the 19th International Conference on the Theory and Practice of Public-Key Cryptography (PKC), part II, pages 208\u2013233, 2016.","DOI":"10.1007\/978-3-662-49387-8_9"},{"key":"9446_CR47","doi-asserted-by":"crossref","unstructured":"C.\u00a0Ganesh, Y.\u00a0Kondi, A.\u00a0Patra, and P.\u00a0Sarkar. Efficient adaptively secure zero-knowledge from garbled circuits. In Proceedings of the 21th International Conference on the Theory and Practice of Public-Key Cryptography (PKC), part II, pages 499\u2013529, 2018.","DOI":"10.1007\/978-3-319-76581-5_17"},{"key":"9446_CR48","doi-asserted-by":"crossref","unstructured":"J.\u00a0A. Garay, D.\u00a0Wichs, and H.\u00a0Zhou. Somewhat non-committing encryption and efficient adaptively secure oblivious transfer. In Advances in Cryptology \u2013 CRYPTO 2009, pages 505\u2013523, 2009.","DOI":"10.1007\/978-3-642-03356-8_30"},{"key":"9446_CR49","doi-asserted-by":"crossref","unstructured":"J.\u00a0A. Garay, Y.\u00a0Ishai, R.\u00a0Ostrovsky, and V.\u00a0Zikas. The price of low communication in secure multi-party computation. In Advances in Cryptology \u2013 CRYPTO 2017, part I, pages 420\u2013446, 2017.","DOI":"10.1007\/978-3-319-63688-7_14"},{"key":"9446_CR50","doi-asserted-by":"crossref","unstructured":"S.\u00a0Garg and A.\u00a0Polychroniadou. Two-round adaptively secure MPC from indistinguishability obfuscation. In Proceedings of the 12th Theory of Cryptography Conference, TCC 2015, part II, pages 614\u2013637, 2015.","DOI":"10.1007\/978-3-662-46497-7_24"},{"key":"9446_CR51","doi-asserted-by":"crossref","unstructured":"S.\u00a0Garg and A.\u00a0Sahai. Adaptively secure multi-party computation with dishonest majority. In Advances in Cryptology \u2013 CRYPTO 2012, pages 105\u2013123, 2012.","DOI":"10.1007\/978-3-642-32009-5_8"},{"key":"9446_CR52","doi-asserted-by":"crossref","unstructured":"R.\u00a0Gennaro, Y.\u00a0Ishai, E.\u00a0Kushilevitz, and T.\u00a0Rabin. On 2-round secure multiparty computation. In Advances in Cryptology \u2013 CRYPTO 2002, pages 178\u2013193, 2002.","DOI":"10.1007\/3-540-45708-9_12"},{"key":"9446_CR53","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry. Fully homomorphic encryption using ideal lattices. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pages 169\u2013178, 2009.","DOI":"10.1145\/1536414.1536440"},{"key":"9446_CR54","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry and D.\u00a0Wichs. Separating succinct non-interactive arguments from all falsifiable assumptions. In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC), pages 99\u2013108, 2011.","DOI":"10.1145\/1993636.1993651"},{"key":"9446_CR55","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, C.\u00a0Peikert, and V.\u00a0Vaikuntanathan. Trapdoors for hard lattices and new cryptographic constructions. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pages 197\u2013206, 2008.","DOI":"10.1145\/1374376.1374407"},{"key":"9446_CR56","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, A.\u00a0Sahai, and B.\u00a0Waters. Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In Advances in Cryptology \u2013 CRYPTO 2013, part I, pages 75\u201392, 2013.","DOI":"10.1007\/978-3-642-40041-4_5"},{"issue":"4","key":"9446_CR57","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/s00145-014-9184-y","volume":"28","author":"C Gentry","year":"2015","unstructured":"C.\u00a0Gentry, J.\u00a0Groth, Y.\u00a0Ishai, C.\u00a0Peikert, A.\u00a0Sahai, and A.\u00a0D. Smith. Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs. Journal of Cryptology, 28 (4): 820\u2013843, 2015.","journal-title":"Journal of Cryptology"},{"key":"9446_CR58","doi-asserted-by":"crossref","unstructured":"O.\u00a0Goldreich, S.\u00a0Micali, and A.\u00a0Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC), pages 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"9446_CR59","doi-asserted-by":"crossref","unstructured":"S.\u00a0Gorbunov, V.\u00a0Vaikuntanathan, and D.\u00a0Wichs. Leveled fully homomorphic signatures from standard lattices. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC), pages 469\u2013477, 2015.","DOI":"10.1145\/2746539.2746576"},{"key":"9446_CR60","doi-asserted-by":"crossref","unstructured":"S.\u00a0D. Gordon, F.\u00a0Liu, and E.\u00a0Shi. Constant-round MPC with fairness and guarantee of output delivery. In Advances in Cryptology \u2013 CRYPTO 2015, part II, pages 63\u201382, 2015.","DOI":"10.1007\/978-3-662-48000-7_4"},{"key":"9446_CR61","doi-asserted-by":"crossref","unstructured":"J.\u00a0Groth. Short pairing-based non-interactive zero-knowledge arguments. In Advances in Cryptology \u2013 ASIACRYPT 2010, pages 321\u2013340, 2010.","DOI":"10.1007\/978-3-642-17373-8_19"},{"issue":"3","key":"9446_CR62","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/2220357.2220358","volume":"59","author":"J Groth","year":"2012","unstructured":"J.\u00a0Groth, R.\u00a0Ostrovsky, and A.\u00a0Sahai. New techniques for noninteractive zero-knowledge. Journal of the ACM, 59 (3): 11:1\u201311:35, 2012.","journal-title":"Journal of the ACM"},{"issue":"1","key":"9446_CR63","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00145-015-9222-4","volume":"30","author":"C Hazay","year":"2017","unstructured":"C.\u00a0Hazay and A.\u00a0Patra. Efficient one-sided adaptively secure computation. Journal of Cryptology, 30 (1): 321\u2013371, 2017.","journal-title":"Journal of Cryptology"},{"key":"9446_CR64","doi-asserted-by":"crossref","unstructured":"C.\u00a0Hazay and M.\u00a0Venkitasubramaniam. On the power of secure two-party computation. In Advances in Cryptology \u2013 CRYPTO 2016, part II, pages 397\u2013429, 2016.","DOI":"10.1007\/978-3-662-53008-5_14"},{"key":"9446_CR65","doi-asserted-by":"crossref","unstructured":"C.\u00a0Hazay and M.\u00a0Venkitasubramaniam. Composable adaptive secure protocols without setup under polytime assumptions. In Proceedings of the 14th Theory of Cryptography Conference, TCC 2016-B, part I, pages 400\u2013432, 2016.","DOI":"10.1007\/978-3-662-53641-4_16"},{"key":"9446_CR66","doi-asserted-by":"crossref","unstructured":"C.\u00a0Hazay, Y.\u00a0Lindell, and A.\u00a0Patra. Adaptively secure computation with partial erasures. In Proceedings of the 34th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 291\u2013300, 2015.","DOI":"10.1145\/2767386.2767400"},{"key":"9446_CR67","doi-asserted-by":"crossref","unstructured":"C.\u00a0Hazay, A.\u00a0Polychroniadou, and M.\u00a0Venkitasubramaniam. Constant round adaptively secure protocols in the tamper-proof hardware model. In Proceedings of the 20th International Conference on the Theory and Practice of Public-Key Cryptography (PKC), part II, pages 428\u2013460, 2017.","DOI":"10.1007\/978-3-662-54388-7_15"},{"key":"9446_CR68","doi-asserted-by":"crossref","unstructured":"B.\u00a0Hemenway, R.\u00a0Ostrovsky, and A.\u00a0Rosen. Non-committing encryption from $$\\Phi $$-hiding. In Proceedings of the 12th Theory of Cryptography Conference, TCC 2015, part I, pages 591\u2013608, 2015.","DOI":"10.1007\/978-3-662-46494-6_24"},{"key":"9446_CR69","doi-asserted-by":"crossref","unstructured":"B.\u00a0Hemenway, R.\u00a0Ostrovsky, S.\u00a0Richelson, and A.\u00a0Rosen. Adaptive security with quasi-optimal rate. In Proceedings of the 13th Theory of Cryptography Conference, TCC 2016-A, part I, pages 525\u2013541, 2016.","DOI":"10.1007\/978-3-662-49096-9_22"},{"key":"9446_CR70","doi-asserted-by":"crossref","unstructured":"M.\u00a0Hirt and V.\u00a0Zikas. Adaptively secure broadcast. In Advances in Cryptology \u2013 EUROCRYPT 2010, pages 466\u2013485, 2010.","DOI":"10.1007\/978-3-642-13190-5_24"},{"key":"9446_CR71","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Ishai, M.\u00a0Prabhakaran, and A.\u00a0Sahai. Founding cryptography on oblivious transfer - efficiently. In Advances in Cryptology \u2013 CRYPTO 2008, pages 572\u2013591, 2008.","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"9446_CR72","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Ishai, M.\u00a0Prabhakaran, and A.\u00a0Sahai. Secure arithmetic computation with no honest majority. In Proceedings of the 6th Theory of Cryptography Conference, TCC 2009, pages 294\u2013314, 2009.","DOI":"10.1007\/978-3-642-00457-5_18"},{"key":"9446_CR73","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Ishai, O.\u00a0Pandey, and A.\u00a0Sahai. Public-coin differing-inputs obfuscation and its applications. In Proceedings of the 12th Theory of Cryptography Conference, TCC 2015, part II, pages 668\u2013697, 2015.","DOI":"10.1007\/978-3-662-46497-7_26"},{"key":"9446_CR74","doi-asserted-by":"crossref","unstructured":"J.\u00a0Katz and R.\u00a0Ostrovsky. Round-optimal secure two-party computation. In Advances in Cryptology \u2013 CRYPTO 2004, pages 335\u2013354, 2004.","DOI":"10.1007\/978-3-540-28628-8_21"},{"key":"9446_CR75","doi-asserted-by":"crossref","unstructured":"J.\u00a0Katz, U.\u00a0Maurer, B.\u00a0Tackmann, and V.\u00a0Zikas. Universally composable synchronous computation. In Proceedings of the 10th Theory of Cryptography Conference, TCC 2013, pages 477\u2013498, 2013.","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"9446_CR76","doi-asserted-by":"crossref","unstructured":"J.\u00a0Katz, A.\u00a0Thiruvengadam, and H.\u00a0Zhou. Feasibility and infeasibility of adaptively secure fully homomorphic encryption. In Proceedings of the 16th International Conference on the Theory and Practice of Public-Key Cryptography (PKC), pages 14\u201331, 2013.","DOI":"10.1007\/978-3-642-36362-7_2"},{"key":"9446_CR77","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Lindell. Adaptively secure two-party computation with erasures. In Proceedings of the Cryptographers\u2019 Track at the RSA Conference (CT-RSA), pages 117\u2013132, 2009.","DOI":"10.1007\/978-3-642-00862-7_8"},{"issue":"4","key":"9446_CR78","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/s00145-010-9072-z","volume":"24","author":"Y Lindell","year":"2011","unstructured":"Y.\u00a0Lindell and H.\u00a0Zarosim. Adaptive zero-knowledge proofs and adaptively secure oblivious transfer. Journal of Cryptology, 24 (4): 761\u2013799, 2011.","journal-title":"Journal of Cryptology"},{"key":"9446_CR79","doi-asserted-by":"crossref","unstructured":"D.\u00a0Micciancio and C.\u00a0Peikert. Trapdoors for lattices: Simpler, tighter, faster, smaller. In Advances in Cryptology \u2013 EUROCRYPT 2012, pages 700\u2013718, 2012.","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"9446_CR80","doi-asserted-by":"crossref","unstructured":"P.\u00a0Mukherjee and D.\u00a0Wichs. Two round multiparty computation via multi-key FHE. In Advances in Cryptology \u2013 EUROCRYPT 2016, part II, pages 735\u2013763, 2016.","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"9446_CR81","doi-asserted-by":"crossref","unstructured":"M.\u00a0Naor and M.\u00a0Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC), pages 427\u2013437, 1990.","DOI":"10.1145\/100216.100273"},{"key":"9446_CR82","doi-asserted-by":"crossref","unstructured":"J.\u00a0B. Nielsen. Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In Advances in Cryptology \u2013 CRYPTO 2002, pages 111\u2013126, 2002.","DOI":"10.1007\/3-540-45708-9_8"},{"key":"9446_CR83","doi-asserted-by":"crossref","unstructured":"J.\u00a0B. Nielsen, P.\u00a0S. Nordholt, C.\u00a0Orlandi, and S.\u00a0S. Burra. A new approach to practical active-secure two-party computation. In Advances in Cryptology \u2013 CRYPTO 2012, pages 681\u2013700, 2012.","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"9446_CR84","doi-asserted-by":"crossref","unstructured":"A.\u00a0O\u2019Neill, C.\u00a0Peikert, and B.\u00a0Waters. Bi-deniable public-key encryption. In Advances in Cryptology \u2013 CRYPTO 2011, pages 525\u2013542, 2011.","DOI":"10.1007\/978-3-642-22792-9_30"},{"key":"9446_CR85","doi-asserted-by":"crossref","unstructured":"A.\u00a0Patra and D.\u00a0Ravi. On the exact round complexity of secure three-party computation. In Advances in Cryptology \u2013 CRYPTO 2018, part II, pages 425\u2013458, 2018.","DOI":"10.1007\/978-3-319-96881-0_15"},{"key":"9446_CR86","doi-asserted-by":"crossref","unstructured":"W.\u00a0Quach, H.\u00a0Wee, and D.\u00a0Wichs. Laconic function evaluation and applications. In Proceedings of the 59th Annual Symposium on Foundations of Computer Science (FOCS), pages 859\u2013870, 2018.","DOI":"10.1109\/FOCS.2018.00086"},{"key":"9446_CR87","doi-asserted-by":"crossref","unstructured":"T.\u00a0Rabin and M.\u00a0Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS), pages 73\u201385, 1989.","DOI":"10.1145\/73007.73014"},{"key":"9446_CR88","doi-asserted-by":"crossref","unstructured":"O.\u00a0Regev. On lattices, learning with errors, random linear codes, and cryptography. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pages 84\u201393, 2005.","DOI":"10.1145\/1060590.1060603"},{"key":"9446_CR89","doi-asserted-by":"crossref","unstructured":"J.\u00a0Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC), pages 387\u2013394, 1990.","DOI":"10.1145\/100216.100269"},{"key":"9446_CR90","doi-asserted-by":"crossref","unstructured":"A.\u00a0Sahai and B.\u00a0Waters. How to use indistinguishability obfuscation: deniable encryption, and more. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC), pages 475\u2013484, 2014.","DOI":"10.1145\/2591796.2591825"},{"issue":"11","key":"9446_CR91","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"A.\u00a0Shamir. How to share a secret. Communications of the ACM, 22 (11): 612\u2013613, 1979.","journal-title":"Communications of the ACM"},{"key":"9446_CR92","doi-asserted-by":"crossref","unstructured":"M.\u00a0Venkitasubramaniam. On adaptively secure protocols. In Proceedings of the 9th Conference on Security and Cryptography for Networks (SCN), pages 455\u2013475, 2014.","DOI":"10.1007\/978-3-319-10879-7_26"},{"key":"9446_CR93","doi-asserted-by":"crossref","unstructured":"A.\u00a0C. Yao. How to generate and exchange secrets (extended abstract). In Proceedings of the 27th Annual Symposium on Foundations of Computer Science (FOCS), pages 162\u2013167, 1986.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09446-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-023-09446-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09446-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T21:32:49Z","timestamp":1729114369000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-023-09446-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,22]]},"references-count":93,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["9446"],"URL":"https:\/\/doi.org\/10.1007\/s00145-023-09446-6","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,22]]},"assertion":[{"value":"28 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"11"}}