2 citations · 5 across the 7 of their papers we have counts for
15 papers
Fully Fluctuating Sleepy Consensus from Minimal Assumptions
Javier Nieto, Yuval Efron, Joachim Neu +1
Bitcoin's proof-of-work (PoW)-based protocol is remarkable for how little it asks of its participants. Not only can miners take breaks from work whenever they please, but it is alm…
Settling The Round Complexity of Byzantine Agreement Against a Full-Information, Adaptive Adversary
Yuval Efron
We prove that every randomized synchronous Byzantine Agreement protocol in the full-information, strongly adaptive adversary model, secure against corrupt parties, has worst-ca…
Optimal Good-Case Latency for Sleepy Consensus
Yuval Efron, Joachim Neu, Ling Ren +1
In the context of Byzantine consensus problems such as Byzantine broadcast (BB) and Byzantine agreement (BA), the good-case setting aims to study the minimal possible latency of a…
A Simple Algorithm for Dynamic Carpooling with Recourse
Yuval Efron, Shyamal Patel, Cliff Stein
We give an algorithm for the fully-dynamic carpooling problem with recourse: Edges arrive and depart online from a graph with nodes according to an adaptive adversary. Our…
Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement
Daniel Collins, Yuval Efron, Jovan Komatovic
It is well known that a trusted setup allows one to solve the Byzantine agreement problem in the presence of corruptions, bypassing the setup-free barrier. Alas, th…
Mechanism Design for Automated Market Makers
T-H. Hubert Chan, Ke Wu, Elaine Shi
Blockchains have popularized automated market makers (AMMs). An AMM exchange is an application running on a blockchain which maintains a pool of crypto-assets and automatically tra…