{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:32:12Z","timestamp":1754159532402,"version":"3.41.2"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031957604"},{"type":"electronic","value":"9783031957611"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-95761-1_9","type":"book-chapter","created":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T09:30:27Z","timestamp":1750498227000},"page":"244-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sassafras: Efficient Batch Single Leader Election"],"prefix":"10.1007","author":[{"given":"Jeffrey","family":"Burdges","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizabeth","family":"Crites","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Handan K\u0131l\u0131n\u00e7","family":"Alper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alistair","family":"Stewart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Vasilyev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,22]]},"reference":[{"key":"9_CR1","unstructured":"Alper, H.K.: Network time with a consensus on clock. IACR Cryptol. ePrint Arch. (2019). https:\/\/eprint.iacr.org\/2019\/1348"},{"key":"9_CR2","unstructured":"Aptos: The aptos blockchain: Safe, scalable, and upgradeable web3 infrastructure (2022). https:\/\/aptosfoundation.org\/whitepaper\/aptos-whitepaper_en.pdf"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Azouvi, S., Cappelletti, D.: Private attacks in longest chain proof-of-stake protocols with single secret leader elections. In: Baldimtsi, F., Roughgarden, T. (eds.) AFT 2021, Arlington, Virginia, USA, September 26 - 28, 202, pp. 170\u2013182. ACM (2021). https:\/\/doi.org\/10.1145\/3479722.3480996","DOI":"10.1145\/3479722.3480996"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Badertscher, C., Gazi, P., Kiayias, A., Russell, A., Zikas, V.: Ouroboros genesis: Composable proof-of-stake blockchains with dynamic availability. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) CCS 2018, Toronto, ON, Canada, October 15-19, 2018, pp. 913\u2013930. ACM (2018). https:\/\/doi.org\/10.1145\/3243734.3243848","DOI":"10.1145\/3243734.3243848"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Bayer, S., Groth, J.: Efficient zero-knowledge argument for correctness of a shuffle. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012, Cambridge, UK, April 15-19, 2012. LNCS, vol.\u00a07237, pp. 263\u2013280. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_17","DOI":"10.1007\/978-3-642-29011-4_17"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Blackshear, S., et al.: Sui lutris: a blockchain combining broadcast and consensus. In: Luo, B., Liao, X., Xu, J., Kirda, E., Lie, D. (eds.) CCS 2024, Salt Lake City, UT, USA, October 14-18, 2024. pp. 2606\u20132620. ACM (2024). https:\/\/doi.org\/10.1145\/3658644.3670286","DOI":"10.1145\/3658644.3670286"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Boneh, D., Eskandarian, S., Hanzlik, L., Greco, N.: Single secret leader election. In: AFT 2020, New York, NY, USA, October 21-23, 2020, pp. 12\u201324. ACM (2020). https:\/\/doi.org\/10.1145\/3419614.3423258","DOI":"10.1145\/3419614.3423258"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: SP 2018, May 21-23, 2018, San Francisco, California, USA, pp. 315\u2013334. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"9_CR9","unstructured":"Burdges, J., et al.: Overview of polkadot and its design considerations. CoRR abs\/2005.13456 (2020). https:\/\/arxiv.org\/abs\/2005.13456"},{"key":"9_CR10","unstructured":"Burdges, J., Ciobotaru, O., Alper, H.K., Stewart, A., Vasilyev, S.: Ring verifiable random functions and zero-knowledge continuations. IACR Cryptol. ePrint Arch. (2023). https:\/\/eprint.iacr.org\/2023\/002"},{"key":"9_CR11","unstructured":". Burdges, J., Crites, E., Alper, H.K., Stewart, A., Vasilyev, S.: Sassafras: efficient batch single leader election. IACR Cryptol. ePrint Arch. (2023) https:\/\/eprint.iacr.org\/2023\/031"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001, October 14-17, 2001, Las Vegas, Nevada, USA, pp. 136\u2013145. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Canetti, R., Hogan, K., Malhotra, A., Varia, M.: A universally composable treatment of network time. In: CSF 2017, Santa Barbara, CA, USA, August 21-25, 2017, pp. 360\u2013375. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/CSF.2017.38","DOI":"10.1109\/CSF.2017.38"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Canetti, R., Krawczyk, H.: Analysis of key-exchange protocols and their use for building secure channels. In: Pfitzmann, B. (ed.) EUROCRYPT 2001, Innsbruck, Austria, May 6-10, 2001. LNCS, vol.\u00a02045, pp. 453\u2013474. Springer (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_28","DOI":"10.1007\/3-540-44987-6_28"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Canetti, R., Krawczyk, H.: Universally composable notions of key exchange and secure channels. In: Knudsen, L.R. (ed.) EUROCRYPT 2002, Amsterdam, The Netherlands, April 28 - May 2, 2002. LNCS, vol.\u00a02332, pp. 337\u2013351. Springer (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_22","DOI":"10.1007\/3-540-46035-7_22"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Cascudo, I., David, B.: SCRAPE: scalable randomness attested by public entities. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017, Kanazawa, Japan, July 10-12, 2017. LNCS, vol. 10355, pp. 537\u2013556. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_27","DOI":"10.1007\/978-3-319-61204-1_27"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Catalano, D., Fiore, D., Giunta, E.: Adaptively secure single secret leader election from DDH. In: Milani, A., Woelfel, P. (eds.) PODC \u201922, Salerno, Italy, July 25 - 29, 2022 pp. 430\u2013439. ACM (2022). https:\/\/doi.org\/10.1145\/3519270.3538424","DOI":"10.1145\/3519270.3538424"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Catalano, D., Fiore, D., Giunta, E.: Efficient and universally composable single secret leader election from pairings. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023, Atlanta, GA, USA, May 7-10, 2023. LNCS, vol. 13940, pp. 471\u2013499. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_17","DOI":"10.1007\/978-3-031-31368-4_17"},{"key":"9_CR19","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. Theor. Comput. Sci. 777, 155\u2013183 (2019). https:\/\/doi.org\/10.1016\/J.TCS.2019.02.001","journal-title":"Theor. Comput. Sci."},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Daian, P., Pass, R., Shi, E.: Snow white: Robustly reconfigurable consensus and applications to provably secure proof of stake. In: Goldberg, I., Moore, T. (eds.) FC 2019, Frigate Bay, St. Kitts and Nevis, February 18-22, 2019. LNCS, vol. 11598, pp. 23\u201341. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_2","DOI":"10.1007\/978-3-030-32101-7_2"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"David, B., Gazi, P., Kiayias, A., Russell, A.: Ouroboros praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Tel Aviv, Israel, April 29 - May 3, 2018. LNCS, vol. 10821, pp. 66\u201398. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_3","DOI":"10.1007\/978-3-319-78375-8_3"},{"key":"9_CR22","unstructured":"Drake, J., Feist, D., Herold, G., Khovratovich, D., Maller, M., Simkin, M.: Whisk: a practical shuffle-based SSLE protocol for ethereum (2022). https:\/\/hackmd.io\/@asn-d6\/HyD3Yjp2Y"},{"key":"9_CR23","unstructured":"drand: Drand - a distributed randomness beacon daemon (2017). https:\/\/github.com\/drand\/drand"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Garay, J.A., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: Analysis and applications. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Sofia, Bulgaria, April 26-30, 2015. LNCS, vol.\u00a09057, pp. 281\u2013310. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10","DOI":"10.1007\/978-3-662-46803-6_10"},{"key":"9_CR25","unstructured":"Hanke, T., Movahedi, M., Williams, D.: DFINITY technology overview series, consensus system. CoRR abs\/1805.04548 (2018). http:\/\/arxiv.org\/abs\/1805.04548"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: Sahai, A. (ed.) TCC 2013, Tokyo, Japan, March 3-6, 2013. LNCS, vol.\u00a07785, pp. 477\u2013498. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_27","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Kiayias, A., Quader, S., Russell, A.: Consistency of proof-of-stake blockchains with concurrent honest slot leaders. In: ICDCS 2020, Singapore, November 29 - December 1, 2020 pp. 776\u2013786. IEEE Computer Society (2020). https:\/\/doi.org\/10.1109\/ICDCS47774.2020.00065","DOI":"10.1109\/ICDCS47774.2020.00065"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: a provably secure proof-of-stake blockchain protocol. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Santa Barbara, CA, USA, August 20-24, 2017. LNCS, vol. 10401, pp. 357\u2013388. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_12","DOI":"10.1007\/978-3-319-63688-7_12"},{"key":"9_CR29","doi-asserted-by":"publisher","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: FOCS 1999, October 17-18, 1999, New York, NY, USA, pp. 120\u2013130. IEEE Computer Society (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814584","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Pass, R., Shi, E.: The sleepy model of consensus. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Hong Kong, China, December 3-7, 2017. LNCS, vol. 10625, pp. 380\u2013409. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_14","DOI":"10.1007\/978-3-319-70697-9_14"},{"key":"9_CR31","doi-asserted-by":"publisher","unstructured":"Syta, E., et al.: Scalable bias-resistant distributed randomness. In: SP 2017, San Jose, CA, USA, May 22-26, 2017, pp. 444\u2013460. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/SP.2017.45","DOI":"10.1109\/SP.2017.45"},{"key":"9_CR32","unstructured":"Web3 Foundation: Ring vrf implementation (2022). https:\/\/github.com\/davxy\/ark-vrf"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95761-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T14:36:42Z","timestamp":1753454202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95761-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031957604","9783031957611"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95761-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2025.fordaysec.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}