Abstract Web 3.0, as the third generation of the World Wide Web, aims to solve
contemporary problems of trust, centralization, and data ownership. Driven by the latest …

We present a near-optimal asynchronous verifiable information dispersal (AVID) protocol.
The total dispersal cost of our AVID protocol is O (| M|+ κ n^ 2), and the retrieval cost per …

The evolution of distributed systems necessitates robust protocols to facilitate secure and
efficient data storage and retrieval amid challenges like asynchronous communication and …

Sharding enhances blockchain scalability by dividing the network into shards, each
managing specific unspent transaction outputs or accounts. Cross-shard transactions pose a …

Fully asynchronous multi-party computation (AMPC) has superior robustness in realizing
privacy and guaranteed output delivery (GOD) against asynchronous adversaries that can …

Currently, integrating partially synchronous Byzantine-fault-tolerant protocols into
asynchronous protocols as fast lanes represents a trade-off between robustness and …

We introduce ZODA, short for'zero-overhead data availability,'which is a protocol for proving
that symbols received from an encoding (for tensor codes) were correctly constructed. ZODA …