Deterministic random-walk leader election for blockchains

DOI10.1007/978-3-032-31130-6_18MaRDI QIDQ7411397zbMATH OpenFDO

Authors Durgesh Pandey, Kannan Srinathan

Publication date 2026

Full work available at URL https://doi.org/10.1007/978-3-032-31130-6_18

zbMATH Keywords

blockchain consensusBLS signaturesdynamic membershipleader electionrandom-walk relayROM/UC securitytranscript binding

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1304079 (Why is no real title available?)
• scientific article; zbMATH DE number 2009971 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• Leader election using random walks
• On the size of pairing-based non-interactive arguments
• SCRAPE: scalable randomness attested by public entities
• Simple verifiable delay functions
• The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
• Universally composable security: a new paradigm for cryptographic protocols
• Verifiable random functions

This page was built for publication: Deterministic random-walk leader election for blockchains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411397)