From the 1 of 14 linked papers with an AI index.
14 papers
Finality Before Disclosure for Ledger Authenticators in the Quantum Random Oracle Model
Maja Lie, Benjamin Marsh
Public ledgers increasingly authorize state transitions using prior transactions, finalized state, timing, and ordering rather than only a public key, message, and portable signatu…
Cyclic Shuffle Groups: Universal Two-Transitivity and Complete Classification
Benjamin Marsh
Let \(k\geq 3\), \(n\geq 1\), and let \(H_{k,n}=\Sh(C_k,n)\) be the group generated by the standard \(k\) pile perfect shuffle and cyclic pile permutation on a deck of \(kn\) cards…
Hermes: Low Tail-Latency Via Prefix Consensus
Alejandro Ranchal-Pedrosa, Dakai Kang, Neil Giridharan +3
Leader-based BFT protocols finalize through their leaders: a view whose leader is crashed or slow finalizes nothing, and the timeout that ends it admits no good setting. A conserva…
Reveal, Correct, Then Pay: Encrypted Mempools and Perpetual Funding Security
Benjamin Marsh
The paper analyzes how encrypted mempools, which hide transaction details until ordering, can be exploited by attackers who manipulate state they control, focusing on perpetual fut…
Slack and Budget Breaking in Threshold Team Production
Benjamin Marsh, Alejandro Ranchal-Pedrosa
A threshold system completes a public task only after verifiable shares are publicly committed. If the honest schedule creates \( \Nstar=κ+Î\) share opportunities by deadlin…
Ambulance: saving BFT through racing
Neil Giridharan, Shubham Mishra, Lorenzo Alvisi +5
Today's practical Byzantine Fault Tolerant (BFT) state machine replication deployments are vulnerable to slowdowns. The main culprit is timeouts. Aggressive timeouts spuriously tri…