{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T10:58:15Z","timestamp":1772276295505,"version":"3.50.1"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030643775","type":"print"},{"value":"9783030643782","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64378-2_20","type":"book-chapter","created":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T15:02:46Z","timestamp":1607785366000},"page":"562-594","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[]},{"given":"Eliran","family":"Kachlon","sequence":"additional","affiliation":[]},{"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,9]]},"reference":[{"issue":"22","key":"20_CR1","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1016\/j.ipl.2012.08.003","volume":"112","author":"S Agrawal","year":"2012","unstructured":"Agrawal, S.: Verifiable secret sharing in a total of three rounds. Inf. Process. Lett. 112(22), 856\u2013859 (2012). https:\/\/doi.org\/10.1016\/j.ipl.2012.08.003","journal-title":"Inf. Process. Lett."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Ananth, P., Choudhuri, A.R., Goel, A., Jain, A.: Round-optimal secure multiparty computation with honest majority. In: Advances in Cryptology - CRYPTO 2018\u201338th Annual International Cryptology Conference Proceedings, Part II. pp. 395\u2013424, Santa Barbara, CA, USA, August 19\u201323 (2018)","DOI":"10.1007\/978-3-319-96881-0_14"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Ananth, P., Choudhuri, A.R., Goel, A., Jain, A.: Two round information-theoretic MPC with malicious security. In: Advances in Cryptology - EUROCRYPT 2019\u201338th Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings, Part II. pp. 532\u2013561, Darmstadt, Germany, May 19\u201323(2019)","DOI":"10.1007\/978-3-030-17656-3_19"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Brakerski, Z., Tsabary, R.: Perfect secure computation in two rounds. In: Theory of Cryptography - 16th International Conference Proceedings, Part I. TCC 2018, pp. 152\u2013174, Panaji, India, November 11\u201314 (2018)","DOI":"10.1007\/978-3-030-03807-6_6"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Brakerski, Z., Tsabary, R.: Degree 2 is complete for the round-complexity of malicious MPC. In: Advances in Cryptology - EUROCRYPT 2019\u201338th Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings, Part II. pp. 504\u2013531, Darmstadt, Germany, May 19\u201323(2019)","DOI":"10.1007\/978-3-030-17656-3_18"},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1137\/S0097539705446950","volume":"36","author":"B Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC$$^0$$. SIAM J. Comput. 36(4), 845\u2013888 (2006)","journal-title":"SIAM J. Comput."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Kachlon, E., Patra, A.: The resiliency of mpc with low interaction: The benefit of making errors (2020)","DOI":"10.1007\/978-3-030-64378-2_20"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Kachlon, E., Patra, A.: The round complexity of perfect mpc with active security and optimal resiliency. In: Proceedings of 61st FOCS (2020). https:\/\/eprint.iacr.org\/2020\/581","DOI":"10.1109\/FOCS46700.2020.00121"},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s00145-015-9214-4","volume":"30","author":"G Asharov","year":"2017","unstructured":"Asharov, G., Lindell, Y.: A full proof of the BGW protocol for perfectly secure multiparty computation. J. Cryptol. 30(1), 58\u2013151 (2017)","journal-title":"J. Cryptol."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Backes, M., Kate, A., Patra, A.: Computational verifiable secret sharing revisited. In: Advances in Cryptology - ASIACRYPT 2011\u201317th International Conference on the Theory and Application of Cryptology and Information Security Proceedings. pp. 590\u2013609, Seoul, South Korea, December 4\u20138 (2011)","DOI":"10.1007\/978-3-642-25385-0_32"},{"key":"20_CR11","unstructured":"Badrinarayanan, S., Jain, A., Manohar, N., Sahai, A.: Secure MPC: laziness leads to GOD. IACR Cryptology ePrint Archive 2018, 580 (2018). https:\/\/eprint.iacr.org\/2018\/580"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In: Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, pp. 201\u2013209, Edmonton, Alberta, Canada, August 14\u201316 (1989)","DOI":"10.1145\/72981.72995"},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1137\/050641958","volume":"37","author":"B Barak","year":"2007","unstructured":"Barak, B., Ong, S.J., Vadhan, S.P.: Derandomization in cryptography. SIAM J. Comput. 37(2), 380\u2013400 (2007). https:\/\/doi.org\/10.1137\/050641958","journal-title":"SIAM J. Comput."},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34","DOI":"10.1007\/3-540-46766-1_34"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/0-387-34805-0_49","volume-title":"Advances in Cryptology \u2014 CRYPTO 1989 Proceedings","author":"D Beaver","year":"1990","unstructured":"Beaver, D.: Multiparty protocols tolerating half faulty processors. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 560\u2013572. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_49"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Beaver, D., Feigenbaum, J., Kilian, J., Rogaway, P.: Security with low communication overhead. In: Advances in Cryptology - CRYPTO 1990, 10th Annual International Cryptology Conference, pp. 62\u201376, Santa Barbara, California, USA, August 11\u201315 (1990)","DOI":"10.1007\/3-540-38424-3_5"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 1\u201310, Chicago, Illinois, USA, May 2\u20134 (1988)","DOI":"10.1145\/62212.62213"},{"key":"20_CR18","unstructured":"Blum, M.: Coin flipping by telephone. In: Advances in Cryptology: A Report on CRYPTO 81, CRYPTO 81, IEEE Workshop on Communications Security, pp. 11\u201315, Santa Barbara, California, USA, August 24\u201326 (1981)"},{"key":"20_CR19","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zero-knowledge requires omega\u00a0(log n) rounds. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing. pp. 570\u2013579, Heraklion, Crete, Greece, July 6\u20138 (2001)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing. pp. 42\u201351, San Diego, CA, USA, May 16\u201318 (1993)","DOI":"10.1145\/167088.167105"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 11\u201319, Chicago, Illinois, USA, May 2\u20134 (1988)","DOI":"10.1145\/62212.62214"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing. pp. 62\u201372. STOC 1989, Association for Computing Machinery, New York, USA (1989). https:\/\/doi.org\/10.1145\/73007.73013","DOI":"10.1145\/73007.73013"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, pp. 383\u2013395 USA, October 21\u201323 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Cleve, R.: 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, pp. 364\u2013369, Berkeley, California, USA, May 28\u201330 (1986)","DOI":"10.1145\/12130.12168"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Advances in Cryptology - EUROCRYPT 1999, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, pp. 311\u2013326, May 2\u20136(1999)","DOI":"10.1007\/3-540-48910-X_22"},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.M.: General secure multi-party computation from any linear secret-sharing scheme. In: Advances in Cryptology - EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques, pp. 316\u2013334, Bruges, Belgium, May 14\u201318 (2000)","DOI":"10.1007\/3-540-45539-6_22"},{"issue":"1","key":"20_CR27","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D Dolev","year":"1985","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for byzantine agreement. J. ACM 32(1), 191\u2013204 (1985)","journal-title":"J. ACM"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, pp. 554\u2013563, Montr\u00e9al, Qu\u00e9bec, Canada, May 23\u201325 (1994)","DOI":"10.1145\/195058.195408"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Feldman, P., Micali, S.: Byzantine agreement in constant expected time (and trusting no one). In: 26th Annual Symposium on Foundations of Computer Science, pp. 267\u2013276, Portland, Oregon, USA, October 21\u201323 (1985)","DOI":"10.1109\/SFCS.1985.14"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Garay, J.A., Gollakota, S., Rangan, C.P., Srinathan, K.: Round-optimal and efficient verifiable secret sharing. In: Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, pp. 329\u2013342, New York, USA, March 4\u20137 (2006)","DOI":"10.1007\/11681878_17"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-03807-6_5","volume-title":"Theory of Cryptography","author":"S Garg","year":"2018","unstructured":"Garg, S., Ishai, Y., Srinivasan, A.: Two-round mpc: information-theoretic and black-box. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 123\u2013151. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_5"},{"key":"20_CR32","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, pp. 580\u2013589, Heraklion, Crete, Greece, July 6\u20138 (2001)","DOI":"10.1145\/380752.380853"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing. pp. 580\u2013589. ACM (2001)","DOI":"10.1145\/380752.380853"},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: On 2-round secure multiparty computation. In: Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, pp. 178\u2013193, Santa Barbara, California, USA, August 18\u201322 (2002)","DOI":"10.1007\/3-540-45708-9_12"},{"issue":"1","key":"20_CR35","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAM J. Comput. 25(1), 169\u2013192 (1996)","journal-title":"SIAM J. Comput."},{"key":"20_CR36","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 25\u201332, Seattle, Washigton, USA May 14\u201317 (1989)","DOI":"10.1145\/73007.73010"},{"key":"20_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-662-48000-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"Y Ishai","year":"2015","unstructured":"Ishai, Y., Kumaresan, R., Kushilevitz, E., Paskin-Cherniavsky, A.: Secure computation with minimal interaction, revisited. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 359\u2013378. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_18"},{"key":"20_CR38","unstructured":"Ishai, Y., Kushilevitz, E.: Private simultaneous messages protocols with applications. In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, pp. 174\u2013184, Ramat-Gan, Israel, June 17\u201319 (1997)"},{"key":"20_CR39","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: A new representation with applications to round-efficient secure computation. In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, pp. 294\u2013304, Redondo Beach, California, USA, November 12\u201314 (2000)"},{"key":"20_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45465-9_22","volume-title":"Automata, Languages and Programming","author":"Y Ishai","year":"2002","unstructured":"Ishai, Y., Kushilevitz, E.: Perfect constant-round secure computation via perfect randomizing polynomials. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 244\u2013256. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_22"},{"key":"20_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-14623-7_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"Y Ishai","year":"2010","unstructured":"Ishai, Y., Kushilevitz, E., Paskin, A.: Secure multiparty computation with minimal interaction. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 577\u2013594. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_31"},{"issue":"8","key":"20_CR42","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/j.ic.2009.03.007","volume":"207","author":"J Katz","year":"2009","unstructured":"Katz, J., Koo, C., Kumaresan, R.: Improving the round complexity of VSS in point-to-point networks. Inf. Comput. 207(8), 889\u2013899 (2009)","journal-title":"Inf. Comput."},{"key":"20_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-642-17373-8_25","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"R Kumaresan","year":"2010","unstructured":"Kumaresan, R., Patra, A., Rangan, C.P.: The round complexity of verifiable secret sharing: the statistical case. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 431\u2013447. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_25"},{"key":"20_CR44","unstructured":"Lamport, L., Fischer, M.: Byzantine generals and transaction commit protocols. Technical Report 62, SRI International (1982)"},{"issue":"3","key":"20_CR45","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s00145-015-9199-z","volume":"29","author":"T Moran","year":"2016","unstructured":"Moran, T., Naor, M., Segev, G.: An optimally fair coin toss. J. Cryptology 29(3), 491\u2013513 (2016). https:\/\/doi.org\/10.1007\/s00145-015-9199-z","journal-title":"J. Cryptology"},{"key":"20_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-03356-8_29","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"A Patra","year":"2009","unstructured":"Patra, A., Choudhary, A., Rabin, T., Rangan, C.P.: The round complexity of verifiable secret sharing revisited. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 487\u2013504. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_29"},{"key":"20_CR47","doi-asserted-by":"crossref","unstructured":"Patra, A., Choudhary, A., Rangan, C.P.: Simple and efficient asynchronous byzantine agreement with optimal resilience. In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, pp. 92\u2013101, Calgary, Alberta, Canada, August 10\u201312 (2009)","DOI":"10.1145\/1582716.1582736"},{"key":"20_CR48","unstructured":"Patra, A., Rangan, C.P.: Communication and round efficient information checking protocol. CoRR abs\/1004.3504 (2010). http:\/\/arxiv.org\/abs\/1004.3504"},{"issue":"6","key":"20_CR49","doi-asserted-by":"publisher","first-page":"4207","DOI":"10.1109\/TIT.2018.2827360","volume":"64","author":"A Patra","year":"2018","unstructured":"Patra, A., Ravi, D.: On the power of hybrid networks in multi-party computation. IEEE Trans. Inf. Theory 64(6), 4207\u20134227 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"20_CR50","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"20_CR51","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 73\u201385, Seattle, Washigton, USA, May 14\u201317 (1989)","DOI":"10.1145\/73007.73014"},{"key":"20_CR52","unstructured":"Sander, T., Young, A.L., Yung, M.: Non-interactive cryptocomputing for NC1. In: 40th Annual Symposium on Foundations of Computer Science, FOCS 1999, pp. 554\u2013567, New York, USA, October 17\u201318 (1999)"},{"key":"20_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-47721-7_20","volume-title":"Advances in Cryptology \u2014 CRYPTO 1986","author":"M Tompa","year":"1987","unstructured":"Tompa, M., Woll, H.: How to share a secret with cheaters. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 261\u2013265. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_20"},{"issue":"4","key":"20_CR54","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/s00145-018-9278-z","volume":"31","author":"D Unruh","year":"2018","unstructured":"Unruh, D.: Everlasting multi-party computation. J. Cryptology 31(4), 965\u20131011 (2018). https:\/\/doi.org\/10.1007\/s00145-018-9278-z","journal-title":"J. Cryptology"},{"key":"20_CR55","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, pp. 80\u201391, Chicago, Illinois, USA, November 3\u20135 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64378-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T01:05:43Z","timestamp":1702343143000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64378-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030643775","9783030643782"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64378-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"167","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}