34 citations · 85 across the 18 of their papers we have counts for
19 papers
Consensus Under Adversary Majority Done Right
Srivatsan Sridhar, Ertem Nusret Tas, Joachim Neu +2
A specter is haunting consensus protocols--the specter of adversary majority. Dolev and Strong in 1983 showed an early possibility for up to 99% adversaries. Yet, other works show…
Short Paper: Accountable Safety Implies Finality
Joachim Neu, Ertem Nusret Tas, David Tse
Motivated by proof-of-stake (PoS) blockchains such as Ethereum, two key desiderata have recently been studied for Byzantine-fault tolerant (BFT) state-machine replication (SMR) con…
Optimal Flexible Consensus and its Application to Ethereum
Joachim Neu, Srivatsan Sridhar, Lei Yang +1
Classic BFT consensus protocols guarantee safety and liveness for all clients if fewer than one-third of replicas are faulty. However, in applications such as high-value payments,…
Nakamoto Consensus under Bounded Processing Capacity
Lucianna Kiffer, Joachim Neu, Srivatsan Sridhar +2
For Nakamoto's longest-chain consensus protocol, whose proof-of-work (PoW) and proof-of-stake (PoS) variants power major blockchains such as Bitcoin and Cardano, we revisit the cla…
Proofs of Proof-of-Stake with Sublinear Complexity
Shresth Agrawal, Joachim Neu, Ertem Nusret Tas +1
Popular Ethereum wallets (like MetaMask) entrust centralized infrastructure providers (e.g., Infura) to run the consensus client logic on their behalf. As a result, these wallets a…
Goldfish: No More Attacks on Ethereum?!
Francesco D'Amato, Joachim Neu, Ertem Nusret Tas +1
The LMD GHOST consensus protocol is a critical component of proof-of-stake Ethereum. In its current form, this protocol is brittle, as evidenced by recent attacks and patching atte…
Two Attacks On Proof-of-Stake GHOST/Ethereum
Joachim Neu, Ertem Nusret Tas, David Tse
We present two attacks targeting the Proof-of-Stake (PoS) Ethereum consensus protocol. The first attack suggests a fundamental conceptual incompatibility between PoS and the Greedy…
Longest Chain Consensus Under Bandwidth Constraint
Joachim Neu, Srivatsan Sridhar, Lei Yang +2
Spamming attacks are a serious concern for consensus protocols, as witnessed by recent outages of a major blockchain, Solana. They cause congestion and excessive message delays in…
Information Dispersal with Provable Retrievability for Rollups
Kamilla Nazirkhanova, Joachim Neu, David Tse
The ability to verifiably retrieve transaction or state data stored off-chain is crucial to blockchain scaling techniques such as rollups or sharding. We formalize the problem and…
Three Attacks on Proof-of-Stake Ethereum
Caspar Schwarz-Schilling, Joachim Neu, Barnabé Monnot +3
Recently, two attacks were presented against Proof-of-Stake (PoS) Ethereum: one where short-range reorganizations of the underlying consensus chain are used to increase individual…
The Availability-Accountability Dilemma and its Resolution via Accountability Gadgets
Joachim Neu, Ertem Nusret Tas, David Tse
For applications of Byzantine fault tolerant (BFT) consensus protocols where the participants are economic agents, recent works highlighted the importance of accountability: the ab…
Snap-and-Chat Protocols: System Aspects
Joachim Neu, Ertem Nusret Tas, David Tse
The availability-finality dilemma says that blockchain protocols cannot be both available under dynamic participation and safe under network partition. Snap-and-chat protocols have…
Ebb-and-Flow Protocols: A Resolution of the Availability-Finality Dilemma
Joachim Neu, Ertem Nusret Tas, David Tse
The CAP theorem says that no blockchain can be live under dynamic participation and safe under temporary network partitions. To resolve this availability-finality dilemma, we formu…
Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes
Mustafa Cemil Coşkun, Joachim Neu, Henry D. Pfister
A successive cancellation (SC) decoder with inactivations is proposed as an efficient implementation of SC list (SCL) decoding over the binary erasure channel. The proposed decoder…
Ternary Quantized Polar Code Decoders: Analysis and Design
Joachim Neu, Mustafa Cemil Coşkun, Gianluigi Liva
The performance of short polar codes under successive cancellation (SC) and SC list (SCL) decoding is analyzed for the case where the decoder messages are coarsely quantized. This…
Boomerang: Redundancy Improves Latency and Throughput in Payment-Channel Networks
Vivek Bagaria, Joachim Neu, David Tse
In multi-path routing schemes for payment-channel networks, Alice transfers funds to Bob by splitting them into partial payments and routing them along multiple paths. Undisclosed…
Babel Storage: Uncoordinated Content Delivery from Multiple Coded Storage Systems
Joachim Neu, Muriel Médard
In future content-centric networks, content is identified independently of its location. From an end-user's perspective, individual storage systems dissolve into a seemingly omnipr…
Quantized Polar Code Decoders: Analysis and Design
Joachim Neu
Applications of massive machine-type communications, such as sensor networks, smart metering, 'internet-of-things', or process and factory automation, are forecast to have great ec…
Degrees-of-Freedom of the MIMO Three-Way Channel with Node-Intermittency
Joachim Neu, Anas Chaaban, Aydin Sezgin +1
The characterization of fundamental performance bounds of many-to-many communication systems in which participating nodes are active in an intermittent way is one of the major chal…