Cryptology ePrint Archive: Report 2021/1544

Information Dispersal with Provable Retrievability for Rollups

Kamilla Nazirkhanova and Joachim Neu and David Tse

Abstract: The ability to verifiably retrieve transaction or state data stored off-chain is crucial to blockchain scaling techniques such as rollups or sharding. We formalize the problem and design a storage- and communication-efficient protocol using linear erasure-correcting codes and homomorphic vector commitments. Motivated by application requirements for rollups, our solution departs from earlier Verifiable Information Dispersal schemes in that we do not require comprehensive termination properties or retrievability from any but only from some known sufficiently large set of storage nodes. Compared to Data Availability Oracles, under no circumstance do we fall back to returning empty blocks. Distributing a file of 28.8 MB among 900 storage nodes (up to 300 of which may be adversarial) requires in total approx. 95 MB of communication and storage and approx. 30 seconds of cryptographic computation on a single-threaded consumer-grade laptop computer. Our solution requires no modification to on-chain contracts of Validium rollups such as StarkWare's StarkEx. Additionally, it provides privacy of the dispersed data against honest-but-curious storage nodes.

Category / Keywords: cryptographic protocols / blockchain, consensus, rollup

Date: received 24 Nov 2021

Contact author: nazirk at stanford edu, jneu at stanford edu, dntse at stanford edu

Available format(s): PDF | BibTeX Citation

Version: 20211129:121419 (All versions of this report)

Short URL: ia.cr/2021/1544


[ Cryptology ePrint archive ]