Publish or Perish: A Backward-Compatible Defense Against Selfish Mining in Bitcoin View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2017-01-10

AUTHORS

Ren Zhang , Bart Preneel

ABSTRACT

The Bitcoin mining protocol has been intensively studied and widely adopted by many other cryptocurrencies. However, it has been shown that this protocol is not incentive compatible, because the selfish mining strategy enables a miner to gain unfair rewards. Existing defenses either demand fundamental changes to block validity rules or have little effect against a resourceful attacker. This paper proposes a backward-compatible defense mechanism which outperforms the previous best defense. Our fork-resolving policy neglects blocks that are not published in time and appreciates blocks that incorporate links to competing blocks of their predecessors. Consequently, a block that is kept secret until a competing block is published contributes to neither or both branches, hence it confers no advantage in winning the block race. Additionally, we discuss the dilemma between partition recovery time and selfish mining resistance, and how to balance them in our defense. More... »

PAGES

277-292

Book

TITLE

Topics in Cryptology – CT-RSA 2017

ISBN

978-3-319-52152-7
978-3-319-52153-4

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-319-52153-4_16

DOI

http://dx.doi.org/10.1007/978-3-319-52153-4_16

DIMENSIONS

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


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/21", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "History and Archaeology", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/2103", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Historical Studies", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "KU Leuven, ESAT/COSIC and IMEC, Leuven, Belgium", 
          "id": "http://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "KU Leuven, ESAT/COSIC and IMEC, Leuven, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Zhang", 
        "givenName": "Ren", 
        "id": "sg:person.010464261777.00", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010464261777.00"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "KU Leuven, ESAT/COSIC and IMEC, Leuven, Belgium", 
          "id": "http://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "KU Leuven, ESAT/COSIC and IMEC, Leuven, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Preneel", 
        "givenName": "Bart", 
        "id": "sg:person.011115044357.39", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011115044357.39"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2017-01-10", 
    "datePublishedReg": "2017-01-10", 
    "description": "The Bitcoin mining protocol has been intensively studied and widely adopted by many other cryptocurrencies. However, it has been shown that this protocol is not incentive compatible, because the selfish mining strategy enables a miner to gain unfair rewards. Existing defenses either demand fundamental changes to block validity rules or have little effect against a resourceful attacker. This paper proposes a backward-compatible defense mechanism which outperforms the previous best defense. Our fork-resolving policy neglects blocks that are not published in time and appreciates blocks that incorporate links to competing blocks of their predecessors. Consequently, a block that is kept secret until a competing block is published contributes to neither or both branches, hence it confers no advantage in winning the block race. Additionally, we discuss the dilemma between partition recovery time and selfish mining resistance, and how to balance them in our defense.", 
    "editor": [
      {
        "familyName": "Handschuh", 
        "givenName": "Helena", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-319-52153-4_16", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-319-52152-7", 
        "978-3-319-52153-4"
      ], 
      "name": "Topics in Cryptology \u2013 CT-RSA 2017", 
      "type": "Book"
    }, 
    "keywords": [
      "defense mechanisms", 
      "recovery time", 
      "protocol", 
      "defense", 
      "little effect", 
      "best defense", 
      "contributes", 
      "race", 
      "time", 
      "changes", 
      "effect", 
      "block", 
      "resistance", 
      "mechanism", 
      "strategies", 
      "dilemma", 
      "miners", 
      "reward", 
      "branches", 
      "link", 
      "fundamental changes", 
      "advantages", 
      "validity rules", 
      "incentives", 
      "mining protocol", 
      "mining strategy", 
      "perish", 
      "predecessors", 
      "rules", 
      "paper", 
      "mining", 
      "attacker", 
      "cryptocurrencies", 
      "Bitcoin", 
      "selfish mining strategy", 
      "unfair reward", 
      "resourceful attackers", 
      "selfish mining"
    ], 
    "name": "Publish or Perish: A Backward-Compatible Defense Against Selfish Mining in Bitcoin", 
    "pagination": "277-292", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1018912718"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-319-52153-4_16"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-319-52153-4_16", 
      "https://app.dimensions.ai/details/publication/pub.1018912718"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-09-02T16:15", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220902/entities/gbq_results/chapter/chapter_386.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-319-52153-4_16"
  }
]
 

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-52153-4_16'

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-52153-4_16'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-52153-4_16'

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-52153-4_16'


 

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

