{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T22:54:20Z","timestamp":1770332060658,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,10]]},"DOI":"10.1145\/3579856.3595792","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T14:52:13Z","timestamp":1688568733000},"page":"623-637","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["A New Look at Blockchain Leader Election: Simple, Efficient, Sustainable and Post-Quantum"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1650-3748","authenticated-orcid":false,"given":"Muhammed F.","family":"Esgin","sequence":"first","affiliation":[{"name":"Monash University, Australia and CSIRO's Data61, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6428-4212","authenticated-orcid":false,"given":"Oguzhan","family":"Ersoy","sequence":"additional","affiliation":[{"name":"Radboud University, Netherlands and Delft University of Technology, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7724-2601","authenticated-orcid":false,"given":"Veronika","family":"Kuchta","sequence":"additional","affiliation":[{"name":"Florida Atlantic University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7979-3810","authenticated-orcid":false,"given":"Julian","family":"Loss","sequence":"additional","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4569-3384","authenticated-orcid":false,"given":"Amin","family":"Sakzad","sequence":"additional","affiliation":[{"name":"Monash University, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1745-4183","authenticated-orcid":false,"given":"Ron","family":"Steinfeld","sequence":"additional","affiliation":[{"name":"Monash University, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4529-5776","authenticated-orcid":false,"given":"Xiangwen","family":"Yang","sequence":"additional","affiliation":[{"name":"Monash University, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1257-9147","authenticated-orcid":false,"given":"Raymond K.","family":"Zhao","sequence":"additional","affiliation":[{"name":"CSIRO's Data61, Australia"}]}],"member":"320","published-online":{"date-parts":[[2023,7,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2018. Chia Documentation. Available at https:\/\/docs.chia.net\/docs\/03consensus\/consensus_intro.  2018. Chia Documentation. Available at https:\/\/docs.chia.net\/docs\/03consensus\/consensus_intro."},{"key":"e_1_3_2_1_3_1","unstructured":"2020. What sets it apart: Filecoin\u2019s proof system. Available at https:\/\/spec.filecoin.io\/algorithms\/expected_consensus\/.  2020. What sets it apart: Filecoin\u2019s proof system. Available at https:\/\/spec.filecoin.io\/algorithms\/expected_consensus\/."},{"key":"e_1_3_2_1_4_1","unstructured":"2022. RangersProtocol Whitepaper. Available at https:\/\/www.rangersprotocol.com\/pdf\/RangersProtocolWhitepaper.pdf.  2022. RangersProtocol Whitepaper. Available at https:\/\/www.rangersprotocol.com\/pdf\/RangersProtocolWhitepaper.pdf."},{"key":"e_1_3_2_1_5_1","volume-title":"EUROCRYPT (1)(LNCS, Vol.\u00a09056)","author":"Albrecht R.","unstructured":"Martin\u00a0 R. Albrecht , Christian Rechberger , Thomas Schneider , Tyge Tiessen , and Michael Zohner . 2015. Ciphers for MPC and FHE . In EUROCRYPT (1)(LNCS, Vol.\u00a09056) . Springer , 430\u2013454. Martin\u00a0R. Albrecht, Christian Rechberger, Thomas Schneider, Tyge Tiessen, and Michael Zohner. 2015. Ciphers for MPC and FHE. In EUROCRYPT (1)(LNCS, Vol.\u00a09056). Springer, 430\u2013454."},{"key":"e_1_3_2_1_6_1","volume-title":"CRYPTO(LNCS, Vol.\u00a01666)","author":"Bellare Mihir","unstructured":"Mihir Bellare and Sara\u00a0 K. Miner . 1999. A Forward-Secure Digital Signature Scheme . In CRYPTO(LNCS, Vol.\u00a01666) . Springer , 431\u2013448. Mihir Bellare and Sara\u00a0K. Miner. 1999. A Forward-Secure Digital Signature Scheme. In CRYPTO(LNCS, Vol.\u00a01666). Springer, 431\u2013448."},{"key":"e_1_3_2_1_7_1","volume-title":"EUROCRYPT(LNCS, Vol.\u00a03027)","author":"Bellare Mihir","unstructured":"Mihir Bellare , Chanathip Namprempre , and Gregory Neven . 2004. Security Proofs for Identity-Based Identification and Signature Schemes . In EUROCRYPT(LNCS, Vol.\u00a03027) . Springer , 268\u2013286. Mihir Bellare, Chanathip Namprempre, and Gregory Neven. 2004. Security Proofs for Identity-Based Identification and Signature Schemes. In EUROCRYPT(LNCS, Vol.\u00a03027). Springer, 268\u2013286."},{"key":"e_1_3_2_1_8_1","volume-title":"Public Key Cryptography(LNCS, Vol.\u00a03958)","author":"Bernstein J.","unstructured":"Daniel\u00a0 J. Bernstein . 2006. Curve25519: New Diffie-Hellman Speed Records . In Public Key Cryptography(LNCS, Vol.\u00a03958) . Springer , 207\u2013228. Daniel\u00a0J. Bernstein. 2006. Curve25519: New Diffie-Hellman Speed Records. In Public Key Cryptography(LNCS, Vol.\u00a03958). Springer, 207\u2013228."},{"key":"e_1_3_2_1_9_1","unstructured":"Daniel\u00a0J. Bernstein. 2008. ChaCha a variant of Salsa20. https:\/\/cr.yp.to\/chacha\/chacha-20080128.pdf.  Daniel\u00a0J. Bernstein. 2008. ChaCha a variant of Salsa20. https:\/\/cr.yp.to\/chacha\/chacha-20080128.pdf."},{"key":"e_1_3_2_1_10_1","volume-title":"CHES(LNCS, Vol.\u00a06917)","author":"Bernstein J.","unstructured":"Daniel\u00a0 J. Bernstein , Niels Duif , Tanja Lange , Peter Schwabe , and Bo-Yin Yang . 2011. High-Speed High-Security Signatures . In CHES(LNCS, Vol.\u00a06917) . Springer , 124\u2013142. Daniel\u00a0J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, and Bo-Yin Yang. 2011. High-Speed High-Security Signatures. In CHES(LNCS, Vol.\u00a06917). Springer, 124\u2013142."},{"key":"e_1_3_2_1_11_1","volume-title":"PQCrypto(LNCS, Vol.\u00a07071)","author":"Buchmann Johannes","unstructured":"Johannes Buchmann , Erik Dahmen , and Andreas H\u00fclsing . 2011. XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions . In PQCrypto(LNCS, Vol.\u00a07071) . Springer , 117\u2013129. Johannes Buchmann, Erik Dahmen, and Andreas H\u00fclsing. 2011. XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions. In PQCrypto(LNCS, Vol.\u00a07071). Springer, 117\u2013129."},{"key":"e_1_3_2_1_12_1","volume-title":"PQCrypto(LNCS, Vol.\u00a05299)","author":"Buchmann Johannes","unstructured":"Johannes Buchmann , Erik Dahmen , and Michael Schneider . 2008. Merkle Tree Traversal Revisited . In PQCrypto(LNCS, Vol.\u00a05299) . Springer , 63\u201378. Johannes Buchmann, Erik Dahmen, and Michael Schneider. 2008. Merkle Tree Traversal Revisited. In PQCrypto(LNCS, Vol.\u00a05299). Springer, 63\u201378."},{"key":"e_1_3_2_1_13_1","volume-title":"ESORICS(LNCS, Vol.\u00a013554)","author":"Buser Maxime","unstructured":"Maxime Buser , Rafael Dowsley , Muhammed\u00a0 F. Esgin , Shabnam\u00a0Kasra Kermanshahi , Veronika Kuchta , Joseph\u00a0 K. Liu , Raphael Phan , and Zhenfei Zhang . 2022. Post-Quantum Verifiable Random Function from Symmetric Primitives in PoS Blockchain . In ESORICS(LNCS, Vol.\u00a013554) . Springer , 25\u201345. Maxime Buser, Rafael Dowsley, Muhammed\u00a0F. Esgin, Shabnam\u00a0Kasra Kermanshahi, Veronika Kuchta, Joseph\u00a0K. Liu, Raphael Phan, and Zhenfei Zhang. 2022. Post-Quantum Verifiable Random Function from Symmetric Primitives in PoS Blockchain. In ESORICS(LNCS, Vol.\u00a013554). Springer, 25\u201345."},{"key":"e_1_3_2_1_14_1","volume-title":"ALGORAND AGREEMENT: Super Fast and Partition Resilient Byzantine Agreement. IACR Cryptol. ePrint Arch.","author":"Chen Jing","year":"2018","unstructured":"Jing Chen , Sergey Gorbunov , Silvio Micali , and Georgios Vlachos . 2018 . ALGORAND AGREEMENT: Super Fast and Partition Resilient Byzantine Agreement. IACR Cryptol. ePrint Arch. (2018), 377. Jing Chen, Sergey Gorbunov, Silvio Micali, and Georgios Vlachos. 2018. ALGORAND AGREEMENT: Super Fast and Partition Resilient Byzantine Agreement. IACR Cryptol. ePrint Arch. (2018), 377."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.02.001"},{"key":"e_1_3_2_1_16_1","volume-title":"Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. In EUROCRYPT (2)(LNCS, Vol.\u00a010821)","author":"David Bernardo","year":"2018","unstructured":"Bernardo David , Peter Gazi , Aggelos Kiayias , and Alexander Russell . 2018 . Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. In EUROCRYPT (2)(LNCS, Vol.\u00a010821) . Springer , 66\u201398. Bernardo David, Peter Gazi, Aggelos Kiayias, and Alexander Russell. 2018. Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. In EUROCRYPT (2)(LNCS, Vol.\u00a010821). Springer, 66\u201398."},{"key":"e_1_3_2_1_17_1","volume-title":"Financial Cryptography (2)(LNCS, Vol.\u00a012675)","author":"Esgin F.","unstructured":"Muhammed\u00a0 F. Esgin , Veronika Kuchta , Amin Sakzad , Ron Steinfeld , Zhenfei Zhang , Shifeng Sun , and Shumo Chu . 2021. Practical Post-quantum Few-Time Verifiable Random Function with Applications to Algorand . In Financial Cryptography (2)(LNCS, Vol.\u00a012675) . Springer , 560\u2013578. Muhammed\u00a0F. Esgin, Veronika Kuchta, Amin Sakzad, Ron Steinfeld, Zhenfei Zhang, Shifeng Sun, and Shumo Chu. 2021. Practical Post-quantum Few-Time Verifiable Random Function with Applications to Algorand. In Financial Cryptography (2)(LNCS, Vol.\u00a012675). Springer, 560\u2013578."},{"key":"e_1_3_2_1_19_1","unstructured":"Algorand Foundation. 2022. Algorand Key Specification. Available at: https:\/\/github.com\/algorandfoundation\/specs\/blob\/master\/dev\/partkey.md.  Algorand Foundation. 2022. Algorand Key Specification. Available at: https:\/\/github.com\/algorandfoundation\/specs\/blob\/master\/dev\/partkey.md."},{"key":"e_1_3_2_1_20_1","volume-title":"Falcon: Fast-Fourier lattice-based compact signatures over NTRU. Submission to the NIST\u2019s PQC standardization process 36, 5","author":"Fouque Pierre-Alain","year":"2018","unstructured":"Pierre-Alain Fouque , Jeffrey Hoffstein , Paul Kirchner , Vadim Lyubashevsky , Thomas Pornin , Thomas Prest , Thomas Ricosset , Gregor Seiler , William Whyte , and Zhenfei Zhang . 2018 . Falcon: Fast-Fourier lattice-based compact signatures over NTRU. Submission to the NIST\u2019s PQC standardization process 36, 5 (2018). Pierre-Alain Fouque, Jeffrey Hoffstein, Paul Kirchner, Vadim Lyubashevsky, Thomas Pornin, Thomas Prest, Thomas Ricosset, Gregor Seiler, William Whyte, and Zhenfei Zhang. 2018. Falcon: Fast-Fourier lattice-based compact signatures over NTRU. Submission to the NIST\u2019s PQC standardization process 36, 5 (2018)."},{"key":"e_1_3_2_1_21_1","volume-title":"Algorand: Scaling Byzantine Agreements for Cryptocurrencies. In Symposium on Operating Systems Principles (SOSP). ACM, 51\u201368","author":"Gilad Yossi","year":"2017","unstructured":"Yossi Gilad , Rotem Hemo , Silvio Micali , Georgios Vlachos , and Nickolai Zeldovich . 2017 . Algorand: Scaling Byzantine Agreements for Cryptocurrencies. In Symposium on Operating Systems Principles (SOSP). ACM, 51\u201368 . Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, and Nickolai Zeldovich. 2017. Algorand: Scaling Byzantine Agreements for Cryptocurrencies. In Symposium on Operating Systems Principles (SOSP). ACM, 51\u201368."},{"key":"e_1_3_2_1_22_1","unstructured":"Yossi Gilad David Lazar and Chris Peikert. 2021. Subset-Sum Hash Specification. Available at: https:\/\/github.com\/algorandfoundation\/specs\/blob\/master\/dev\/cryptographic-specs\/sumhash-spec.pdf.  Yossi Gilad David Lazar and Chris Peikert. 2021. Subset-Sum Hash Specification. Available at: https:\/\/github.com\/algorandfoundation\/specs\/blob\/master\/dev\/cryptographic-specs\/sumhash-spec.pdf."},{"key":"e_1_3_2_1_23_1","unstructured":"Sergey Gorbunov. 2018. Algorand Releases First Open-Source Code: Verifiable Random Function. Available at https:\/\/medium.com\/algorand\/algorand-releases-first-open-source-code-of-verifiable-random-function-93c2960abd61.  Sergey Gorbunov. 2018. Algorand Releases First Open-Source Code: Verifiable Random Function. Available at https:\/\/medium.com\/algorand\/algorand-releases-first-open-source-code-of-verifiable-random-function-93c2960abd61."},{"key":"e_1_3_2_1_24_1","volume-title":"FSE(LNCS, Vol.\u00a05665)","author":"Gueron Shay","unstructured":"Shay Gueron . 2009. Intel\u2019s New AES Instructions for Enhanced Performance and Security . In FSE(LNCS, Vol.\u00a05665) . Springer , 51\u201366. Shay Gueron. 2009. Intel\u2019s New AES Instructions for Enhanced Performance and Security. In FSE(LNCS, Vol.\u00a05665). Springer, 51\u201366."},{"key":"e_1_3_2_1_25_1","volume-title":"Consensus System. CoRR abs\/1805.04548","author":"Hanke Timo","year":"2018","unstructured":"Timo Hanke , Mahnush Movahedi , and Dominic Williams . 2018. DFINITY Technology Overview Series , Consensus System. CoRR abs\/1805.04548 ( 2018 ). arXiv:1805.04548http:\/\/arxiv.org\/abs\/1805.04548 Timo Hanke, Mahnush Movahedi, and Dominic Williams. 2018. DFINITY Technology Overview Series, Consensus System. CoRR abs\/1805.04548 (2018). arXiv:1805.04548http:\/\/arxiv.org\/abs\/1805.04548"},{"key":"e_1_3_2_1_26_1","first-page":"1","article-title":"Edwards-Curve Digital Signature Algorithm (EdDSA)","volume":"8032","author":"Josefsson Simon","year":"2017","unstructured":"Simon Josefsson and Ilari Liusvaara . 2017 . Edwards-Curve Digital Signature Algorithm (EdDSA) . RFC 8032 (2017), 1 \u2013 60 . Simon Josefsson and Ilari Liusvaara. 2017. Edwards-Curve Digital Signature Algorithm (EdDSA). RFC 8032 (2017), 1\u201360.","journal-title":"RFC"},{"key":"e_1_3_2_1_27_1","volume-title":"EUROCRYPT(LNCS, Vol.\u00a02332)","author":"Malkin Tal","unstructured":"Tal Malkin , Daniele Micciancio , and Sara\u00a0 K. Miner . 2002. Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods . In EUROCRYPT(LNCS, Vol.\u00a02332) . Springer , 400\u2013417. Tal Malkin, Daniele Micciancio, and Sara\u00a0K. Miner. 2002. Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods. In EUROCRYPT(LNCS, Vol.\u00a02332). Springer, 400\u2013417."},{"key":"e_1_3_2_1_28_1","volume-title":"Verifiable Random Functions","author":"Micali Silvio","unstructured":"Silvio Micali , Michael\u00a0 O. Rabin , and Salil\u00a0 P. Vadhan . 1999. Verifiable Random Functions . In FOCS. IEEE Computer Society , 120\u2013130. Silvio Micali, Michael\u00a0O. Rabin, and Salil\u00a0P. Vadhan. 1999. Verifiable Random Functions. In FOCS. IEEE Computer Society, 120\u2013130."},{"key":"#cr-split#-e_1_3_2_1_29_1.1","doi-asserted-by":"crossref","unstructured":"NIST. 2015. Recommendation for Random Number Generation Using Deterministic Random Bit Generators. https:\/\/doi.org\/10.6028\/NIST.SP.800-90Ar1. 10.6028\/NIST.SP.800-90Ar1","DOI":"10.6028\/NIST.SP.800-90Ar1"},{"key":"#cr-split#-e_1_3_2_1_29_1.2","doi-asserted-by":"crossref","unstructured":"NIST. 2015. Recommendation for Random Number Generation Using Deterministic Random Bit Generators. https:\/\/doi.org\/10.6028\/NIST.SP.800-90Ar1.","DOI":"10.6028\/NIST.SP.800-90Ar1"},{"key":"e_1_3_2_1_31_1","volume-title":"Second-Preimage Resistance, and Collision Resistance. In FSE(LNCS, Vol.\u00a03017)","author":"Rogaway Phillip","unstructured":"Phillip Rogaway and Thomas Shrimpton . 2004. Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance , Second-Preimage Resistance, and Collision Resistance. In FSE(LNCS, Vol.\u00a03017) . Springer , 371\u2013388. Phillip Rogaway and Thomas Shrimpton. 2004. Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance. In FSE(LNCS, Vol.\u00a03017). Springer, 371\u2013388."},{"key":"e_1_3_2_1_32_1","unstructured":"Raymond\u00a0K. Zhao Sarah McCarthy Ron Steinfeld Amin Sakzad and M\u00e1ire O\u2019Neill. 2021. Quantum-safe HIBE: does it cost a Latte?Cryptology ePrint Archive Paper 2021\/222. https:\/\/eprint.iacr.org\/2021\/222.  Raymond\u00a0K. Zhao Sarah McCarthy Ron Steinfeld Amin Sakzad and M\u00e1ire O\u2019Neill. 2021. Quantum-safe HIBE: does it cost a Latte?Cryptology ePrint Archive Paper 2021\/222. https:\/\/eprint.iacr.org\/2021\/222."}],"event":{"name":"ASIA CCS '23: ACM ASIA Conference on Computer and Communications Security","location":"Melbourne VIC Australia","acronym":"ASIA CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3595792","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:17Z","timestamp":1750183697000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3595792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,10]]},"references-count":30,"alternative-id":["10.1145\/3579856.3595792","10.1145\/3579856"],"URL":"https:\/\/doi.org\/10.1145\/3579856.3595792","relation":{},"subject":[],"published":{"date-parts":[[2023,7,10]]},"assertion":[{"value":"2023-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}