Back to Results
First PageMeta Content
Fault-tolerant computer systems / Consensus / Bitcoin / Stochastic processes / Markov processes / Distributed algorithm / Poisson process / Peer-to-peer / Byzantine fault tolerance / Statistics / Computing / Probability and statistics


Anonymous Byzantine Consensus from Moderately-Hard Puzzles: A Model for Bitcoin Andrew Miller University of Central Florida Abstract—We present a formal model of synchronous processes
Add to Reading List

Document Date: 2014-04-23 23:25:18


Open Document

File Size: 274,00 KB

Share Result on Facebook

City

New York / Washington / DC / Las Vegas / Berlin / Amherst / New Haven / /

Company

Distributed Systems / Cambridge University Press / eBay / Distributed Computing Systems / Bitcoin / Kendall / SIAM Journal / Distributed Security Systems / PPENDIX / M. J. Fischer N. a. / /

Country

United States / /

/

Event

Product Recall / Product Issues / FDA Phase / /

Facility

University of Central / Bitcoin Andrew Miller University of Central / Massachusetts Institute of Technology / University of Massachusetts Amherst / Yale University / /

IndustryTerm

processor coordination using asynchronous hardware / actual network / online certification authority / large scale networks / agreement protocols / overall computing power / synchronous processors / large public peer-to-peer network / wide public network / actual peer-to-peer network / anonymous public networks / large networks / wide transaction processor / anonymous networks / eponymous networks / correct network / transaction processing system / nµ network / Internet transactions / authenticated communications channels / xth puzzle solution / anonymous network / communications latency / consensus protocols / anonymous message passing networks / relative computing power / puzzle solutions / trivial protocol / larger network / anonymous peer-to-peer networks / correct protocol / internet commerce / deterministic asynchronous networks / public peer-to-peer network / puzzle solution / mining / computing / distinct puzzle solutions / 2x puzzle solutions / asynchronous agreement protocols / large scale public network / successive solutions / anonymous shared-memory systems / consensus protocol / mutable file systems / /

Organization

Cambridge University / University of Massachusetts Amherst / Massachusetts Institute of Technology / Yale University / Department of Computer Science / University of Central Florida / Smithsonian / IEEE Computer Society / Technion / /

Person

Satoshi Nakamoto / R. Van Renesse / F. B. Schneider / L. Zhou / Moderately-Hard Puzzles / Joseph J. LaViola / Jr. / /

Position

King / Model / Model for Florida amiller@cs.ucf.edu Abstract / /

Product

A PPENDIX / Prefer0 / process / processes / B0 / /

ProgrammingLanguage

Erlang / DC / /

ProvinceOrState

Connecticut / Massachusetts / /

PublishedMedium

Journal of the ACM / IEEE Transactions on Software Engineering / SIAM Journal on Computing / Communications of the ACM / Lecture Notes in Computer Science / /

Region

Central Florida / /

Technology

consensus protocols / Byzantine Agreement Algorithm / peer-to-peer / Security Protocols / correct protocol / Shared Memory / Monte Carlo protocol / consensus protocol / cryptography / trivial protocol / public key / Monte Carlo consensus protocol / Byzantine consensus protocol / Byzantine agreement protocols / timed-release encryption / Completely asynchronous agreement protocols / wide transaction processor / determined using public key cryptography / /

URL

http /

SocialTag