6 papers · 1 filter
Location-Aware Dispersion on Anonymous Graphs
Himani, Supantha Pandit, Gokarna Sharma
The well-studied DISPERSION problem is a fundamental coordination problem in distributed robotics, where a set of mobile robots must relocate so that each occupies a distinct node…
When Can You Trust Bitcoin? Value-Dependent Block Confirmation to Determine Transaction Finalit
Ethan Hicks, Joseph Oglio, Mikhail Nesterenko +1
We study financial transaction confirmation finality in Bitcoin as a function of transaction amount and user risk tolerance. A transaction is recorded in a block on a blockchain. H…
SmartShards: Churn-Tolerant Continuously Available Distributed Ledger
Joseph Oglio, Mikhail Nesterenko, Gokarna Sharma
We present SmartShards: a new sharding algorithm for improving Byzantine tolerance and churn resistance in blockchains. Our algorithm places a peer in multiple shards to create an…
Consensus Through Knot Discovery in Asynchronous Dynamic Networks
Rachel Bricker, Mikhail Nesterenko, Gokarna Sharma
We state the Problem of Knot Identification as a way to achieve consensus in dynamic networks. The network adversary is asynchronous and not oblivious. The network may be disconnec…
TRAIL: Cross-Shard Validation for Cryptocurrency Byzantine Shard Protection
Mitch Jacovetty, Joseph Oglio, Mikhail Nesterenko +1
We present TRAIL: an algorithm that uses a novel consensus procedure to tolerate failed or malicious shards within a blockchain-based cryptocurrency. Our algorithm takes a new appr…
BeRGeR: Byzantine-Robust Geometric Routing
Brown Zaz, Mikhail Nesterenko, Gokarna Sharma
We present BeRGeR: the first asynchronous geometric routing algorithm that guarantees delivery of a message despite a Byzantine fault without relying on cryptographic primitives or…