A Fully Local Last-Generated Rule in a Blockchain
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915017629106176 |
|---|---|
| author | Sakurai, Akira Shudo, Kazuyuki |
| author_facet | Sakurai, Akira Shudo, Kazuyuki |
| contents | An effective method for suppressing intentional forks in a blockchain is the last-generated rule, which selects the most recent chain as the main chain in the event of a chain tie. This rule helps invalidate blocks that are withheld by adversaries for a certain period. However, existing last-generated rules face an issue in that their applications to the system are not fully localized. In conservative cryptocurrency systems such as Bitcoin, it is desirable for methods to be applied in a fully local manner. In this paper, we propose a locally applicable last-generated rule. Our method is straightforward and is based on a relative time reference. By conservatively setting the upper bound for the clock skews $Δ_{O_i}$ to 200 s, our proposed method reduces the proportion $γ$ of honest miners following the attacker during chain ties by more than 40% compared to existing local methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_08439 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Fully Local Last-Generated Rule in a Blockchain Sakurai, Akira Shudo, Kazuyuki Cryptography and Security An effective method for suppressing intentional forks in a blockchain is the last-generated rule, which selects the most recent chain as the main chain in the event of a chain tie. This rule helps invalidate blocks that are withheld by adversaries for a certain period. However, existing last-generated rules face an issue in that their applications to the system are not fully localized. In conservative cryptocurrency systems such as Bitcoin, it is desirable for methods to be applied in a fully local manner. In this paper, we propose a locally applicable last-generated rule. Our method is straightforward and is based on a relative time reference. By conservatively setting the upper bound for the clock skews $Δ_{O_i}$ to 200 s, our proposed method reduces the proportion $γ$ of honest miners following the attacker during chain ties by more than 40% compared to existing local methods. |
| title | A Fully Local Last-Generated Rule in a Blockchain |
| topic | Cryptography and Security |
| url | https://arxiv.org/abs/2411.08439 |