# Account Management in Proof of Stake Ledgers

@article{Karakostas2020AccountMI,
title={Account Management in Proof of Stake Ledgers},
author={Dimitris Karakostas and Aggelos Kiayias and Mario Larangeira},
journal={IACR Cryptol. ePrint Arch.},
year={2020},
volume={2020},
pages={525}
}
• Published 14 September 2020
• Computer Science
• IACR Cryptol. ePrint Arch.
Blockchain protocols based on Proof-of-Stake (PoS) depend—by nature—on the active participation of stakeholders. If users are offline and abstain from the PoS consensus mechanism, the system’s security is at risk, so it is imperative to explore ways to both maximize the level of participation and minimize the effects of non-participation. One such option is stake representation, such that users can delegate their participation rights and, in the process, form “stake pools”. The core idea is…
5 Citations
Blockchain Nash Dynamics and the Pursuit of Compliance
• Computer Science
ArXiv
• 2022
A formal model is introduced, within which one can assess whether the Nash dynamics can lead utility-maximizing participants to defect from the “honest” protocol operation, towards variations that exhibit one or more undesirable infractions, such as abstaining from participation and producing conﬂicting protocol histories.
W-OTS+ Up My Sleeve! A Hidden Secure Fallback for Cryptocurrency Wallets
• Computer Science, Mathematics
ACNS
• 2021
This work formalizes the notion of “Proof of Ownership” and “Fallback” as new properties, and introduces a new key generation mechanism where users can generate a “back up key”, securely nested inside the secret key of a signature scheme.
Flexible Formality Practical Experience with Agile Formal Methods
• Computer Science
TFP
• 2020
Agile software development and Formal Methods are traditionally seen as being in conflict, but from an Agile perspective, there is pressure to deliver quickly and any change in requirements often necessitates changes in the formal specification.
Reputation at Stake! A Trust Layer over Decentralized Ledger for Multiparty Computation and Reputation-Fair Lottery
This work shows that their delegation framework can be repurposed to construct a trust layer over a proof of stake consensus protocol in addition to its original stake delegation application, and yields a concrete reputation system satisfying the positive results of Asharov et al. (Asiacrypt’13), therefore allowing the secure execution of multiparty protocols.
Conclave: A Collective Stake Pool Protocol
• Computer Science, Mathematics
IACR Cryptol. ePrint Arch.
• 2021
This work proposes Conclave, a formal design of a Collective Stake Pool, i.e., a decentralized pool with no single point of authority, and formalizes Conclave as an ideal functionality and implements it as a distributed protocol, based on standard cryptographic primitives.

## References

SHOWING 1-10 OF 42 REFERENCES
Compounding of Wealth in Proof-of-Stake Cryptocurrencies
• Computer Science, Mathematics
Financial Cryptography
• 2019
The notion of equitability is introduced, which quantifies how much a proposer can amplify her stake compared to her initial investment, and is identified as a \emph{geometric} reward function, which is maximally equitable over all choices of reward functions under honest behavior.
Reward Sharing Schemes for Stake Pools
• Computer Science
2020 IEEE European Symposium on Security and Privacy (EuroS&P)
• 2020
RSS is introduced and study and fast convergence to equilibria is experimentally demonstrated in dynamic environments where players react to each other's strategic moves over an indefinite period of interactive play, showing how simple reward sharing schemes that are seemingly more “fair”, perhaps counterin-tuitively, converge to centralizedEquilibria.
Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability
• Computer Science, Mathematics
IACR Cryptol. ePrint Arch.
• 2018
A novel Proof-of-Stake protocol, Ouroboros Genesis, that enables parties to safely join (or rejoin) the protocol execution using only the genesis block information, and proves the security of the construction against an adaptive adversary.
Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake protocol
• Computer Science, Mathematics
IACR Cryptol. ePrint Arch.
• 2017
“Ouroboros Praos” is a new proof-of-stake blockchain protocol that provides, for the first time, a robust distributed ledger that is provably secure in the semi-synchronous adversarial setting and fully adaptively secure.
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
• Computer Science, Mathematics
CRYPTO
• 2016
“Ouroboros” is presented, the first blockchain protocol based on proof of stake with rigorous security guarantees and it is proved that, given this mechanism, honest behavior is an approximate Nash equilibrium, thus neutralizing attacks such as selfish mining.
Hydra: Fast Isomorphic State Channels
• Computer Science
IACR Cryptol. ePrint Arch.
• 2020
This paper introduces Hydra, an isomorphic multi-party state channel that simplifies offchain protocol and contract development by directly adopting the layer-one smart contract system, and establishes strong security properties for the protocol.
Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain
• Computer Science, Mathematics
EUROCRYPT
• 2018
Ouroboros Praos is a proof-of-stake blockchain protocol that provides security against fully-adaptive corruption in the semi-synchronous setting and tolerates an adversarially-controlled message delivery delay unknown to protocol participants.
Analysis of the Blockchain Protocol in Asynchronous Networks
• Computer Science, Mathematics
EUROCRYPT
• 2016
Nakamoto’s famous blockchain protocol enables achieving consensus in a so-called permissionless setting—anyone can join (or leave) the protocol execution, and the protocol instructions do not depend
Snow White: Provably Secure Proofs of Stake
• Computer Science, Mathematics
IACR Cryptol. ePrint Arch.
• 2016
It is argued that any consensus protocol satisfying functionalities and robustness requirements can be used for proofs-of-stake, as long as money does not switch hands too quickly, and this work is the first to formally articulate a set of requirements for consensus candidates for proofs ofstake.
The Sleepy Model of Consensus
• Computer Science, Mathematics
ASIACRYPT
• 2017
This work begins a study of distributed protocols in a “sleepy” model of computation where players can be either online (awake) or offline (asleep), and their online status may change at any point during the protocol.