3 citations · 14 across the 23 of their papers we have counts for
8 papers · 1 filter
Recoverable Lock-Free Locks
Hagit Attiya, Panagiota Fatourou, Eleftherios Kosmas +1
This paper presents the first transformation that introduces both lock-freedom and recoverability. Our transformation starts with a lock-based implementation, and provides a recove…
Equivalence and Separation between Heard-Of and Asynchronous Message-Passing Models
Hagit Attiya, Armando Castañeda, Dhrubajyoti Ghosh +1
We revisit the relationship between two fundamental models of distributed computation: the asynchronous message-passing model with up to crash failures ()…
Arbitration-Free Consistency is Available (and Vice Versa)
Hagit Attiya, Constantin Enea, Enrique Román-Calvo
The fundamental tension between availability and consistency shapes the design of distributed storage systems. Classical results capture extreme points of this trade-off: the CAP t…
Why Canonical Rounds Fail for Optimal Byzantine Resilience
Hagit Attiya, Itay Flam, Jennifer L. Welch
Canonical asynchronous rounds are a widely used abstraction for structuring distributed algorithms, making asynchronous executions appear synchronous and enabling modular reasoning…
Auditable Shared Objects: From Registers to Synchronization Primitives
Hagit Attiya, Antonio Fernández Anta, Alessia Milani +2
Auditability allows to track operations performed on a shared object, recording who accessed which information. This gives data owners more control on their data. Initially studied…
Impossibility Results for Strong Linearizability: The Difficulty of Consistent Refereeing
Hagit Attiya, Armando Castañeda, Constantin Enea
This paper studies the relation between agreement and strongly linearizable implementations of various objects. This leads to new results about implementations of concurrent object…
Auditing without Leaks Despite Curiosity
Hagit Attiya, Antonio Fernández Anta, Alessia Milani +2
\textit{Auditing} data accesses helps preserve privacy and ensures accountability by allowing one to determine who accessed (potentially sensitive) information. A prior formal defi…
History-Independent Concurrent Hash Tables
Hagit Attiya, Michael A. Bender, Martín Farach-Colton +2
A history-independent data structure does not reveal the history of operations applied to it, only its current logical state, even if its internal state is examined. This paper stu…