How Does Blockchain Security Dictate Blockchain Implementation?

09/10/2021
by   Andrew Lewis-Pye, et al.
0

Blockchain protocols come with a variety of security guarantees. For example, BFT-inspired protocols such as Algorand tend to be secure in the partially synchronous setting, while longest chain protocols like Bitcoin will normally require stronger synchronicity to be secure. Another fundamental distinction, directly relevant to scalability solutions such as sharding, is whether or not a single untrusted user is able to point to *certificates*, which provide incontrovertible proof of block confirmation. Algorand produces such certificates, while Bitcoin does not. Are these properties accidental? Or are they inherent consequences of the paradigm of protocol design? Our aim in this paper is to understand what, fundamentally, governs the nature of security for permissionless blockchain protocols. Using the framework developed in (Lewis-Pye and Roughgarden, 2021), we prove general results showing that these questions relate directly to properties of the user selection process, i.e., the method (such as proof-of-work or proof-of-stake) which is used to select users with the task of updating state. Our results suffice to establish, for example, that the production of certificates is impossible for proof-of-work protocols, but is automatic for standard forms of proof-of-stake protocols. As a byproduct of our work, we also define a number of security notions and identify the equivalences and inequivalences among them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/20/2020

A General Framework for the Security Analysis of Blockchain Protocols

Blockchain protocols differ in fundamental ways, including the mechanics...
research
08/12/2021

Sharding-Based Proof-of-Stake Blockchain Protocols: Security Analysis

Blockchain technology has been gaining great interest from a variety of ...
research
06/18/2020

Resource Pools and the CAP Theorem

Blockchain protocols differ in fundamental ways, including the mechanics...
research
11/11/2019

Just Enough Security: Reducing Proof-of-Work Ecological Footprint

Proof-of-work (PoW) mechanisms secure about 80% of the $250B cryptocurre...
research
03/31/2022

Parallel Proof-of-Work with Concrete Bounds

Authorization is challenging in distributed systems that cannot rely on ...
research
10/30/2019

Breaking and (Partially) Fixing Provably Secure Onion Routing

After several years of research on onion routing, Camenisch and Lysyansk...
research
12/23/2022

Permissionless Refereed Tournaments

Scalability problems in programmable blockchains have created a strong d...

Please sign up or login with your details

Forgot password? Click here to reset