id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
eprint-iacr-org-7873	Sarah Azouvi, George Danezis, and Valeria Nikolaenko	Winkle: Foiling Long-Range Attacks in Proof-of-Stake Systems	2020-09-03	13	.pdf	application/pdf	13749	1146	70	Winkle protects any validator-based byzantine fault tolerant consensus mechanisms, such as those used in modern Proof-of-Stake blockchains, against long-range attacks where old validators' signature keys get compromised. A number of blockchains are considering proof-of-stake mechanisms in place of proof-of-work, attracted by faster and deterministic finality as well as lower energy costs. attack and building a forking chain cannot freely replicate transactions from honest users since those commit to checkpoints on the Accounts managed by honest and active users follow some constraints: (1) all their votes are for pairwise consistent checkpoints; that Winkle compared to the delegated proof-of-stake systems requires weaker trust assumptions from the clients. pools vote often on behalf of dormant accounts, we expect checkpoints to be confirmed faster. an adversary, in a forking chain, may accumulate the rewards associated with creation of new blocks in order to inflate its stake	./cache/eprint-iacr-org-7873.pdf	./txt/eprint-iacr-org-7873.txt