Aegis: Tethering a Blockchain with Primary-Chain Stake

• URL: http://arxiv.org/abs/2406.05904v3
• Date: Thu, 24 Apr 2025 09:56:57 GMT
• Title: Aegis: Tethering a Blockchain with Primary-Chain Stake
• Authors: Yogev Bar-On, Roi Bar-Zur, Omer Ben-Porat, Nimrod Cohen, Ittay Eyal, Matan Sitbon,
• Abstract summary: We present a tethered-chain protocol called Aegis.<n>Aegis uses references from its blocks to primary blocks to define committees, checkpoints on the primary chain to perpetuate decisions, and resets to establish new committees when previous ones become obsolete.
• Score: 9.499962065972483
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Blockchains implement decentralized monetary systems and applications. Recent advancements enable what we call tethering a blockchain to a primary blockchain, securing the tethered chain by nodes that post primary-chain tokens as collateral. The collateral ensures nodes behave as intended, until they withdraw it. Unlike a Proof of Stake blockchain which uses its own token as collateral, using primary-chain tokens shields the tethered chain from the volatility of its own token. State-of-the-art tethered blockchains either rely on centralization, or make extreme assumptions: that all communication is synchronous, that operators remain correct even post-withdrawal, or that withdrawals can be indefinitely delayed by tethered-chain failures. We prove that with partial synchrony, there is no solution to the problem. However, under the standard assumptions that communication with the primary chain is synchronous and communication among the tethered chain nodes is partially synchronous, there is a solution. We present a tethered-chain protocol called Aegis. Aegis uses references from its blocks to primary blocks to define committees, checkpoints on the primary chain to perpetuate decisions, and resets to establish new committees when previous ones become obsolete. It ensures safety at all times and rapid progress when latency among Aegis nodes is low.

Related papers

• Zaptos: Towards Optimal Blockchain Latency [52.30047458198369]
  We introduce Zaptos, a parallel pipelined architecture designed to minimize end-to-end latency. Zaptos achieves a throughput of 20,000 transactions per second with sub-second latency.
  arXiv  Detail & Related papers  (2025-01-18T00:22:22Z)
• Towards the Blockchain Massive Adoption with Permissionless Storage [0.0]
  In my thesis, new approaches are applied to solve the issues above. The key contribution is the discovery of the useful PoW. Based on this theory, a permissionless storage network is proposed as the new security engine for the blockchain.
  arXiv  Detail & Related papers  (2024-07-25T04:28:52Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols. Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol. We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Nurgle: Exacerbating Resource Consumption in Blockchain State Storage via MPT Manipulation [27.384225875585805]
  We unveil a novel attack surface, i.e., the state storage, in blockchains. Nurgle is the first Denial-of-Service attack targeting the state storage. Nurgle forces blockchains to expend additional resources on state maintenance and verification, impairing their performance.
  arXiv  Detail & Related papers  (2024-06-15T16:47:39Z)
• Cross-Blockchain Communication Using Oracles With an Off-Chain Aggregation Mechanism Based on zk-SNARKs [0.716879432974126]
  We propose an oracle with an off-chain aggregation mechanism based on ZeroKnowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARKs) to facilitate cross-blockchain communication. The proposed solution only requires constant 378 kgas to submit data on the blockchain and is primarily independent of the underlying technology of the queried blockchains.
  arXiv  Detail & Related papers  (2024-05-14T07:48:19Z)
• Enhancing Trust and Privacy in Distributed Networks: A Comprehensive Survey on Blockchain-based Federated Learning [51.13534069758711]
  Decentralized approaches like blockchain offer a compelling solution by implementing a consensus mechanism among multiple entities. Federated Learning (FL) enables participants to collaboratively train models while safeguarding data privacy. This paper investigates the synergy between blockchain's security features and FL's privacy-preserving model training capabilities.
  arXiv  Detail & Related papers  (2024-03-28T07:08:26Z)
• A Circuit Approach to Constructing Blockchains on Blockchains [21.354762805616875]
  We show how to build a more secure overlay blockchain by reading from and writing to a given set of blockchains. Under the partially synchronous setting, we have the following results: 1) the serial composition, between two blockchains, yields an overlay blockchain that is safe if at least one of the two underlay blockchains is safe and that is live if both of them are live. The results are also extended to the synchronous setting.
  arXiv  Detail & Related papers  (2024-01-31T22:49:35Z)
• Generative AI-enabled Blockchain Networks: Fundamentals, Applications, and Case Study [73.87110604150315]
  Generative Artificial Intelligence (GAI) has emerged as a promising solution to address challenges of blockchain technology. In this paper, we first introduce GAI techniques, outline their applications, and discuss existing solutions for integrating GAI into blockchains.
  arXiv  Detail & Related papers  (2024-01-28T10:46:17Z)
• SoK: Security of Cross-chain Bridges: Attack Surfaces, Defenses, and Open Problems [43.80265187232706]
  Cross-chain bridges are used to facilitate token and data exchanges across blockchains. Although bridges are becoming increasingly popular, they are still in their infancy and have been attacked multiple times recently. This paper analyzes the security landscape of cross-chain bridges in a holistic manner.
  arXiv  Detail & Related papers  (2023-12-19T20:13:21Z)
• FoodFresh: Multi-Chain Design for an Inter-Institutional Food Supply Chain Network [0.0]
  FoodFresh is a multi-chain consortium where organizations store immutable data on their blockchains. A decentralized hub coordinates the cross-chain exchange of digital assets among the heterogeneous blockchains.
  arXiv  Detail & Related papers  (2023-10-30T11:38:05Z)
• ADESS: A Proof-of-Work Protocol to Deter Double-Spend Attacks [0.0]
  A principal vulnerability of a proof-of-work ("PoW") blockchain is that an attacker can re-write the history of transactions. We propose a modification to PoW protocols, called ADESS, that contains two novel features.
  arXiv  Detail & Related papers  (2023-09-25T21:50:23Z)
• Quantum-resistance in blockchain networks [46.63333997460008]
  This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
  arXiv  Detail & Related papers  (2021-06-11T23:39:25Z)
• Selective Deletion in a Blockchain [0.0]
  We present the first concept for the selective deletion of single entries in a blockchain. The general consensus algorithm is extended by the functionality of regularly creating summary blocks. With a shifting marker of the Genesis Block, data can be deleted from the beginning of a blockchain.
  arXiv  Detail & Related papers  (2021-01-14T08:06:37Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.