Abstract

Traditional blockchains preserve everything, if verification is to avoid trusted third parties. The accumulation of outdated but undeletable data makes traditional blockchains non-scalable for practical applications. Stateless blockchains mitigate this problem via history deletion; however, existing stateless blockchains such as Mimblewimble are not quantum resistant as they rely on specific discrete-log-based cryptography to achieve history deletion. In this paper, we introduce the “Origami Store” (or O-store for short), as a general new approach to distributed data storage with a generic history deletion mechanism called “folding.” O-store is built using a hash function and an arbitrary signature scheme. Since the signature scheme is decoupled from the framework, O-stores are compatible with any quantum-resistant signature scheme by design. More importantly, O-store only needs to preserve one signature and one verification key per account (or owner) for any number of transactions (or updates), thereby mitigating the inefficiency of large quantum-safe signatures and verification keys. We prove the security of the basic O-store using the framework of Universal Composability (UC); in particular, O-store's universal security is shown to hold for a generic consensus mechanism, to facilitate implementation from a wide range of decentralized consensus protocols. The Origami store is thus the first UC-secure efficient distributed data storage framework that supports plug-and-play consensus mechanisms for fully decentralized trustless operation. We demonstrate working implementations of Origami stores with three post-quantum signature libraries-qTESLA, Dilithium, and Picnic-to illustrate its scalability and practicality for real-world applications.

Highlights

  • Blockchains are distributed protocols that create emergent trust from decentralized consensus, avoiding single points of failure and corruption issues typically associated with central authorities

  • Despite the efficiency improvement provided by such stateless blockchains, all existing approaches, either for cash systems [1]–[11] or data storage [12], remain built on cryptographic protocols that are vulnerable to quantum

  • We introduce a universally secure, entity-based, decentralized distributed store called ‘‘Origami Store’’—or O-store in shorthand—supporting data deletion and history folding

Read more

Summary

Introduction

Blockchains are distributed protocols that create emergent trust from decentralized consensus, avoiding single points of failure and corruption issues typically associated with central authorities. Traditional blockchains have proven impractical for data-intensive applications, for they do not support deletion of obsolete data like centralized storage systems do, and suffer from severely reduced scalability as a result of the potential catastrophic accumulation of outdated data. Stateless blockchains have been proposed to address this problem, and achieve higher scalability through entity history deletion. If one views each file in a decentralized file system as an entity, each update to the file would be effectuated as a transaction. While traditional blockchains would need to preserve all intermediate revisions of the file, stateless blockchains only need to preserve the latest for public verification, with possibly some minimal metadata for the prior revisions. We include tx and b, the number of transactions and verification blocks respectively, which would both leave some fixed-sized metadata on the blockchain. Despite the efficiency improvement provided by such stateless blockchains, all existing approaches, either for cash systems [1]–[11] or data storage [12], remain built on cryptographic protocols that are vulnerable to quantum

Objectives
Methods
Findings
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call