{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:54:43Z","timestamp":1765961683861,"version":"3.28.0"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T00:00:00Z","timestamp":1686182400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T00:00:00Z","timestamp":1686182400000},"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,7]]},"DOI":"10.1007\/s00145-023-09465-3","type":"journal-article","created":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T16:01:36Z","timestamp":1686240096000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model"],"prefix":"10.1007","volume":"36","author":[{"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,8]]},"reference":[{"key":"9465_CR1","doi-asserted-by":"crossref","unstructured":"Benny Applebaum, Ivan Damg\u00e5rd, Yuval Ishai, Michael Nielsen, and Lior Zichron. Secure arithmetic computation with constant computational overhead. In CRYPTO, pages 223\u2013254, 2017.","DOI":"10.1007\/978-3-319-63688-7_8"},{"key":"9465_CR2","doi-asserted-by":"crossref","unstructured":"Scott Ames, Carmit Hazay, Yuval Ishai, and Muthuramakrishnan Venkitasubramaniam. Ligero: Lightweight sublinear arguments without a trusted setup. In Proc. ACM CCS 2017, to appear, 2017.","DOI":"10.1145\/3133956.3134104"},{"key":"9465_CR3","first-page":"171","volume":"2019","author":"Benny Applebaum","year":"2019","unstructured":"Benny Applebaum and Eliran Kachlon. Sampling graphs without forbidden subgraphs and unbalanced expanders with negligible error. In David Zuckerman, editor, FOCS 2019, pages 171\u2013179, 2019.","journal-title":"In David Zuckerman, editor, FOCS"},{"key":"9465_CR4","doi-asserted-by":"crossref","unstructured":"Arash Afshar, Payman Mohassel, Benny Pinkas, and Ben Riva. Non-interactive secure computation based on cut-and-choose. In EUROCRYPT, pages 387\u2013404, 2014.","DOI":"10.1007\/978-3-642-55220-5_22"},{"key":"9465_CR5","doi-asserted-by":"crossref","unstructured":"Gilles Brassard, Claude Cr\u00e9peau, and Jean-Marc Robert. All-or-nothing disclosure of secrets. In CRYPTO, pages 234\u2013238, 1986.","DOI":"10.1007\/3-540-47721-7_17"},{"key":"9465_CR6","doi-asserted-by":"crossref","unstructured":"Elette Boyle, Niv Gilboa, and Yuval Ishai. Group-based secure computation: Optimizing rounds, communication, and computation. In EUROCRYPT, pages 163\u2013193, 2017.","DOI":"10.1007\/978-3-319-56614-6_6"},{"key":"9465_CR7","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In STOC, pages 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"9465_CR8","doi-asserted-by":"crossref","unstructured":"Mihir Bellare, Viet\u00a0Tung Hoang, and Phillip Rogaway. Foundations of garbled circuits. In CCS, pages 784\u2013796, 2012.","DOI":"10.1145\/2382196.2382279"},{"key":"9465_CR9","doi-asserted-by":"crossref","unstructured":"Donald Beaver, Silvio Micali, and Phillip Rogaway. The round complexity of secure protocols (extended abstract). In STOC, pages 503\u2013513, 1990.","DOI":"10.1145\/100216.100287"},{"key":"9465_CR10","unstructured":"Calctopia. https:\/\/www.calctopia.com\/."},{"key":"9465_CR11","doi-asserted-by":"crossref","unstructured":"Hao Chen and Ronald Cramer. Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. In CRYPTO, pages 521\u2013536, 2006.","DOI":"10.1007\/11818175_31"},{"key":"9465_CR12","doi-asserted-by":"crossref","unstructured":"David Chaum, Claude Cr\u00e9peau, and Ivan Damg\u00e5rd. Multiparty unconditionally secure protocols (extended abstract). In STOC, pages 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"9465_CR13","doi-asserted-by":"crossref","unstructured":"Ignacio Cascudo, Ronald Cramer, and Chaoping Xing. The arithmetic codex. In IEEE Information Theory Workshop, pages 75\u201379, 2012.","DOI":"10.1109\/ITW.2012.6404767"},{"key":"9465_CR14","first-page":"940","volume":"2018","author":"Melissa Chase","year":"2018","unstructured":"Melissa Chase, Yevgeniy Dodis, Yuval Ishai, Daniel Kraschewski, Tianren Liu, Rafail Ostrovsky, and Vinod Vaikuntanathan. Reusable non-interactive secure computation. IACR Cryptology ePrint Archive, 2018:940, 2018.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"9465_CR15","doi-asserted-by":"crossref","unstructured":"Ronald Cramer, Ivan Damg\u00e5rd, and Ueli\u00a0M. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In EUROCRYPT, pages 316\u2013334, 2000.","DOI":"10.1007\/3-540-45539-6_22"},{"key":"9465_CR16","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Yuval Ishai. Constant-round multiparty computation using a black-box pseudorandom generator. In CRYPTO, pages 378\u2013394, 2005.","DOI":"10.1007\/11535218_23"},{"key":"9465_CR17","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Yuval Ishai. Scalable secure multiparty computation. In CRYPTO, pages 501\u2013520, 2006.","DOI":"10.1007\/11818175_30"},{"key":"9465_CR18","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd, Yuval Ishai, and Mikkel Kr\u00f8igaard. Perfectly secure multiparty computation and the computational overhead of cryptography. In EUROCRYPT, pages 445\u2013465, 2010.","DOI":"10.1007\/978-3-642-13190-5_23"},{"key":"9465_CR19","doi-asserted-by":"crossref","unstructured":"Uriel Feige, Joe Kilian, and Moni Naor. A minimal model for secure computation (extended abstract). In STOC, pages 554\u2013563, 1994.","DOI":"10.1145\/195058.195408"},{"key":"9465_CR20","doi-asserted-by":"crossref","unstructured":"Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO, pages 186\u2013194, 1987.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"9465_CR21","doi-asserted-by":"crossref","unstructured":"Matthew\u00a0K. Franklin and Moti Yung. Communication complexity of secure computation (extended abstract). In STOC, pages 699\u2013710, 1992.","DOI":"10.1145\/129712.129780"},{"key":"9465_CR22","doi-asserted-by":"crossref","unstructured":"Craig Gentry. Fully homomorphic encryption using ideal lattices. In STOC, pages 169\u2013178, 2009.","DOI":"10.1145\/1536414.1536440"},{"issue":"4","key":"9465_CR23","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"Oded Goldreich","year":"1986","unstructured":"Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions. J. ACM, 33(4):792\u2013807, 1986.","journal-title":"J. ACM"},{"key":"9465_CR24","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or A completeness theorem for protocols with honest majority. In STOC, pages 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"9465_CR25","doi-asserted-by":"crossref","unstructured":"Carmit Hazay, Yuval Ishai, and Muthuramakrishnan Venkitasubramaniam. Actively secure garbled circuits with constant communication overhead in the plain model. In TCC, pages 3\u201339, 2017.","DOI":"10.1007\/978-3-319-70503-3_1"},{"key":"9465_CR26","doi-asserted-by":"crossref","unstructured":"Yan Huang, Jonathan Katz, and David Evans. Quid-pro-quo-tocols: Strengthening semi-honest protocols with dual execution. In IEEE Symposium on Security and Privacy, pages 272\u2013284, 2012.","DOI":"10.1109\/SP.2012.43"},{"key":"9465_CR27","doi-asserted-by":"crossref","unstructured":"Yan Huang, Jonathan Katz, and David Evans. Efficient secure two-party computation using symmetric cut-and-choose. In CRYPTO, pages 18\u201335, 2013.","DOI":"10.1007\/978-3-642-40084-1_2"},{"key":"9465_CR28","doi-asserted-by":"crossref","unstructured":"Yan Huang, Jonathan Katz, Vladimir Kolesnikov, Ranjit Kumaresan, and Alex\u00a0J. Malozemoff. Amortizing garbled circuits. In CRYPTO, pages 458\u2013475, 2014.","DOI":"10.1007\/978-3-662-44381-1_26"},{"key":"9465_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8","volume-title":"Efficient Secure Two-Party Protocols - Techniques and Constructions","author":"Carmit Hazay","year":"2010","unstructured":"Carmit Hazay and Yehuda Lindell. Efficient Secure Two-Party Protocols - Techniques and Constructions. Information Security and Cryptography. Springer, 2010."},{"key":"9465_CR30","doi-asserted-by":"crossref","unstructured":"Yuval Ishai and Eyal Kushilevitz. Perfect constant-round secure computation via perfect randomizing polynomials. In ICALP, pages 244\u2013256, 2002.","DOI":"10.1007\/3-540-45465-9_22"},{"key":"9465_CR31","doi-asserted-by":"crossref","unstructured":"Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, and David Zuckerman. Robust pseudorandom generators. In ICALP, pages 576\u2013588, 2013.","DOI":"10.1007\/978-3-642-39206-1_49"},{"key":"9465_CR32","doi-asserted-by":"crossref","unstructured":"Yuval Ishai, Joe Kilian, Kobbi Nissim, and Erez Petrank. Extending oblivious transfers efficiently. In CRYPTO, pages 145\u2013161, 2003.","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"9465_CR33","doi-asserted-by":"crossref","unstructured":"Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, and Amit Sahai. Efficient non-interactive secure computation. In EUROCRYPT, pages 406\u2013425, 2011.","DOI":"10.1007\/978-3-642-20465-4_23"},{"key":"9465_CR34","doi-asserted-by":"crossref","unstructured":"Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. Zero-knowledge from secure multiparty computation. In STOC, pages 21\u201330, 2007.","DOI":"10.1145\/1250790.1250794"},{"key":"9465_CR35","doi-asserted-by":"crossref","unstructured":"Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. Cryptography with constant computational overhead. In STOC, pages 433\u2013442, 2008.","DOI":"10.1145\/1374376.1374438"},{"issue":"3","key":"9465_CR36","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1137\/080725398","volume":"39","author":"Yuval Ishai","year":"2009","unstructured":"Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. Zero-knowledge proofs from secure multiparty computation. SIAM J. Comput., 39(3):1121\u20131152, 2009.","journal-title":"SIAM J. Comput."},{"key":"9465_CR37","doi-asserted-by":"crossref","unstructured":"Yuval Ishai, Mohammad Mahmoody, and Amit Sahai. On efficient zero-knowledge pcps. In TCC, pages 151\u2013168, 2012.","DOI":"10.1007\/978-3-642-28914-9_9"},{"key":"9465_CR38","doi-asserted-by":"crossref","unstructured":"Yuval Ishai, Manoj Prabhakaran, and Amit Sahai. Founding cryptography on oblivious transfer - efficiently. In CRYPTO, pages 572\u2013591, 2008.","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"9465_CR39","doi-asserted-by":"crossref","unstructured":"Yuval Ishai, Manoj Prabhakaran, and Amit Sahai. Secure arithmetic computation with no honest majority. In TCC, pages 294\u2013314, 2009.","DOI":"10.1007\/978-3-642-00457-5_18"},{"key":"9465_CR40","doi-asserted-by":"crossref","unstructured":"Yuval Ishai and Mor Weiss. Probabilistically checkable proofs of proximity with zero-knowledge. In TCC, pages 121\u2013145, 2014.","DOI":"10.1007\/978-3-642-54242-8_6"},{"key":"9465_CR41","doi-asserted-by":"crossref","unstructured":"Stanislaw Jarecki and Vitaly Shmatikov. Efficient two-party secure computation on committed inputs. In EUROCRYPT, pages 97\u2013114, 2007.","DOI":"10.1007\/978-3-540-72540-4_6"},{"key":"9465_CR42","doi-asserted-by":"crossref","unstructured":"Joe Kilian. Founding cryptography on oblivious transfer. In STOC, pages 20\u201331, 1988.","DOI":"10.1145\/62212.62215"},{"key":"9465_CR43","first-page":"491","volume":"2013","author":"Vladimir Kolesnikov","year":"2013","unstructured":"Vladimir Kolesnikov and Ranjit Kumaresan. Improved OT extension for transferring short secrets. IACR Cryptology ePrint Archive, 2013:491, 2013.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"9465_CR44","doi-asserted-by":"crossref","unstructured":"Marcel Keller, Emmanuela Orsini, and Peter Scholl. Actively secure OT extension with optimal overhead. In CRYPTO, pages 724\u2013741, 2015.","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"9465_CR45","doi-asserted-by":"crossref","unstructured":"Marcel Keller, Emmanuela Orsini, and Peter Scholl. MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, October 24-28, 2016, pages 830\u2013842, 2016.","DOI":"10.1145\/2976749.2978357"},{"key":"9465_CR46","doi-asserted-by":"crossref","unstructured":"Jonathan Katz, Samuel Ranellucci, Mike Rosulek, and Xiao Wang. Optimizing authenticated garbling for faster secure two-party computation. In CRYPTO, pages 365\u2013391, 2018.","DOI":"10.1007\/978-3-319-96878-0_13"},{"key":"9465_CR47","doi-asserted-by":"crossref","unstructured":"Vladimir Kolesnikov and Thomas Schneider. Improved garbled circuit: Free XOR gates and applications. In ICALP, pages 486\u2013498, 2008.","DOI":"10.1007\/978-3-540-70583-3_40"},{"issue":"2","key":"9465_CR48","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/s00145-015-9198-0","volume":"29","author":"Yehuda Lindell","year":"2016","unstructured":"Yehuda Lindell. Fast cut-and-choose-based protocols for malicious and covert adversaries. J. Cryptology, 29(2):456\u2013490, 2016.","journal-title":"J. Cryptology"},{"key":"9465_CR49","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell and Benny Pinkas. An efficient protocol for secure two-party computation in the presence of malicious adversaries. In EUROCRYPT, pages 52\u201378, 2007.","DOI":"10.1007\/978-3-540-72540-4_4"},{"issue":"4","key":"9465_CR50","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/s00145-011-9107-0","volume":"25","author":"Yehuda Lindell","year":"2012","unstructured":"Yehuda Lindell and Benny Pinkas. Secure two-party computation via cut-and-choose oblivious transfer. J. Cryptology, 25(4):680\u2013722, 2012.","journal-title":"J. Cryptology"},{"key":"9465_CR51","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell, Benny Pinkas, Nigel\u00a0P. Smart, and Avishay Yanai. Efficient constant round multi-party computation combining BMR and SPDZ. In CRYPTO, pages 319\u2013338, 2015.","DOI":"10.1007\/978-3-662-48000-7_16"},{"key":"9465_CR52","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell and Ben Riva. Cut-and-choose Yao-based secure computation in the online\/offline and batch settings. In CRYPTO, pages 476\u2013494, 2014.","DOI":"10.1007\/978-3-662-44381-1_27"},{"key":"9465_CR53","doi-asserted-by":"crossref","unstructured":"Payman Mohassel and Matthew\u00a0K. Franklin. Efficiency tradeoffs for malicious two-party computation. In PKC, pages 458\u2013473, 2006.","DOI":"10.1007\/11745853_30"},{"key":"9465_CR54","doi-asserted-by":"crossref","unstructured":"Elchanan Mossel, Amir Shpilka, and Luca Trevisan. On e-biased generators in NC0. In FOCS, pages 136\u2013145, 2003.","DOI":"10.1109\/SFCS.2003.1238188"},{"key":"9465_CR55","doi-asserted-by":"crossref","unstructured":"Jesper\u00a0Buus Nielsen, Peter\u00a0Sebastian Nordholt, Claudio Orlandi, and Sai\u00a0Sheshank Burra. A new approach to practical active-secure two-party computation. In CRYPTO, pages 681\u2013700, 2012.","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"9465_CR56","doi-asserted-by":"crossref","unstructured":"Jesper\u00a0Buus Nielsen and Claudio Orlandi. Cross and clean: Amortized garbled circuits with constant overhead. In TCC, pages 582\u2013603, 2016.","DOI":"10.1007\/978-3-662-53641-4_22"},{"key":"9465_CR57","doi-asserted-by":"crossref","unstructured":"Jesper\u00a0Buus Nielsen, Thomas Schneider, and Roberto Trifiletti. Constant round maliciously secure 2pc with function-independent preprocessing using LEGO. IACR Cryptology ePrint Archive, 2016:1069, 2016.","DOI":"10.14722\/ndss.2017.23075"},{"key":"9465_CR58","doi-asserted-by":"crossref","unstructured":"Jesper\u00a0Buus Nielsen, Thomas Schneider, and Roberto Trifiletti. Constant round maliciously secure 2PC with function-independent preprocessing using LEGO. In NDSS, 2017.","DOI":"10.14722\/ndss.2017.23075"},{"key":"9465_CR59","doi-asserted-by":"crossref","unstructured":"Chris Peikert, Vinod Vaikuntanathan, and Brent Waters. A framework for efficient and composable oblivious transfer. In CRYPTO, pages 554\u2013571, 2008.","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"9465_CR60","unstructured":"Peter Rindal and Mike Rosulek. Faster malicious 2-party secure computation with online\/offline dual execution. In 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016., pages 297\u2013314, 2016."},{"issue":"11","key":"9465_CR61","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"Adi Shamir","year":"1979","unstructured":"Adi Shamir. How to share a secret. Commun. ACM, 22(11):612\u2013613, 1979.","journal-title":"Commun. ACM"},{"key":"9465_CR62","doi-asserted-by":"crossref","unstructured":"Daniel\u00a0A. Spielman. Linear-time encodable and decodable error-correcting codes. In STOC, pages 388\u2013397, 1995.","DOI":"10.1145\/225058.225165"},{"key":"9465_CR63","doi-asserted-by":"crossref","unstructured":"Abhi Shelat and Chih-Hao Shen. Fast two-party secure computation with minimal assumptions. In CCS, pages 523\u2013534, 2013.","DOI":"10.1145\/2508859.2516698"},{"key":"9465_CR64","doi-asserted-by":"crossref","unstructured":"Xiao Wang, Alex\u00a0J. Malozemoff, and Jonathan Katz. Faster secure two-party computation in the single-execution setting. In EUROCRYPT, pages 399\u2013424, 2017.","DOI":"10.1007\/978-3-319-56617-7_14"},{"key":"9465_CR65","doi-asserted-by":"crossref","unstructured":"Xiao Wang, Samuel Ranellucci, and Jonathan Katz. Authenticated garbling and efficient maliciously secure multi-party computation. In Proc. ACM CCS, to appear, 2017. Full version: Cryptology ePrint Archive, Report 2017\/030.","DOI":"10.1145\/3133956.3134053"},{"key":"9465_CR66","unstructured":"Andrew\u00a0Chi-Chih Yao. How to generate and exchange secrets (extended abstract). In FOCS, pages 162\u2013167, 1986."},{"key":"9465_CR67","doi-asserted-by":"crossref","unstructured":"Samee Zahur, Mike Rosulek, and David Evans. Two halves make a whole - reducing data transfer in garbled circuits using half gates. In EUROCRYPT, pages 220\u2013250, 2015.","DOI":"10.1007\/978-3-662-46803-6_8"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09465-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-023-09465-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09465-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T23:43:44Z","timestamp":1729554224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-023-09465-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,8]]},"references-count":67,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["9465"],"URL":"https:\/\/doi.org\/10.1007\/s00145-023-09465-3","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2023,6,8]]},"assertion":[{"value":"25 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"26"}}