SNACKs: Leveraging Proofs of Sequential Work for Blockchain Light Clients
【Author】 Abusalah, Hamza; Fuchsbauer, Georg; Gazi, Peter; Klein, Karen
【Source】ADVANCES IN CRYPTOLOGY- ASIACRYPT 2022, PT I
【影响因子】
【Abstract】The success of blockchains has led to ever-growing ledgers that are stored by all participating full nodes. In contrast, light clients only store small amounts of blockchain-related data and rely on the mediation of full nodes when interacting with the ledger. A broader adoption of blockchains calls for protocols that make this interaction trustless. We revisit the design of light-client blockchain protocols from the perspective of classical proof-system theory, and explain the role that proofs of sequential work (PoSWs) can play in it. To this end, we define a new primitive called succinct non-interactive argument of chain knowledge (SNACK), a non-interactive proof system that provides clear security guarantees to a verifier (a light client) even when interacting only with a single dishonest prover (a full node). We show how augmenting any blockchain with any graph-labeling PoSW (GL-PoSW) enables SNACK proofs for this blockchain. We also provide a unified and extended definition of GL-PoSWs covering all existing constructions, and describe two new variants. We then show how SNACKs can be used to construct light-client protocols, and highlight some deficiencies of existing designs, along with mitigations. Finally, we introduce incremental SNACKs which could potentially provide a new approach to light mining.
【Keywords】Blockchains; Light clients; Proofs of sequential work
【发表时间】2022
【收录时间】2023-05-04
【文献类型】理论模型
【主题类别】
区块链技术-核心技术-共识机制
评论