Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability

@article{Badertscher2018OuroborosGC,
  title={Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability},
  author={Christian Badertscher and Peter Gazi and Aggelos Kiayias and Alexander Russell and Vassilis Zikas},
  journal={Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security},
  year={2018}
}
We present a novel Proof-of-Stake (PoS) protocol, Ouroboros Genesis,, that enables parties to safely join (or rejoin) the protocol execution using only the genesis block information. [...] Key Result Finally, proving the security of our construction against an adaptive adversary requires a novel martingale technique that may be of independent interest in the analysis of blockchain protocols.Expand
Puncturable Signatures and Applications in Proof-of-Stake Blockchain Protocols
TLDR
An in-depth study of puncturable signatures and its applications in the proof-of-stake blockchain, including a security model that allows the adversary for adaptive signing and puncturing queries, and a construction with efficient puncturing operations based on the Bloom filter data structure and strong Diffie-Hellman assumption. Expand
Ledger Combiners for Fast Settlement
TLDR
This work introduces a new formalism for reasoning about blockchains, the dynamic ledger, and articulate constructions as transformations of dynamic ledgers that amplify security by presenting a class of robustcombiner constructions for blockchains that can protect against complete adversarial control of a minority of a family of blockchains. Expand
A PoR/PoS-Hybrid Blockchain: Proof of Reputation with Nakamoto Fallback
TLDR
A definition of reputation fairness that ensures fair participation while giving chances to newly joining parties to participate and potentially build reputation is devised, which results in a ledger protocol which is provably secure if the reputation system is accurate, and preserves its basic safety properties even if it is not. Expand
Mining for Privacy: How to Bootstrap a Snarky Blockchain
TLDR
This work describes and analyse, for the first time, a blockchain mechanism that produces a secure SRS with the characteristic that security is shown under comparable conditions to the blockchain protocol itself. Expand
Timed Signatures and Zero-Knowledge Proofs -Timestamping in the Blockchain Era-
TLDR
This work puts forth the first formal treatment of timestamping cryptographic primitives in the UC framework with respect to a global clock, and proposes timed versions of primitives commonly used for authenticating information, such as digital signatures, non-interactive zero-knowledge proofs, and signatures of knowledge. Expand
UniqueChain: A Fast, Provably Secure Proof-of-Stake Based Blockchain Protocol in the Open Setting
TLDR
It is proved that ”UniqueChain” satisfies security properties as chain growth, chain quality, common prefix and soundness, and two additional properties as uniqueness and high efficiency, and it is shown that security of this protocol holds if majority of overall stakes are controlled by honest parties. Expand
Founding Secure Computation on Blockchains
TLDR
It is shown that achieving security against blockchain-active adversaries is possible if the honest parties are also blockchain active, and a concurrent self-composable secure computation protocol is constructed for general functionalities in the blockchain-hybrid model based on standard cryptographic assumptions. Expand
Proof-of-Stake Sidechains
TLDR
A security definition is put forth that augments the known transaction ledger properties of liveness and safety to hold across multiple ledgers and enhance them with a new “firewall” security property which safeguards each blockchain from its sidechains, limiting the impact of an otherwise catastrophic sidechain failure. Expand
Consensus on Clock in Universally Composable Timing Model
TLDR
A general universally composable (GUC) model that captures the notion of consensus on a clock is defined that is agreed upon by honest parties by considering the clocks of all parties and gives a simple but useful protocol relying on a blockchain network. Expand
Formalizing Nakamoto-Style Proof of Stake
TLDR
This work verifies a Proof of Stake (PoS) Nakamoto-style blockchain (NSB) protocol, using the foundational proof assistant Coq, and presents the first machine checked proof that guarantees both safety and liveness for a consensus algorithm. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 50 REFERENCES
Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake protocol
TLDR
“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. Expand
Stake-Bleeding Attacks on Proof-of-Stake Blockchains
TLDR
A general attack on proof-of-stake (PoS) blockchains without checkpointing is described, which demonstrates how closely transaction fees and rewards are coupled with the security properties of PoS protocols. Expand
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
TLDR
“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. Expand
Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain
TLDR
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. Expand
Analysis of the Blockchain Protocol in Asynchronous Networks
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 dependExpand
A Next-Generation Smart Contract and Decentralized Application Platform
When Satoshi Nakamoto first set the Bitcoin blockchain into motion in January 2009, he was simultaneously introducing two radical and untested concepts. The first is the "bitcoin", a decentralized Expand
Snow White: Provably Secure Proofs of Stake
TLDR
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. Expand
Bitcoin: A Peer-to-Peer Electronic Cash System
A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. Digital signatures provideExpand
Universally Composable Commitments
We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantees that commitment protocols behave like an "ideal commitment service,"Expand
The Bitcoin Backbone Protocol with Chains of Variable Difficulty
TLDR
As the miners’ population evolves over time, so should the difficulty of these proofs, and Bitcoin provides this adjustment mechanism, with empirical evidence of a constant block generation rate against such population changes. Expand
...
1
2
3
4
5
...