Sequencer Level Security
- URL: http://arxiv.org/abs/2405.01819v1
- Date: Fri, 3 May 2024 02:47:40 GMT
- Title: Sequencer Level Security
- Authors: Martin Derka, Jan Gorzny, Diego Siqueira, Donato Pellegrino, Marius Guggenmos, Zhiyang Chen,
- Abstract summary: We introduce the Sequencer Level Security (SLS) protocol, an enhancement to sequencing protocols of rollups.
We describe the mechanics of the protocol for both the transactions submitted to the rollup mempool, as well as transactions originating from Layer one.
We implement a prototype of the SLS protocol, Zircuit, which is built on top of Geth and the OP stack.
- Score: 2.756899615600916
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Current blockchains do not provide any security guarantees to the smart contracts and their users as far as the content of the transactions is concerned. In the spirit of decentralization and censorship resistance, they follow the paradigm of including valid transactions in blocks without any further scrutiny. Rollups are a special kind of blockchains whose primary purpose is to scale the transaction throughput. Many of the existing rollups operate through a centrally operated sequencing protocol. In this paper, we introduce the Sequencer Level Security (SLS) protocol, an enhancement to sequencing protocols of rollups. This pioneering contribution explores the concept of the sequencer's capability to identify and temporarily quarantine malicious transactions instead of including them in blocks immediately. We describe the mechanics of the protocol for both the transactions submitted to the rollup mempool, as well as transactions originating from Layer one. We comment on topics such as trust and decentralization, and consider the security impact on the protocol itself. We implement a prototype of the SLS protocol, Zircuit, which is built on top of Geth and the OP stack. The SLS protocol described can be easily generalized to other rollup designs, and can be used for purposes other than security.
Related papers
- 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) - Flashback: Enhancing Proposer-Builder Design with Future-Block Auctions in Proof-of-Stake Ethereum [27.386337024680245]
Auction mechanisms used between searchers, builders and proposers are crucial to the overall health of the blockchain.
In this paper, we consider PBS design in as a game between searchers, builders and proposers.
A key novelty in our design is the inclusion of future block proposers, as all proposers of an epoch are decided ahead of time in proof-of-stake (PoS)
Our analysis shows the existence of alternative auction mechanisms that result in a better equilibrium to players compared to state-of-the-art.
arXiv Detail & Related papers (2024-05-15T15:58:21Z) - Multichain Taprootized Atomic Swaps: Introducing Untraceability through Zero-Knowledge Proofs [14.379311972506791]
Taprootized Atomic Swaps is an extension for Atomic Swaps that enables the untraceability of transactions in a particular swap.
Based on Schnorr signatures, Taproot technology, and zero-knowledge proofs, the taprootized atomic swaps hide swap transactions between regular payments.
arXiv Detail & Related papers (2024-02-26T16:57:29Z) - Transaction Capacity, Security and Latency in Blockchains [35.16231062731263]
We analyze how secure a block is after the block becomes k-deep, i.e., security-latency, for Nakamoto consensus.
We compare our results for Nakamoto consensus under bounded network delay models and obtain analogous bounds for safety violation threshold.
arXiv Detail & Related papers (2024-02-15T17:43:13Z) - Proof of Diligence: Cryptoeconomic Security for Rollups [19.10751432868712]
We introduce an incentivized watchtower network designed to serve as the first line of defense for rollups.
Our main contribution is a Proof of Diligence'' protocol that requires watchtowers to continuously provide a proof that they have verified L2 assertions.
arXiv Detail & Related papers (2024-02-11T16:40:33Z) - A Survey and Comparative Analysis of Security Properties of CAN Authentication Protocols [92.81385447582882]
The Controller Area Network (CAN) bus leaves in-vehicle communications inherently non-secure.
This paper reviews and compares the 15 most prominent authentication protocols for the CAN bus.
We evaluate protocols based on essential operational criteria that contribute to ease of implementation.
arXiv Detail & Related papers (2024-01-19T14:52:04Z) - A Two-Layer Blockchain Sharding Protocol Leveraging Safety and Liveness for Enhanced Performance [5.344231997803284]
Existing protocols overlook diverse adversarial attacks, limiting transaction throughput.
This paper presents Reticulum, a groundbreaking sharding protocol addressing this issue.
It comprises "control" and "process" shards in two layers.
arXiv Detail & Related papers (2023-10-17T16:15:28Z) - Securing Blockchain Systems: A Novel Collaborative Learning Framework to Detect Attacks in Transactions and Smart Contracts [26.85360925398753]
This paper presents a novel collaborative learning framework designed to detect attacks in blockchain transactions and smart contracts.
Our framework exhibits the capability to classify various types of blockchain attacks, including intricate attacks at the machine code level.
Our framework achieves a detection accuracy of approximately 94% through extensive simulations and real-time experiments with a throughput of over 2,150 transactions per second.
arXiv Detail & Related papers (2023-08-30T07:17:20Z) - Masquerade: Simple and Lightweight Transaction Reordering Mitigation in Blockchains [5.690884793952696]
We propose an MEV aware protocol design called Masquerade to increase user satisfaction and confidence in the system.
We introduce the notion of a "token" to mitigate the actions taken by an adversary in an attack scenario.
arXiv Detail & Related papers (2023-08-29T14:42:43Z) - Resilient Consensus Sustained Collaboratively [6.090550359575682]
We present the design of our Power-of-Collaboration protocol, which guards existing PoS/BFT blockchains against long-range attacks.
PoC guarantees fairness and accountability and only marginally degrades the throughput of the underlying system.
arXiv Detail & Related papers (2023-02-05T07:33:57Z) - 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.