English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Single Secret Leader Elections have recently been proposed as an improvedleader election mechanism for proof-of-stake (PoS) blockchains. However, thesecurity gain they provide has not been quantified. In this work, we present acomparison of PoS longest-chain protocols that are based on Single SecretLeader Elections (SSLE) - that elect exactly one leader per round - versusthose based on Probabilistic Leader Elections (PLE) - where one leader iselected on expectation. Our analysis shows that when considering the privateattack - the worst attack on longest-chain protocols - the security gained fromusing SSLE is substantial: the settlement time is decreased by roughly 25% fora 33% or 25% adversary. Furthermore, when considering grinding attacks, we findthat the security threshold is increased by 10% (from 0.26 in the PLE case to0.36 inthe SSLE case) and the settlement time is decreased by roughly 70% for a20% adversary in the SSLE case.

Private Attacks in Longest Chain Proof-of-stake Protocols with Single Secret Leader Elections