A Structural Analysis of Bitcoin

No abstract is available for this paper.

• Publication year

  2012

• Venue

  GI-Jahrestagung

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Financial Black Swans Driven by Ultrafast Machine Ecology

  2012cited by this paper
• Formal Verification of Consensus Algorithms Tolerating Malicious Faults

  2011cited by this paper
• Scalable byzantine computation

  2010cited by this paper
• Asynchronous Byzantine consensus with 2f+1 processes

  2009cited by this paper
• A simple totally ordered broadcast protocol

  2008cited by this paper
• An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience

  2008cited by this paper
• Fast asynchronous byzantine agreement and leader election with full information

  2008cited by this paper
• Agreement and consistency without knowing the number of processes

  2008cited by this paper
• An offline foundation for online accountable pseudonyms

  2008cited by this paper
• The "art" of programming gossip-based systems

  2007cited by this paper
• Game Theory: Decisions, Interaction and Evolution

  2006cited by this paper
• Quiescent consensus in mobile ad-hoc networks using eventually storage-free broadcasts

  2006cited by this paper
• Evolutionary games on graphs

  2006cited by this paper
• A Survey of Identity-Based Cryptography

  2004cited by this paper
• Total order broadcast and multicast algorithms: Taxonomy and survey

  2003cited by this paper
• A Calculus of Distributed and Parallel Processes

  2000cited by this paper
• Bounded rationality: The adaptive toolbox

  2000cited by this paper
• A distributed trust model

  1998cited by this paper
• An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time

  1996cited by this paper
• Algebraic Specification

  1991cited by this paper
• An O(log n) expected rounds randomized byzantine generals protocol

  1987cited by this paper
• Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

  1983cited by this paper
• On the minimal synchronism needed for distributed consensus

  1983cited by this paper

• BYZANTINE CONSENSUS THROUGH BITCOIN ’ S PROOF-OF-WORK

  2017cites this paper