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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

ASBK (named after the authors' initials) is a recent blockchain protocoltackling data availability attacks against light nodes, employingtwo-dimensional Reed-Solomon codes to encode the list of transactions and arandom sampling phase where adversaries are forced to reveal information. Inits original formulation, only codes with rate $1/4$ are considered, and atheoretical analysis requiring computationally demanding formulas is provided.This makes ASBK difficult to optimize in situations of practical interest. Inthis paper, we introduce a much simpler model for such a protocol, whichadditionally supports the use of codes with arbitrary rate. This makesblockchains implementing ASBK much easier to design and optimize. Furthermore,disposing of a clearer view of the protocol, some general features andconsiderations can be derived (e.g., nodes behaviour in largely participatednetworks). As a concrete application of our analysis, we consider relevantblockchain parameters and find network settings that minimize the amount ofdata downloaded by light nodes. Our results show that the protocol benefitsfrom the use of codes defined over large finite fields, with code rates thatmay be even significantly different from the originally proposed ones.

Optimization of a Reed-Solomon code-based protocol against blockchain data availability attacks