activity
20232026
most citedModel Checking and Synthesis for Optimal Use of Knowledge in Consensus Protocols

1 citations · 2 across the 6 of their papers we have counts for

collaborators

9 papers

cs.DC2026

Beyond Leaderless: Randomized Consensus Against Mobile Crashes

Ittai Abraham, Kaya Alpturer, Pranav Garimidi +3

Many consensus protocols fail to terminate under attack from an adversary that has the power to move between replicas and repeatedly crash one of them, even in synchrony. We presen…

cs.GT2026

RANDAO Manipulation in the Presence of MEV

Kaya Alpturer, Nicholas Hope, S. Matthew Weinberg

Ethereum's randomness beacon (RANDAO) is well-known to be manipulable, and prior work [AW24] computes the precise fraction of blocks a strategic proposer can propose. The fraction…

cs.CR2026

AetherWeave: Sybil-Resistant Robust Peer Discovery with Stake

Kaya Alpturer, Constantine Doumanidis, Aviv Zohar

Peer-discovery protocols within P2P networks are often vulnerable: because creating network identities is essentially free, adversaries can eclipse honest nodes or partition the ov…

cs.DC2025★ 1 cited

Optimality of Simultaneous Consensus with Limited Information Exchange (Extended Abstract)

Kaya Alpturer, Ron van der Meyden, Sushmita Ruj +1

Work on the development of optimal fault-tolerant Agreement protocols using the logic of knowledge has concentrated on the "full information" approach to information exchange, whic…

cs.GT2025

Timing Games in Responsive Consensus Protocols

Kaya Alpturer, Kushal Babel, Aditya Saraf

Optimistic responsiveness -- the ability of a consensus protocol to operate at the speed of the network -- is widely used in consensus protocol design to optimize latency and throu…

cs.DC2025★ 1 cited

Model Checking and Synthesis for Optimal Use of Knowledge in Consensus Protocols

Kaya Alpturer, Gerald Huang, Ron van der Meyden

Logics of knowledge and knowledge-based programs provide a way to give abstract descriptions of solutions to problems in fault-tolerant distributed computing, and have been used to…

cs.GT2024

Optimal RANDAO Manipulation in Ethereum

Kaya Alpturer, S. Matthew Weinberg

It is well-known that RANDAO manipulation is possible in Ethereum if an adversary controls the proposers assigned to the last slots in an epoch. We provide a methodology to compute…

cs.DC2024

A Knowledge-Based Analysis of Intersection Protocols

Kaya Alpturer, Joseph Y. Halpern, Ron van der Meyden

The increasing wireless communication capabilities of vehicles creates opportunities for more efficient intersection management strategies. One promising approach is the replacemen…

cs.DC2023

Optimal Eventual Byzantine Agreement Protocols with Omission Failures

Kaya Alpturer, Joseph Y. Halpern, Ron van der Meyden

Work on \emph{optimal} protocols for \emph{Eventual Byzantine Agreement} (EBA) -- protocols that, in a precise sense, decide as soon as possible in every run and guarantee that all…