{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T05:37:49Z","timestamp":1769837869975,"version":"3.49.0"},"publisher-location":"Cham","reference-count":62,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031486234","type":"print"},{"value":"9783031486241","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-48624-1_17","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T18:02:21Z","timestamp":1701021741000},"page":"452-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Simplex Consensus: A Simple and\u00a0Fast Consensus Protocol"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1406-9845","authenticated-orcid":false,"given":"Benjamin Y.","family":"Chan","sequence":"first","affiliation":[]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"17_CR1","unstructured":"Abraham, I.: Two round hotstuff. https:\/\/decentralizedthoughts.github.io\/2022-11-24-two-round-HS\/. Accessed: 2022-12-30"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Ben-David, N., Yandamuri, S.: Efficient and adaptively secure asynchronous binary agreement via binding crusader agreement. In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, pp. 381\u2013391 (2022)","DOI":"10.1145\/3519270.3538426"},{"key":"17_CR3","unstructured":"Abraham, I., Gueta, G., Malkhi, D.: Hot-stuff the linear, optimal-resilience, one-message bft devil. CoRR, abs\/1803.05069 (2018)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D., Spiegelman, A.: Asymptotically optimal validated asynchronous byzantine agreement. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 337\u2013346 (2019)","DOI":"10.1145\/3293611.3331612"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Abraham, I., Nayak, K., Ren, L., Xiang, Z.: Good-case latency of byzantine broadcast: a complete categorization. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pp. 331\u2013341 (2021)","DOI":"10.1145\/3465084.3467899"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Aiyer, A.S., Alvisi, L., Clement, A., Dahlin, M., Martin, J.P., Porth, C.: Bar fault tolerance for cooperative services. In: Proceedings of the Twentieth ACM Symposium on Operating Systems Principles, pp. 45\u201358 (2005)","DOI":"10.1145\/1095810.1095816"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Allen, S., Juels, A., Khaire, M., Kell, T., Shrivastava, S.: Nfts for art and collectables: Primer and outlook (2022)","DOI":"10.31235\/osf.io\/gwzd7"},{"key":"17_CR8","unstructured":"Apache Software Foundation: ZooKeeper internals. https:\/\/zookeeper.apache.org\/doc\/r3.4.13\/zookeeperInternals.html. Accessed 24 Feb 2023"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Backes, M., Manoharan, P., Mohammadi, E.: Tuc: time-sensitive and modular analysis of anonymous communication. In: 2014 IEEE 27th Computer Security Foundations Symposium, pp. 383\u2013397. IEEE (2014)","DOI":"10.1109\/CSF.2014.34"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 186\u2013195. IEEE (2004)","DOI":"10.1109\/FOCS.2004.71"},{"key":"17_CR11","unstructured":"Baudet, M., et al.: State machine replication in the libra blockchain. The Libra Assn., Technical report 7 (2019)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Baum, C., David, B., Dowsley, R., Nielsen, J.B., Oechsner, S.: Tardis: a foundation of time-lock puzzles in UC. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 429\u2013459. Springer (2021)","DOI":"10.1007\/978-3-030-77883-5_15"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Boyle, E., Chung, K.M., Pass, R.: Large-scale secure computation: Multi-party computation for (parallel) ram programs. In: Advances in Cryptology-CRYPTO 2015: 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16\u201320, 2015, Proceedings, Part II, pp. 742\u2013762. Springer (2015)","DOI":"10.1007\/978-3-662-48000-7_36"},{"key":"17_CR14","unstructured":"Buchman, E., Kwon, J., Milosevic, Z.: The latest gossip on bft consensus. arXiv preprint arXiv:1807.04938 (2018)"},{"key":"17_CR15","unstructured":"Burrows, M.: The chubby lock service for loosely-coupled distributed systems. In: Proceedings of the 7th Symposium on Operating Systems Design and Implementation, pp. 335\u2013350 (2006)"},{"key":"17_CR16","unstructured":"Buterin, V., Griffith, V.: Casper the friendly finality gadget. arXiv preprint arXiv:1710.09437 (2017)"},{"key":"17_CR17","unstructured":"Buterin, V., et al.: A next-generation smart contract and decentralized application platform. White Paper 3(37), 2\u20131 (2014)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in constantinopole: practical asynchronous byzantine agreement using cryptography. In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 123\u2013132 (2000)","DOI":"10.1145\/343477.343531"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Drijvers, M., Hanke, T., Pignolet, Y.A., Shoup, V., Williams, D.: Internet computer consensus. In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, pp. 81\u201391 (2022)","DOI":"10.1145\/3519270.3538430"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Canetti, R., Hogan, K., Malhotra, A., Varia, M.: A universally composable treatment of network time. In: 2017 IEEE 30th Computer Security Foundations Symposium (CSF), pp. 360\u2013375. IEEE (2017)","DOI":"10.1109\/CSF.2017.38"},{"key":"17_CR22","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 (1993)","DOI":"10.1145\/167088.167105"},{"key":"17_CR23","unstructured":"Castro, M., Liskov, B., et al.: Practical byzantine fault tolerance. In: OsDI. 99, pp. 173\u2013186 (1999)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Chan, B.Y., Shi, E.: Streamlet: Textbook streamlined blockchains. In: Proceedings of the 2nd ACM Conference on Advances in Financial Technologies, pp. 1\u201311 (2020)","DOI":"10.1145\/3419614.3423256"},{"key":"17_CR25","unstructured":"Chan, B.Y., Shi, E.: Streamlet: Textbook streamlined blockchains (earlier version). Cryptology ePrint Archive, Paper 2020\/088 (2020). https:\/\/eprint.iacr.org\/archive\/2020\/088\/20200204:124247"},{"key":"17_CR26","unstructured":"Chan, T.H., Pass, R., Shi, E.: Pala: A simple partially synchronous blockchain. Cryptology ePrint Archive (2018)"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Chandran, N., Chongchitmate, W., Garay, J.A., Goldwasser, S., Ostrovsky, R., Zikas, V.: The hidden graph model: communication locality and optimal resiliency with adaptive faults. In: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, pp. 153\u2013162 (2015)","DOI":"10.1145\/2688073.2688102"},{"key":"17_CR28","unstructured":"Chen, J., Gorbunov, S., Micali, S., Vlachos, G.: Algorand agreement: super fast and partition resilient byzantine agreement. Cryptology ePrint Archive (2018)"},{"key":"17_CR29","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.tcs.2019.02.001","volume":"777","author":"J Chen","year":"2019","unstructured":"Chen, J., Micali, S.: Algorand: a secure and efficient distributed ledger. Theoret. Comput. Sci. 777, 155\u2013183 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Daian, P., Goldfeder, S., Kell, T., Li, Y., Zhao, X., Bentov, I., Breidenbach, L., Juels, A.: Flash boys 2.0: frontrunning in decentralized exchanges, miner extractable value, and consensus instability. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 910\u2013927. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00040"},{"issue":"2","key":"17_CR31","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM (JACM) 35(2), 288\u2013323 (1988)","journal-title":"J. ACM (JACM)"},{"key":"17_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-46803-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Garay","year":"2015","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 281\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10"},{"key":"17_CR33","doi-asserted-by":"publisher","unstructured":"Gelashvili, R., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A., Xiang, Z.: Jolteon and ditto: network-adaptive efficient consensus with asynchronous fallback. In: Financial Cryptography and Data Security: 26th International Conference, FC 2022, Grenada, May 2\u20136, 2022, Revised Selected Papers, pp. 296\u2013315. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_14","DOI":"10.1007\/978-3-031-18283-9_14"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: scaling byzantine agreements for cryptocurrencies. In: Proceedings of the 26th Symposium on Operating Systems Principles, pp. 51\u201368 (2017)","DOI":"10.1145\/3132747.3132757"},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kne\u017eevi\u0107, N., Qu\u00e9ma, V., Vukoli\u0107, M.: The next 700 bft protocols. In: Proceedings of the 5th European Conference on Computer Systems, EuroSys 2010, pp. 363\u2013376. ACM, New York (2010)","DOI":"10.1145\/1755913.1755950"},{"key":"17_CR36","doi-asserted-by":"crossref","unstructured":"Gueta, G.G., et al.: Sbft: a scalable and decentralized trust infrastructure. In: 2019 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 568\u2013580. IEEE (2019)","DOI":"10.1109\/DSN.2019.00063"},{"issue":"4","key":"17_CR37","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"17_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1007\/978-3-030-17653-2_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"T-H Hubert Chan","year":"2019","unstructured":"Hubert Chan, T.-H., Pass, R., Shi, E.: Consensus through herding. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 720\u2013749. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_24"},{"key":"17_CR39","unstructured":"Jalalzai, M.M., Niu, J., Feng, C., Gai, F.: Fast-hotstuff: a fast and resilient hotstuff protocol. arXiv preprint arXiv:2010.11454 (2020)"},{"key":"17_CR40","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Lindell, Y., Prabhakaran, M.: Concurrent general composition of secure protocols in the timing model. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 644\u2013653 (2005)","DOI":"10.1145\/1060590.1060687"},{"key":"17_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-36594-2_27","volume-title":"Theory of Cryptography","author":"J Katz","year":"2013","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 477\u2013498. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_27"},{"key":"17_CR42","doi-asserted-by":"crossref","unstructured":"Keidar, I., Kokoris-Kogias, E., Naor, O., Spiegelman, A.: All you need is dag. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pp. 165\u2013175 (2021)","DOI":"10.1145\/3465084.3467905"},{"key":"17_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-030-56877-1_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"M Kelkar","year":"2020","unstructured":"Kelkar, M., Zhang, F., Goldfeder, S., Juels, A.: Order-fairness for byzantine consensus. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 451\u2013480. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_16"},{"key":"17_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/978-3-662-49896-5_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"A Kiayias","year":"2016","unstructured":"Kiayias, A., Zhou, H.-S., Zikas, V.: Fair and robust multi-party computation using a global transaction ledger. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 705\u2013734. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_25"},{"key":"17_CR45","doi-asserted-by":"crossref","unstructured":"Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.L.: Zyzzyva: speculative byzantine fault tolerance. In: Proceedings of the 21st ACM Symposium on Operating Systems Principles 2007, SOSP 2007, Stevenson, Washington, USA, October 14\u201317, 2007, pp. 45\u201358 (2007)","DOI":"10.1145\/1294261.1294267"},{"key":"17_CR46","doi-asserted-by":"crossref","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133\u2013169 (1998)","DOI":"10.1145\/279227.279229"},{"key":"17_CR47","doi-asserted-by":"crossref","unstructured":"Lamport, L.: Paxos made simple. ACM SIGACT News (Distributed Computing Column) 32, 4 (Whole Number 121, December 2001), pp. 51\u201358 (2001)","DOI":"10.1145\/568425.568433"},{"issue":"3","key":"17_CR48","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"17_CR49","doi-asserted-by":"crossref","unstructured":"Martin, J.P., Alvisi, L.: Fast byzantine consensus. IEEE Trans. Dependable Secur. Comput. 3(3) (2006)","DOI":"10.1109\/TDSC.2006.35"},{"key":"17_CR50","doi-asserted-by":"crossref","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. In: Proceedings of the 2016 ACM SIGSAC Conference on computer and communications security, pp. 31\u201342 (2016)","DOI":"10.1145\/2976749.2978399"},{"key":"17_CR51","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system. Decentralized business review, p. 21260 (2008)"},{"key":"17_CR52","unstructured":"Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm. In: Proceedings of the 2014 USENIX Conference on USENIX Annual Technical Conference, USENIX ATC 2014, pp. 305\u2013320. USENIX Association, USA (2014)"},{"key":"17_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-319-70697-9_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"R Pass","year":"2017","unstructured":"Pass, R., Shi, E.: The sleepy model of consensus. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 380\u2013409. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_14"},{"key":"17_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-78375-8_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"R Pass","year":"2018","unstructured":"Pass, R., Shi, E.: Thunderella: blockchains with optimistic instant confirmation. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 3\u201333. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_1"},{"key":"17_CR55","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized byzantine generals. In: 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), pp. 403\u2013409. IEEE (1983)","DOI":"10.1109\/SFCS.1983.48"},{"key":"17_CR56","doi-asserted-by":"crossref","unstructured":"Reiter, M.K.: Secure agreement protocols: reliable and atomic group multicast in rampart. In: Proceedings of the 2nd ACM Conference on Computer and Communications Security, pp. 68\u201380 (1994)","DOI":"10.1145\/191177.191194"},{"key":"17_CR57","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 387\u2013394 (1990)","DOI":"10.1145\/100216.100269"},{"key":"17_CR58","doi-asserted-by":"crossref","unstructured":"Spiegelman, A., Giridharan, N., Sonnino, A., Kokoris-Kogias, L.: Bullshark: Dag BFT protocols made practical. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 2705\u20132718 (2022)","DOI":"10.1145\/3548606.3559361"},{"key":"17_CR59","doi-asserted-by":"crossref","unstructured":"Spiegelman, A., Giridharan, N., Sonnino, A., Kokoris-Kogias, L.: Bullshark: the partially synchronous version. arXiv preprint arXiv:2209.05633 (2022)","DOI":"10.1145\/3548606.3559361"},{"issue":"10","key":"17_CR60","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/PROC.1978.11114","volume":"66","author":"JH Wensley","year":"1978","unstructured":"Wensley, J.H., et al.: Sift: design and analysis of a fault-tolerant computer for aircraft control. Proc. IEEE 66(10), 1240\u20131255 (1978)","journal-title":"Proc. IEEE"},{"key":"17_CR61","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), pp. 160\u2013164. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"17_CR62","doi-asserted-by":"crossref","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: Hotstuff: BFT consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 347\u2013356 (2019)","DOI":"10.1145\/3293611.3331591"}],"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-031-48624-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:03:17Z","timestamp":1764118997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48624-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486234","9783031486241"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48624-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 November 2023","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2023\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"168","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":"68","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":"40% - 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":"3","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":"13","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}