A Secure Sharding Protocol For Open Blockchains

Luu, Loi; Narayanan, Viswesh; Zheng, Chaodong; Baweja, Kunal; Gilbert, Seth; Saxena, Prateek

doi:10.1145/2976749.2978389

Cited by 994 publications

(621 citation statements)

References 27 publications

Supporting

Mentioning

613

Contrasting

Unclassified

Order By: Relevance

“…To achieve security in this setting, known consensus protocols rely on proofs-of-work to defeat Sybil attacks, and pay an enormous price in terms of throughput and latency, e.g., Bitcoin commits transactions every ∼ 10 min, and its throughput limited by 7 tx/sec even when the current block size is maximized. Several recent works have suggested the promising idea of leveraging either a slower, external blockchain such as Bitcoin or economic "proof-of-stake" assumptions involving the underlying currency itself [32,32,35,37] to bootstrap faster BFT protocols, by selecting a random committee to perform BFT in every different epoch. These approaches promise to achieve the best of both worlds, security in an open enrollment, decentralized network, and the throughput and response time matching classical BFT protocols.…”

Section: Suggested Deployment Scenariosmentioning

confidence: 99%

The Honey Badger of BFT Protocols

Miller

Xia

Croman

et al. 2016

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

518

374

View full text Add to dashboard Cite

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.

show abstract

Section: Suggested Deployment Scenariosmentioning

confidence: 99%

The Honey Badger of BFT Protocols

Miller

Xia

Croman

et al. 2016

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

518

374

View full text Add to dashboard Cite

show abstract

“…Another approach [9][10][11] is known to be used in database control systems -horizontal scaling of data storage (sharding). In this approach it is proposed to divide data stored in blockchain between several nodes.…”

Section: Review Of Literaturementioning

confidence: 99%

Supporting connectivity of VANET/MANET network nodes and elastic software-configurable security services using blockchain with floating genesis block

2018

View full text Add to dashboard Cite

Abstract. This paper considers the tasks of supporting the connectivity of nodes in communication networks of unmanned transport (VANET/MANET-networks). High dynamics, decentralization and absence of hierarchy in the networks of this type actualize the task of supporting the connectivity of nodes with software-configurable security services, providing the network protection. It is offered to use a Blockchain technology based system for VANET/MANET network topologyand authentication data distribution and storage. The issue of unlimited blockchain growth preventing this method from being implemented in VANET/MANET networks is considered. The existing solutions of this issueare analyzed and drawbacks are identified. A notion of blockchain with floating genesis block is introduced and its advantages over similar ideas are demonstrated thus allowing it to be used to resolve the issue of continuously growing blockchain within the systems with stalingtransactions as a whole and in VANET/MANET networks in particular.

show abstract

“…A Merkle tree in our case allows all hashes of all data elements in an event to be stored in a single hash value (the Merkle root) (Luu et al 2015). Furthermore, it allows for a simple proof of the existence of a data element in the tree (Luu et al 2015;Merkle 1987).…”

Section: The Data Elements In Events and Their Merkle Treesmentioning

confidence: 99%

Design of a software architecture supporting business-to-government information sharing to improve public safety and security

2017

View full text Add to dashboard Cite

To ensure public safety and security, it is vitally important for governments to collect information from businesses and analyse it. Such information can be used to determine whether transported goods might be suspicious and therefore require physical inspection. Although businesses are obliged to report some information, they are reluctant to share additional information for fear of sharing competitively sensitive information, becoming liable and not being compliant with the law. These reasons are often overlooked in the design of software architectures for information sharing. In the present research, we followed a design science approach to develop a software architecture for business-to-government information sharing. Based on literature and a case study, we elicited the requirements an architecture that provides for the sharing of information should meet to make it acceptable to businesses. We then developed the architecture and evaluated it against the requirements. The architecture consists of a blockchain that stores events and rules for information sharing that are controlled by businesses. For each event, two parties use their private keys to encrypt its Merkle root to confirm that they know the data are correct. This makes it easy to check whether information is reliable and whether an event should be accepted. Access control, metadata and context information enable the context-based sharing of information. This is combined with the encryption and decryption of data to provide access to certain data within an organisation. Sélinde van Engelenburg

show abstract

A Secure Sharding Protocol For Open Blockchains

Cited by 994 publications

References 27 publications

The Honey Badger of BFT Protocols

The Honey Badger of BFT Protocols

Supporting connectivity of VANET/MANET network nodes and elastic software-configurable security services using blockchain with floating genesis block

Design of a software architecture supporting business-to-government information sharing to improve public safety and security

Contact Info

Product

Resources

About