2022
DOI: 10.1109/tsc.2022.3201568
|View full text |Cite
|
Sign up to set email alerts
|

Regulatable and Hardware-Based Proof of Stake to Approach Nothing At Stake and Long Range Attacks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…Computational Timestamping. Almost all know proof-of-stake [ 51 ] systems face the problem of long-range attack [ 52 ]. In a proof-of-stake protocol, a group of stakeholders has voting rights proportional to their stake at any time.…”
Section: Verifiable Delay Functions Applicationsmentioning
confidence: 99%
“…Computational Timestamping. Almost all know proof-of-stake [ 51 ] systems face the problem of long-range attack [ 52 ]. In a proof-of-stake protocol, a group of stakeholders has voting rights proportional to their stake at any time.…”
Section: Verifiable Delay Functions Applicationsmentioning
confidence: 99%
“…It not only significantly reduces the computational power consumption of the blockchain network but also encourages all nodes to proactively maintain the system's secure and stable operation to protect their stakes [5][6][7]. Studies have shown that for a blockchain network utilizing PoS, launching a 51% attack requires owning more than half of the total stake, which requires higher cost than possessing over half of the network's computational power, thereby reducing security risks [8,9]. However, PoS does not address the increasing issue of centralization, as the generation of new blocks tends to favour nodes with higher stakes [10].…”
Section: Introductionmentioning
confidence: 99%