Thunderella: Blockchains with Optimistic Instant Confirmation View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2018-03-31

AUTHORS

Rafael Pass , Elaine Shi

ABSTRACT

State machine replication, or “consensus”, is a central abstraction for distributed systems where a set of nodes seek to agree on an ever-growing, linearly-ordered log. In this paper, we propose a practical new paradigm called Thunderella for achieving state machine replication by combining a fast, asynchronous path with a (slow) synchronous “fall-back” path (which only gets executed if something goes wrong); as a consequence, we get simple state machine replications that essentially are as robust as the best synchronous protocols, yet “optimistically” (if a super majority of the players are honest), the protocol “instantly” confirms transactions.We provide instantiations of this paradigm in both permissionless (using proof-of-work) and permissioned settings. Most notably, this yields a new blockchain protocol (for the permissionless setting) that remains resilient assuming only that a majority of the computing power is controlled by honest players, yet optimistically—if 3/4 of the computing power is controlled by honest players, and a special player called the “accelerator”, is honest—transactions are confirmed as fast as the actual message delay in the network. We additionally show the 3/4 optimistic bound is tight for protocols that are resilient assuming only an honest majority. More... »

PAGES

3-33

Book

TITLE

Advances in Cryptology – EUROCRYPT 2018

ISBN

978-3-319-78374-1
978-3-319-78375-8

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-319-78375-8_1

DOI

http://dx.doi.org/10.1007/978-3-319-78375-8_1

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1101874778


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "CornellTech, New York, USA", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "CornellTech, New York, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Pass", 
        "givenName": "Rafael", 
        "id": "sg:person.011042626001.74", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011042626001.74"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Cornell, Ithaca, USA", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Cornell, Ithaca, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Shi", 
        "givenName": "Elaine", 
        "id": "sg:person.014706274717.52", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014706274717.52"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2018-03-31", 
    "datePublishedReg": "2018-03-31", 
    "description": "State machine replication, or \u201cconsensus\u201d, is a central abstraction for distributed systems where a set of nodes seek to agree on an ever-growing, linearly-ordered log. In this paper, we propose a practical new paradigm called Thunderella for achieving state machine replication by combining a fast, asynchronous path with a (slow) synchronous \u201cfall-back\u201d path (which only gets executed if something goes wrong); as a consequence, we get simple state machine replications that essentially are as robust as the best synchronous protocols, yet \u201coptimistically\u201d (if a super majority of the players are honest), the protocol \u201cinstantly\u201d confirms transactions.We provide instantiations of this paradigm in both permissionless (using proof-of-work) and permissioned settings. Most notably, this yields a new blockchain protocol (for the permissionless setting) that remains resilient assuming only that a majority of the computing power is controlled by honest players, yet optimistically\u2014if 3/4 of the computing power is controlled by honest players, and a special player called the \u201caccelerator\u201d, is honest\u2014transactions are confirmed as fast as the actual message delay in the network. We additionally show the 3/4 optimistic bound is tight for protocols that are resilient assuming only an honest majority.", 
    "editor": [
      {
        "familyName": "Nielsen", 
        "givenName": "Jesper Buus", 
        "type": "Person"
      }, 
      {
        "familyName": "Rijmen", 
        "givenName": "Vincent", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-319-78375-8_1", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-319-78374-1", 
        "978-3-319-78375-8"
      ], 
      "name": "Advances in Cryptology \u2013 EUROCRYPT 2018", 
      "type": "Book"
    }, 
    "keywords": [
      "state machine replication", 
      "machine replication", 
      "computing power", 
      "honest players", 
      "set of nodes", 
      "central abstraction", 
      "honest majority", 
      "blockchain protocol", 
      "message delay", 
      "synchronous protocol", 
      "new blockchain protocol", 
      "instant confirmation", 
      "new paradigm", 
      "protocol", 
      "blockchain", 
      "paradigm", 
      "permissionless", 
      "instantiation", 
      "abstraction", 
      "path", 
      "network", 
      "asynchronous path", 
      "transactions", 
      "nodes", 
      "players", 
      "set", 
      "log", 
      "system", 
      "accelerator", 
      "delay", 
      "power", 
      "consensus", 
      "setting", 
      "replication", 
      "majority", 
      "consequences", 
      "confirmation", 
      "paper", 
      "special player", 
      "practical new paradigm", 
      "Thunderella", 
      "simple state machine replications", 
      "actual message delay", 
      "Optimistic Instant Confirmation"
    ], 
    "name": "Thunderella: Blockchains with Optimistic Instant Confirmation", 
    "pagination": "3-33", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1101874778"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-319-78375-8_1"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-319-78375-8_1", 
      "https://app.dimensions.ai/details/publication/pub.1101874778"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-11-01T19:02", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211101/entities/gbq_results/chapter/chapter_53.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-319-78375-8_1"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-78375-8_1'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-78375-8_1'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-78375-8_1'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-78375-8_1'


 

This table displays all metadata directly associated to this object as RDF triples.

