• Publications
  • Influence
OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding
OmniLedger ensures security and correctness by using a bias-resistant public-randomness protocol for choosing large, statistically representative shards that process transactions, and by introducing an efficient cross-shard commit protocol that atomically handles transactions affecting multiple shards. Expand
Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing
This paper introduces ByzCoin, a novel Byzantine consensus protocol that leverages scalable collective signing to commit Bitcoin transactions irreversibly within seconds, and achieves a throughput higher than PayPal currently handles, with a confirmation latency of 15-20 seconds. Expand
Parsing expression grammars: a recognition-based syntactic foundation
  • B. Ford
  • Computer Science
  • POPL '04
  • 14 January 2004
PEGs address frequently felt expressiveness limitations of CFGs and REs, simplifying syntax definitions and making it unnecessary to separate their lexical and hierarchical components, and are here proven equivalent in effective recognition power. Expand
Peer-to-Peer Communication Across Network Address Translators
This paper documents and analyzes one of the simplest but most robust and practical NAT traversal techniques, commonly known as hole punching, and shows how it can be reliably used to set up peer-to-peer TCP streams as well. Expand
Dissent: accountable anonymous group messaging
The protocol preserves message integrity and one-to-one correspondence between members and messages, makes denial-of-service attacks by members traceable to the culprit, and efficiently handles large, unbalanced message loads. Expand
Maple: simplifying SDN programming using algorithmic policies
To implement algorithmic policies efficiently, Maple includes not only a highly-efficient multicore scheduler that can scale efficiently to controllers with 40+ cores, but more importantly a novel tracing runtime optimizer that can automatically record reusable policy decisions, offload work to switches when possible, and keep switch flow tables up-to-date. Expand
Dissent in Numbers: Making Strong Anonymity Scale
Novel techniques are developed in Dissent, a practical group anonymity system, to increase by over two orders of magnitude the scalability of strong, traffic analysis resistant approaches. Expand
Packet parsing : a practical linear-time algorithm with backtracking
Three different packrat Parsers for the Java language are presented here, demonstrating the construction of packrat parsers in Haskell using primitive pattern matching, using monadic combinators, and by automatic generation from a declarative parser specification. Expand
Keeping Authorities "Honest or Bust" with Decentralized Witness Cosigning
CoSi, a scalable witness cosigning protocol ensuring that every authoritative statement is validated and publicly logged by a diverse group of witnesses before any client will accept it, is introduced, offering the first transparency mechanism effective against persistent man-in-the-middle attackers. Expand
Scalable Bias-Resistant Distributed Randomness
This paper proposes two large-scale distributed protocols, RandHound and RandHerd, which provide publicly-verifiable, unpredictable, and unbiasable randomness against Byzantine adversaries. Expand