• Corpus ID: 19568615

Proofs of Work for Blockchain Protocols

@article{Garay2017ProofsOW,
  title={Proofs of Work for Blockchain Protocols},
  author={Juan A. Garay and Aggelos Kiayias and Giorgos Panagiotakos},
  journal={IACR Cryptol. ePrint Arch.},
  year={2017},
  volume={2017},
  pages={775}
}
One of the most impactful applications of proofs of work (POW) currently is in the design of blockchain protocols such as Bitcoin. Yet, despite the wide recognition of POWs as the fundamental cryptographic tool in this context, there is no known cryptographic formulation that implies the security of the Bitcoin blockchain protocol. Indeed, all previous works formally arguing the security of the Bitcoin protocol relied on direct proofs in the random oracle model, thus circumventing the di culty… 

Figures and Tables from this paper

Coin.AI: A Proof-of-Useful-Work Scheme for Blockchain-Based Distributed Deep Learning

A theoretical proposal that introduces a proof-of-useful-work scheme to support a cryptocurrency running over a blockchain, which is named Coin.AI, and a theoretical dissertation on how the mechanics of the system could be articulated with the ultimate goal of democratizing access to artificial intelligence is presented.

Astrolabous: A Universally Composable Time-Lock Encryption Scheme

This work study the cryptographic primitive called time-lock encryption (TLE), and formally abstracts the concept of TLE into an ideal functionality in a flexible way, providing a standalone definition for secure TLE schemes in a game-based style and devise a hybrid protocol that relies on such a secure Tle scheme.

Moderately Hard Functions: Definition, Instantiations, and Applications

The goal of this work is to provide a (universal) definition that decouples the efforts of designing new moderately hard functions and of building protocols based on them, serving as an interface between the two.

Verify-Your-Vote: A Verifiable Blockchain-Based Online Voting Protocol

This paper designs a fully verifiable online electronic voting protocol, called VYV for Verify-Your-Vote, which ensures the following privacy and security properties: only eligible voter can vote, authentication of the voter, vote privacy, receipt-freeness, fairness, individual and universal verifiability.

SoK: A Consensus Taxonomy in the Blockchain Era

This paper presents a meta-modelling framework that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of establishing consensus in the context of a distributed system.

Topics in Cryptology – CT-RSA 2020: The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings

This work discusses efficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation onGLV-GLS Curves, an Improved Compression Technique for Signatures Based on Learning with Errors, and Rethinking Verifiably Encrypted Signatures.

Foundations, Properties, and Security Applications of Puzzles: A Survey

The term puzzle is redefined by collecting and integrating the scattered notions used in different works, to cover all the existing applications, and a comprehensive study of the most important puzzle construction schemes available in the literature is provided.

Agreement with Satoshi - On the Formalization of Nakamoto Consensus

How Bitcoin’s consensus mechanism sets itself apart from previous approaches and where it can provide new impulses and directions to the scientific community is outlined, as well as a contextualization in respect to previous research on the agreement problem and fault tolerant distributed computing.

Foundations, Properties, and Security Applications of Puzzles

The term puzzle is redefined by collecting and integrating the scattered notions used in different works, to cover all the existing applications, and a comprehensive study of the most important puzzle construction schemes available in the literature is provided.

A Survey on Consensus Mechanisms and Mining Management in Blockchain Networks

This survey is motivated by the lack of a comprehensive literature review on the development of decentralized consensus mechanisms in blockchain networks and provides a comprehensive survey on the emerging applications of the blockchain networks in a wide range of areas.

References

SHOWING 1-10 OF 28 REFERENCES

Speed-Security Tradeo s in Blockchain Protocols

This work investigates the tradeo between provable security and transaction processing speed viewing the latter as a function of the block generation rate, and introduces a new formal property of blockchain protocols, called chain growth, and shows it is fundamental for arguing the security of a robust transaction ledger.

Bootstrapping the Blockchain - Directly

This paper presents a bootstrapped Bitcoin-like blockchain protocol relying on POWs that builds genesis blocks from scratch in the presence of adversarial pre-computation, and considers applications of the construction, including a PKI generation protocol and a consensus protocol without trusted setup assuming an honest majority.

Distributed Cryptography Based on the Proofs of Work

A formal model for constructing distributed crypto- graphic protocols in a fully peer-to-peer scenario under the assumption that the adver- sary has limited computing power is proposed and the following protocols working in it are constructed.

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 depend

Pseudonymous Secure Computation from Time-Lock Puzzles

Taking inspiration from Bitcoin, it is shown that precise bounds on computational power can be used in place of pre-existing setup to achieve weaker (but nontrivial) notions of security.

Indistinguishable Proofs of Work or Knowledge

The introduction of a new class of protocols called Proofs of Work or Knowledge PoWorKs, which imply straight-line quasi-polynomial simulatable arguments of knowledge, and shows how it can be used to compose cryptocurrencies that are based on proofs of work "Bitcoin-like" with cryptocurrencies that is based on knowledge relations.

Security and Composition of Multiparty Cryptographic Protocols

  • R. Canetti
  • Computer Science, Mathematics
    Journal of Cryptology
  • 2000
In the computational model, this work provides the first definition of security of protocols that is shown to be preserved under composition, and follows the general paradigm of known definitions.

Resource-based corruptions and the combinatorics of hidden diversity

The notion of resource-based corruptions, where the adversary must invest some resources in order to corrupt a player, is put forth and it is shown that hidden diversity can be used to force the corruption threshold to drop from 1/2 to 1/3, in turn allowing the use of much more efficient MPC protocols.

The Bitcoin Backbone Protocol with Chains of Variable Difficulty

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.

Random oracles are practical: a paradigm for designing efficient protocols

It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security.