Minting mechanism for proof of stake blockchains

DOI10.1007/978-3-030-57808-4_16OpenAlexW3081664785MaRDI QIDQ2229280FDOQ2229280

Authors: Dominic Deuber, Nico Döttling, Bernardo Magri, Giulio Malavolta, Sri Aravinda Krishnan Thyagarajan 

Publication date: 23 February 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57808-4_16

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Cites Work

• Algorithmic rationality: game theory with costly computation
• Computationally Sound Proofs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Majority Is Not Enough: Bitcoin Mining Is Vulnerable
• Proofs of Space
• The Bitcoin Backbone Protocol: Analysis and Applications
• Homomorphic time-lock puzzles and applications
• Simple verifiable delay functions
• Efficient verifiable delay functions
• Analysis of the Blockchain Protocol in Asynchronous Networks
• But why does it work? A rational protocol design treatment of bitcoin
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• The Bitcoin backbone protocol with chains of variable difficulty
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• FruitChains
• On the Size of Pairing-Based Non-interactive Arguments

Cited In (5)

• Better incentives for proof-of-work
• Title not available (Why is that?)
• McFly: verifiable encryption to the future made practical
• Incentive compatible and anti-compounding of wealth in proof-of-stake
• FAST: fair auctions via secret transactions

This page was built for publication: Minting mechanism for proof of stake blockchains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229280)