118 TRIPLES      23 PREDICATES      69 URIs      62 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-319-78375-8_1 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N986f182d1b4b45f89ea7c157de6c7550
4 schema:datePublished 2018-03-31
5 schema:datePublishedReg 2018-03-31
6 schema:description State machine replication, or “consensus”, is a central abstraction for distributed systems where a set of nodes seek to agree on an ever-growing, linearly-ordered log. In this paper, we propose a practical new paradigm called Thunderella for achieving state machine replication by combining a fast, asynchronous path with a (slow) synchronous “fall-back” path (which only gets executed if something goes wrong); as a consequence, we get simple state machine replications that essentially are as robust as the best synchronous protocols, yet “optimistically” (if a super majority of the players are honest), the protocol “instantly” confirms transactions.We provide instantiations of this paradigm in both permissionless (using proof-of-work) and permissioned settings. Most notably, this yields a new blockchain protocol (for the permissionless setting) that remains resilient assuming only that a majority of the computing power is controlled by honest players, yet optimistically—if 3/4 of the computing power is controlled by honest players, and a special player called the “accelerator”, is honest—transactions are confirmed as fast as the actual message delay in the network. We additionally show the 3/4 optimistic bound is tight for protocols that are resilient assuming only an honest majority.
7 schema:editor N623d6971324b4ea6a16681f5261dd358
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N7dddea548774427a92634a6e83120954
12 schema:keywords Optimistic Instant Confirmation
13 Thunderella
14 abstraction
15 accelerator
16 actual message delay
17 asynchronous path
18 blockchain
19 blockchain protocol
20 central abstraction
21 computing power
22 confirmation
23 consensus
24 consequences
25 delay
26 honest majority
27 honest players
28 instant confirmation
29 instantiation
30 log
31 machine replication
32 majority
33 message delay
34 network
35 new blockchain protocol
36 new paradigm
37 nodes
38 paper
39 paradigm
40 path
41 permissionless
42 players
43 power
44 practical new paradigm
45 protocol
46 replication
47 set
48 set of nodes
49 setting
50 simple state machine replications
51 special player
52 state machine replication
53 synchronous protocol
54 system
55 transactions
56 schema:name Thunderella: Blockchains with Optimistic Instant Confirmation
57 schema:pagination 3-33
58 schema:productId N68a89ae8bf594c309a5a601da32cef43
59 N9ef6675c473046bba78c69b9b6169283
60 schema:publisher Nf927230675f541aba815651c2ac0eaf7
61 schema:sameAs https://app.dimensions.ai/details/publication/pub.1101874778
62 https://doi.org/10.1007/978-3-319-78375-8_1
63 schema:sdDatePublished 2021-11-01T19:02
64 schema:sdLicense https://scigraph.springernature.com/explorer/license/
65 schema:sdPublisher N229217206bcc430eac6ce033bbd30107
66 schema:url https://doi.org/10.1007/978-3-319-78375-8_1
67 sgo:license sg:explorer/license/
68 sgo:sdDataset chapters
69 rdf:type schema:Chapter
70 N1552a629f19f41c69f57b82dc24734ab schema:familyName Rijmen
71 schema:givenName Vincent
72 rdf:type schema:Person
73 N229217206bcc430eac6ce033bbd30107 schema:name Springer Nature - SN SciGraph project
74 rdf:type schema:Organization
75 N2a7dafcc9fe34b24906b428ae6324651 rdf:first N1552a629f19f41c69f57b82dc24734ab
76 rdf:rest rdf:nil
77 N623d6971324b4ea6a16681f5261dd358 rdf:first N9a8ca2a10e944f3d9566a10595218a53
78 rdf:rest N2a7dafcc9fe34b24906b428ae6324651
79 N68a89ae8bf594c309a5a601da32cef43 schema:name dimensions_id
80 schema:value pub.1101874778
81 rdf:type schema:PropertyValue
82 N7dddea548774427a92634a6e83120954 schema:isbn 978-3-319-78374-1
83 978-3-319-78375-8
84 schema:name Advances in Cryptology – EUROCRYPT 2018
85 rdf:type schema:Book
86 N986f182d1b4b45f89ea7c157de6c7550 rdf:first sg:person.011042626001.74
87 rdf:rest Ndeff542d447b4a9097fff70162158125
88 N9a8ca2a10e944f3d9566a10595218a53 schema:familyName Nielsen
89 schema:givenName Jesper Buus
90 rdf:type schema:Person
91 N9ef6675c473046bba78c69b9b6169283 schema:name doi
92 schema:value 10.1007/978-3-319-78375-8_1
93 rdf:type schema:PropertyValue
94 Ndeff542d447b4a9097fff70162158125 rdf:first sg:person.014706274717.52
95 rdf:rest rdf:nil
96 Nf927230675f541aba815651c2ac0eaf7 schema:name Springer Nature
97 rdf:type schema:Organisation
98 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
99 schema:name Information and Computing Sciences
100 rdf:type schema:DefinedTerm
101 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
102 schema:name Computation Theory and Mathematics
103 rdf:type schema:DefinedTerm
104 sg:person.011042626001.74 schema:affiliation grid-institutes:None
105 schema:familyName Pass
106 schema:givenName Rafael
107 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011042626001.74
108 rdf:type schema:Person
109 sg:person.014706274717.52 schema:affiliation grid-institutes:None
110 schema:familyName Shi
111 schema:givenName Elaine
112 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014706274717.52
113 rdf:type schema:Person
114 grid-institutes:None schema:alternateName Cornell, Ithaca, USA
115 CornellTech, New York, USA
116 schema:name Cornell, Ithaca, USA
117 CornellTech, New York, USA
118 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...