activity
20212026
collaborators

6 papers

cs.DC2026

The Consensus Number of Untraceable Cryptocurrencies

Christian Cachin, David Lehnherr, Juan Villacis +1

Sender untraceability hides the account spent by a cryptocurrency transfer among a set of candidates, its masking set. What a transfer does to that set separates two designs: class…

cs.DC2026

An Epistemic Analysis of Random Coordinated Attack

Sophia Knight, David Lehnherr, Sergio Rajsbaum

The coordinated attack problem models the challenge of coordinating a joint action within a bounded time by communicating over unreliable links. It was the first distributed comput…

cs.LO2026

Simplicial Belief

Christian Cachin, David Lehnherr, Thomas Studer

Recently, much work has been carried out to study simplicial interpretations of modal logic. While notions of (distributed) knowledge have been well investigated in this context, i…

cs.LO2025

Hypergraph Semantics for Doxastic Logics

Hans van Ditmarsch, Djanira Gomes, David Lehnherr +2

Simplicial models have become a crucial tool for studying distributed computing. These models, however, are only able to account for the knowledge, but not for the beliefs of agent…

cs.LO2024

Synergistic Knowledge

Christian Cachin, David Lehnherr, Thomas Studer

In formal epistemology, group knowledge is often modelled as the knowledge that the group would have, if the agents shared all their individual knowledge. However, this interpretat…

cs.LO2021

A logic of interactive proofs

David Lehnherr, Zoran Ognjanovic, Thomas Studer

We introduce the probabilistic two-agent justification logic IPJ, a logic in which we can reason about agents that perform interactive proofs. In order to study the growth rate of…