Kyle Croman’s research while affiliated with Cornell University and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (4)


The Honey Badger of BFT Protocols
  • Conference Paper

October 2016

·

1,240 Reads

·

785 Citations

Andrew Miller

·

Yu Xia

·

Kyle Croman

·

[...]

·

Dawn Song

The surprising success of cryptocurrencies has led to a surge of interest in deploying large scale, highly robust, Byzantine fault tolerant (BFT) protocols for mission-critical applications, such as financial transactions. Although the conventional wisdom is to build atop a (weakly) synchronous protocol such as PBFT (or a variation thereof), such protocols rely critically on network timing assumptions, and only guarantee liveness when the network behaves as expected. We argue these protocols are ill-suited for this deployment scenario. We present an alternative, HoneyBadgerBFT, the first practical asynchronous BFT protocol, which guarantees liveness without making any timing assumptions. We base our solution on a novel atomic broadcast protocol that achieves optimal asymptotic efficiency. We present an implementation and experimental results to show our system can achieve throughput of tens of thousands of transactions per second, and scales to over a hundred nodes on a wide area network. We even conduct BFT experiments over Tor, without needing to tune any parameters. Unlike the alternatives, HoneyBadgerBFT simply does not care about the underlying network.


Figure 9: Money Flow for a Delivered Request. Red arrows denote flow of money and brown arrows denote gas limits. The thickness of lines indicate the quantity of resources. The $g clbk arrow is thin because $g clbk is limited to $f − $G min .
Figure 10: Throughput on a single SGX machine. The x-axis is the number of concurrent enclaves and the y-axis is the number of tx/sec. Dashed lines indicate the ideal scaling for each application, and error bars, the standard deviation. We ran 20 rounds of experiments (each round processing 1000 transactions in parallel).
Figure 11: Components of TC Server
Town Crier: An Authenticated Data Feed for Smart Contracts
  • Conference Paper
  • Full-text available

October 2016

·

2,447 Reads

·

656 Citations

Smart contracts are programs that execute autonomously on blockchains. Their key envisioned uses (e.g. financial instruments) require them to consume data from outside the blockchain (e.g. stock quotes). Trustworthy data feeds that support a broad range of data requests will thus be critical to smart contract ecosystems. We present an authenticated data feed system called Town Crier (TC). TC acts as a bridge between smart contracts and existing web sites, which are already commonly trusted for non-blockchain applications. It combines a blockchain front end with a trusted hardware back end to scrape HTTPS-enabled websites and serve source-authenticated data to relying smart contracts. TC also supports confidentiality. It enables private data requests with encrypted parameters. Additionally, in a generalization that executes smart-contract logic within TC, the system permits secure use of user credentials to scrape access-controlled online data sources. We describe TC's design principles and architecture and report on an implementation that uses Intel's recently introduced Software Guard Extensions (SGX) to furnish data to the Ethereum smart contract system. We formally model TC and define and prove its basic security properties in the Universal Composibility (UC) framework. Our results include definitions and techniques of general interest relating to resource consumption (Ethereum's "gas" fee system) and TCB minimization. We also report on experiments with three example applications. We plan to launch TC soon as an online public service.

Download

Fig. 1: Network propagation rate (capturing both latency and throughput) vs. block size.  
On Scaling Decentralized Blockchains (A Position Paper)

February 2016

·

6,399 Reads

·

159 Citations

The increasing popularity of blockchain-based cryptocurrencies has made scalability a primary and urgent concern. We analyze how fundamental and circumstantial bottlenecks in Bitcoin limit the ability of its current peer-to-peer overlay network to support substantially higher throughputs and lower latencies. Our results suggest that reparameterization of block size and intervals should be viewed only as a first increment toward achieving next-generation, high-load blockchain protocols, and major advances will additionally require a basic rethinking of technical approaches. We offer a structured perspective on the design space for such approaches. Within this perspective, we enumerate and briefly discuss a number of recently proposed protocol ideas and offer several new ideas and open challenges.


On Scaling Decentralized Blockchains

February 2016

·

1,871 Reads

·

1,183 Citations

Lecture Notes in Computer Science

The increasing popularity of blockchain-based cryptocurrencies has made scalability a primary and urgent concern. We analyze how fundamental and circumstantial bottlenecks in Bitcoin limit the ability of its current peer-to-peer overlay network to support substantially higher throughputs and lower latencies. Our results suggest that reparameterization of block size and intervals should be viewed only as a first increment toward achieving next-generation, high-load blockchain protocols, and major advances will additionally require a basic rethinking of technical approaches. We offer a structured perspective on the design space for such approaches. Within this perspective, we enumerate and briefly discuss a number of recently proposed protocol ideas and offer several new ideas and open challenges.

Citations (4)


... In this work, we aim to formalise the model of GPUs with Byzantine faults and explore the problems that can be solved within this framework. Consensus is one of the problems that is being extensively studied in message passing [4,7,16,19] and shared memory [1,2,18]. Diverse researchers have approached the Byzantine consensus problem in shared memory systems in various ways. ...

Reference:

Byzantine-Tolerant Consensus in GPU-Inspired Shared Memory
The Honey Badger of BFT Protocols
  • Citing Conference Paper
  • October 2016

... Bitcoin [1] is the oldest and consistently the highest valued blockchain. However, despite its value and prominence, it faces severe scalability issues [2] both in terms of throughput and of latency: it natively supports only up to 7 transactions per second and requires 1 hour from transaction submission to its verification. ...

On Scaling Decentralized Blockchains
  • Citing Conference Paper
  • February 2016

Lecture Notes in Computer Science

... Despite these advantages, traditional blockchain systems like Bitcoin face considerable scalability challenges due to their inefficiencies and high energy consumption [4]. For instance, Bitcoin's average transaction throughput of only seven transactions per second is inadequate for high-performance transactional services [5]. ...

On Scaling Decentralized Blockchains (A Position Paper)