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… Expand
Coin.AI: A Proof-of-Useful-Work Scheme for Blockchain-Based Distributed Deep Learning
TLDR
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. Expand
Lay Down the Common Metrics: Evaluating Proof-of-Work Consensus Protocols' Security
TLDR
It is concluded that to date, no PoW protocol achieves ideal chain quality or is resistant against all three attacks, and a multi-metric evaluation framework is introduced to quantitatively analyze PoW protocols' chain quality and attack resistance. Expand
Moderately Hard Functions: Definition, Instantiations, and Applications
TLDR
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. Expand
Astrolabous: A Universally Composable Time-Lock Encryption Scheme
TLDR
Any secure TLE construction adopting the techniques of Nielsen [CRYPTO 2002] in the random oracle model is extended, allowing the simulator to equivocate and this extension can be applied to any TLE algorithm that satisfies the authors' standalone game-based security definition. Expand
Verify-Your-Vote: A Verifiable Blockchain-Based Online Voting Protocol
TLDR
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. Expand
SoK: A Consensus Taxonomy in the Blockchain Era
TLDR
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. Expand
Topics in Cryptology – CT-RSA 2020: The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings
TLDR
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. Expand
Foundations, Properties, and Security Applications of Puzzles: A Survey
TLDR
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. Expand
Agreement with Satoshi - On the Formalization of Nakamoto Consensus
TLDR
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. Expand
Foundations, Properties, and Security Applications of Puzzles
TLDR
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. Expand
...
1
2
...

References

SHOWING 1-10 OF 28 REFERENCES
Bootstrapping the Blockchain - Directly
TLDR
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. Expand
Distributed Cryptography Based on the Proofs of Work
TLDR
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. 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
Pseudonymous Secure Computation from Time-Lock Puzzles
TLDR
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. Expand
Indistinguishable Proofs of Work or Knowledge
TLDR
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. Expand
Security and Composition of Multiparty Cryptographic Protocols
  • R. Canetti
  • Computer Science, Mathematics
  • Journal of Cryptology
  • 2000
TLDR
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. Expand
Resource-based corruptions and the combinatorics of hidden diversity
TLDR
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. 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
Random oracles are practical: a paradigm for designing efficient protocols
TLDR
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. Expand
On Stake and Consensus
In 2009, Satoshi Nakamoto introduced the Bitcoin cryptocurrency[Nak09], an online currency system which allowed peer-to-peer transfer of digital tokens. To ensure a consistent view of tokenExpand
...
1
2
3
...