104 TRIPLES      22 PREDICATES      62 URIs      55 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-319-52153-4_16 schema:about anzsrc-for:21
2 anzsrc-for:2103
3 schema:author N47fa3fed04c742f5b99e8c4d334742cf
4 schema:datePublished 2017-01-10
5 schema:datePublishedReg 2017-01-10
6 schema:description The Bitcoin mining protocol has been intensively studied and widely adopted by many other cryptocurrencies. However, it has been shown that this protocol is not incentive compatible, because the selfish mining strategy enables a miner to gain unfair rewards. Existing defenses either demand fundamental changes to block validity rules or have little effect against a resourceful attacker. This paper proposes a backward-compatible defense mechanism which outperforms the previous best defense. Our fork-resolving policy neglects blocks that are not published in time and appreciates blocks that incorporate links to competing blocks of their predecessors. Consequently, a block that is kept secret until a competing block is published contributes to neither or both branches, hence it confers no advantage in winning the block race. Additionally, we discuss the dilemma between partition recovery time and selfish mining resistance, and how to balance them in our defense.
7 schema:editor N267c7803b99541b8b53d1c73abc699f1
8 schema:genre chapter
9 schema:isAccessibleForFree false
10 schema:isPartOf N3ec1a02d508f4d6696fa5697e3a211dc
11 schema:keywords Bitcoin
12 advantages
13 attacker
14 best defense
15 block
16 branches
17 changes
18 contributes
19 cryptocurrencies
20 defense
21 defense mechanisms
22 dilemma
23 effect
24 fundamental changes
25 incentives
26 link
27 little effect
28 mechanism
29 miners
30 mining
31 mining protocol
32 mining strategy
33 paper
34 perish
35 predecessors
36 protocol
37 race
38 recovery time
39 resistance
40 resourceful attackers
41 reward
42 rules
43 selfish mining
44 selfish mining strategy
45 strategies
46 time
47 unfair reward
48 validity rules
49 schema:name Publish or Perish: A Backward-Compatible Defense Against Selfish Mining in Bitcoin
50 schema:pagination 277-292
51 schema:productId N1957bd3fb618495e82ebb93391296eaa
52 Nd9ec1d5d86ac4345a159e6a22cba802d
53 schema:publisher N7c905e45d8df4c88afc60002cfb28784
54 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018912718
55 https://doi.org/10.1007/978-3-319-52153-4_16
56 schema:sdDatePublished 2022-09-02T16:15
57 schema:sdLicense https://scigraph.springernature.com/explorer/license/
58 schema:sdPublisher N648e406d3c0a4e60a84e10becd8097ee
59 schema:url https://doi.org/10.1007/978-3-319-52153-4_16
60 sgo:license sg:explorer/license/
61 sgo:sdDataset chapters
62 rdf:type schema:Chapter
63 N1957bd3fb618495e82ebb93391296eaa schema:name dimensions_id
64 schema:value pub.1018912718
65 rdf:type schema:PropertyValue
66 N267c7803b99541b8b53d1c73abc699f1 rdf:first Nfe544a6e16244a89a255fb7e3eb268c3
67 rdf:rest rdf:nil
68 N3ec1a02d508f4d6696fa5697e3a211dc schema:isbn 978-3-319-52152-7
69 978-3-319-52153-4
70 schema:name Topics in Cryptology – CT-RSA 2017
71 rdf:type schema:Book
72 N44cef1fdf55340508159d832bc169c13 rdf:first sg:person.011115044357.39
73 rdf:rest rdf:nil
74 N47fa3fed04c742f5b99e8c4d334742cf rdf:first sg:person.010464261777.00
75 rdf:rest N44cef1fdf55340508159d832bc169c13
76 N648e406d3c0a4e60a84e10becd8097ee schema:name Springer Nature - SN SciGraph project
77 rdf:type schema:Organization
78 N7c905e45d8df4c88afc60002cfb28784 schema:name Springer Nature
79 rdf:type schema:Organisation
80 Nd9ec1d5d86ac4345a159e6a22cba802d schema:name doi
81 schema:value 10.1007/978-3-319-52153-4_16
82 rdf:type schema:PropertyValue
83 Nfe544a6e16244a89a255fb7e3eb268c3 schema:familyName Handschuh
84 schema:givenName Helena
85 rdf:type schema:Person
86 anzsrc-for:21 schema:inDefinedTermSet anzsrc-for:
87 schema:name History and Archaeology
88 rdf:type schema:DefinedTerm
89 anzsrc-for:2103 schema:inDefinedTermSet anzsrc-for:
90 schema:name Historical Studies
91 rdf:type schema:DefinedTerm
92 sg:person.010464261777.00 schema:affiliation grid-institutes:grid.5596.f
93 schema:familyName Zhang
94 schema:givenName Ren
95 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010464261777.00
96 rdf:type schema:Person
97 sg:person.011115044357.39 schema:affiliation grid-institutes:grid.5596.f
98 schema:familyName Preneel
99 schema:givenName Bart
100 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011115044357.39
101 rdf:type schema:Person
102 grid-institutes:grid.5596.f schema:alternateName KU Leuven, ESAT/COSIC and IMEC, Leuven, Belgium
103 schema:name KU Leuven, ESAT/COSIC and IMEC, Leuven, Belgium
104 rdf:type schema:Organization
 




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


...