Computer Science
Poster: Timestamp Verifiability in Proof-of-Work
Document Type
Conference Paper
Abstract
2023 International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing
Various blockchain systems have been designed for dynamic networked systems. Due to the nature of the systems, the notion of "time"in such systems is somewhat subjective; hence, it is important to understand how the notion of time may impact these systems. This work focuses on an adversary who attacks a Proof-of-Work (POW) blockchain by selfishly constructing an alternative longest chain. We characterize optimal strategies employed by the adversary when a difficulty adjustment rule alà Bitcoin applies. © 2023 Owner/Author(s).
Publication Title
Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
Publication Date
10-23-2023
First Page
304
Last Page
205
ISBN
9781450399265
DOI
10.1145/3565287.3617934
Keywords
blockchain, difficulty adjustment, longest chain attack
Repository Citation
Law, Tzuo Hann; Erol, Selman; and Tseng, Lewis, "Poster: Timestamp Verifiability in Proof-of-Work" (2023). Computer Science. 8.
https://commons.clarku.edu/faculty_computer_sciences/8
