Proof-of-Stake Sidechains
Peter Gazi, Aggelos Kiayias, Dionysis Zindros
Abstract
Sidechains have long been heralded as the key enabler of blockchain scalability and interoperability. However, no modeling of the concept or a provably secure construction has so far been attempted. We provide the first formal definition of what a sidechain system is and how assets can be moved between sidechains securely. We put forth a security definition that augments the known transaction ledger properties of persistence and liveness to hold across multiple ledgers and enhance them with a new "firewall" security property which safeguards each blockchain from its sidechains, limiting the impact of an otherwise catastrophic sidechain failure. We then provide a sidechain construction that is suitable for proof-of-stake (PoS) sidechain systems. As an exemplary concrete instantiation we present our construction for an epoch-based PoS system consistent with Ouroboros (Crypto 2017), the PoS blockchain protocol used in Cardano which is one of the largest pure PoS systems by market capitalisation, and we also comment how the construction can be adapted for other protocols such as Ouroboros Praos (Eurocrypt 2018), Ouroboros Genesis (CCS 2018), Snow White and Algorand. An important feature of our construction is merged-staking that prevents "goldfinger" attacks against a sidechain that is only carrying a small amount of stake. An important technique for pegging chains that we use in our construction is cross-chain certification which is facilitated by a novel cryptographic primitive we introduce called ad-hoc threshold multisignatures (ATMS) which may be of independent interest. We show how ATMS can be securely instantiated by regular and aggregate digital signatures as well as succinct arguments of knowledge such as STARKs and bulletproofs with varying degrees of storage efficiency.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 146c7b29-08a3-41b7-9c48-978fdd94d9bbCited by top-tier papers12
- XCLAIM: Trustless, Interoperable, Cryptocurrency-Backed AssetsAlexei Zamyatin, Dominik Harz, Joshua Lind, Panayiotis Panayiotou et al.S&P 2019 · 222 citations
- HyperService: Interoperability and Programmability Across Heterogeneous BlockchainsZhuotao Liu, Yangxi Xiang, Jian Shi, Peng Gao et al.CCS 2019 · 128 citations
- SoK: Security and Privacy of Blockchain InteroperabilityAndré Augusto, Rafael Belchior, Miguel Correia, André Vasconcelos et al.S&P 2024 · 90 citations
- Blockchain CensorshipAnton Wahrstätter, Jens Ernstberger, Aviv Yaish, Liyi Zhou et al.WWW 2024 · 60 citations
- A Treasury System for Cryptocurrencies: Enabling Better Collaborative IntelligenceBingsheng Zhang, Roman Oliynykov, Hamed BalogunNDSS 2019 · 33 citations
Builds on4
- A Secure Sharding Protocol For Open BlockchainsLoi Luu, Viswesh Narayanan, Chaodong Zheng, Kunal Baweja et al.CCS 2016 · 1,392 citations
- Bulletproofs: Short Proofs for Confidential Transactions and MoreBenedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra et al.S&P 2018 · 1,285 citations
- OmniLedger: A Secure, Scale-Out, Decentralized Ledger via ShardingEleftherios Kokoris-Kogias, Philipp Jovanovic, Linus Gasser, Nicolas Gailly et al.S&P 2018 · 1,145 citations
- Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic AvailabilityChristian Badertscher, Peter Gazi, Aggelos Kiayias, Alexander Russell et al.CCS 2018 · 306 citations
Related papers
- On the Limits of Consensus under Dynamic Availability and ReconfigurationJavier Nieto, Joachim Neu, Ling RenCCS 2026 · 2 citations
- Ouroboros Crypsinous: Privacy-Preserving Proof-of-StakeThomas Kerber, Aggelos Kiayias, Markulf Kohlweiss, Vassilis ZikasS&P 2019 · 82 citations
- Everything is a Race and Nakamoto Always WinsAmir Dembo, Sreeram Kannan, Ertem Nusret Tas, David Tse et al.CCS 2020 · 3 citations
- The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake BlockchainsErica Blum, Aggelos Kiayias, Cristopher Moore, Saad Quader et al.SODA 2020 · 18 citations
- On the Anonymity Guarantees of Anonymous Proof-of-Stake ProtocolsMarkulf Kohlweiss, Varun Madathil, Kartik Nayak, Alessandra ScafuroS&P 2021 · 13 citations
