activity
20122023
most citedSome Garbage In - Some Garbage Out: Asynchronous t-Byzantine as Asynchronous Benign t-resilient system with fixed t-Trojan-Horse Inputs

5 citations · 10 across the 8 of their papers we have counts for

collaborators

8 papers

cs.DS2023

Synchrony/Asynchrony vs. Stationary/Mobile? The Latter is Superior...in Theory

Eli Gafni, Vasileios Zikas

Like Asynchrony, Mobility of faults precludes consensus. Yet, a model M in which Consensus is solvable, has an analogue relaxed model in which Consensus is not solvable and for whi…

cs.DC2016

Byzantine Processors and Cuckoo Birds: Confining Maliciousness to the Outset

Danny Dolev, Eli Gafni

Are there Byzantine Animals? A Fooling Behavior is exhibited by the Cuckoo bird. It sneakily replaces some of the eggs of other species with its own. Lest the Cuckoo extinct itself…

cs.DC20161 cited

Read-Write Memory and k-Set Consensus as an Affine Task

Eli Gafni, Yuan He, Petr Kuznetsov +1

The wait-free read-write memory model has been characterized as an iterated \emph{Immediate Snapshot} (IS) task. The IS task is \emph{affine}---it can be defined as a (sub)set of s…

cs.DC20165 cited

Some Garbage In - Some Garbage Out: Asynchronous t-Byzantine as Asynchronous Benign t-resilient system with fixed t-Trojan-Horse Inputs

Danny Dolev, Eli Gafni

We show that asynchronous faults Byzantine system is equivalent to asynchronous -resilient system, where unbeknownst to all, the private inputs of at most processors wer…

cs.DC20144 cited

Snapshot for Time: The One-Shot Case

Eli Gafni

We show that for one-shot problems - problems where a processor executes a single operation-execution - timing constraints can be captured by conditions on the relation between ori…

cs.DC2014

Set Consensus: Captured by a Set of Runs with Ramifications

Eli Gafni

Are (set)-consensus objects necessary? This paper answer is negative. We show that the availability of consensus objects can be replaced by restricting the set of runs we consider.…