activity
20182023
most citedAnalysis of the Matrix Event Graph Replicated Data Type

12 citations · 27 across the 11 of their papers we have counts for

collaborators

13 papers

cs.LO2023★ 2 cited

Towards a Formal Verification of the Lightning Network with TLA+

Matthias Grundmann, Hannes Hartenstein

Payment channel networks are an approach to improve the scalability of blockchain-based cryptocurrencies. Because payment channel networks are used for transfer of financial value,…

cs.DC2023★ 2 cited

Let It TEE: Asynchronous Byzantine Atomic Broadcast with

Marc Leinweber, Hannes Hartenstein

Asynchronous Byzantine Atomic Broadcast (ABAB) promises simplicity in implementation as well as increased performance and robustness in comparison to partially synchronous approach…

cs.DC2023★ 1 cited

On Extend-Only Directed Posets and Derived Byzantine-Tolerant Replicated Data Types (Extended Version)

Florian Jacob, Hannes Hartenstein

We uncover the extend-only directed posets (EDP) structure as a unification of recently discussed DAG-based Byzantine-tolerant conflict-free replicated data types (CRDT). We also s…

cs.DC2021★ 2 cited

On Conflict-Free Replicated Data Types and Equivocation in Byzantine Setups

Florian Jacob, Saskia Bayreuther, Hannes Hartenstein

We explore the property of equivocation tolerance for Conflict-Free Replicated Data Types (CRDTs). We show that a subclass of CRDTs is equivocation-tolerant and can thereby cope wi…

cs.NI2021

Estimating the Peer Degree of Reachable Peers in the Bitcoin P2P Network

Matthias Grundmann, Max Baumstark, Hannes Hartenstein

A recent spam wave of IP addresses in the Bitcoin P2P network allowed us to estimate the degree distribution of reachable peers in the network. The resulting distribution shows tha…

cs.CR2021★ 4 cited

ETHTID: Deployable Threshold Information Disclosure on Ethereum

Oliver Stengele, Markus Raiber, Jörn Müller-Quade +1

We address the Threshold Information Disclosure (TID) problem on Ethereum: An arbitrary number of users commit to the scheduled disclosure of their individual messages recorded on…

cs.NI2021

Advancing Protocol Diversity in Network Security Monitoring

Jan Grashöfer, Peter Oettig, Robin Sommer +2

With information technology entering new fields and levels of deployment, e.g., in areas of energy, mobility, and production, network security monitoring needs to be able to cope w…

cs.CR2021★ 3 cited

On the Estimation of the Number of Unreachable Peers in the Bitcoin P2P Network by Observation of Peer Announcements

Matthias Grundmann, Hedwig Amberg, Hannes Hartenstein

Bitcoin is based on a P2P network that is used to propagate transactions and blocks. While the P2P network design intends to hide the topology of the P2P network, information about…

cs.DC2020★ 12 cited

Analysis of the Matrix Event Graph Replicated Data Type

Florian Jacob, Carolin Beer, Norbert Henze +1

Matrix is a new kind of decentralized, topic-based publish-subscribe middleware for communication and data storage that is getting popular particularly as a basis for secure instan…

cs.CR2020★ 1 cited

Fundamental Properties of the Layer Below a Payment Channel Network (Extended Version)

Matthias Grundmann, Hannes Hartenstein

Payment channel networks are a highly discussed approach for improving scalability of cryptocurrencies such as Bitcoin. As they allow processing transactions off-chain, payment cha…

cs.NI2019

Attacks on Dynamic Protocol Detection of Open Source Network Security Monitoring Tools

Jan Grashöfer, Christian Titze, Hannes Hartenstein

Protocol detection is the process of determining the application layer protocol in the context of network security monitoring, which requires a timely and precise decision to enabl…

cs.NI2019

A Glimpse of the Matrix (Extended Version): Scalability Issues of a New Message-Oriented Data Synchronization Middleware

Florian Jacob, Jan Grashöfer, Hannes Hartenstein

Matrix is a new message-oriented data synchronization middleware, used as a federated platform for near real-time decentralized applications. It features a novel approach for inter…

cs.PF2018

Enabling Cross-Event Optimization in Discrete-Event Simulation Through Compile-Time Event Batching

Marc Leinweber, Hannes Hartenstein, Philipp Andelfinger

A discrete-event simulation (DES) involves the execution of a sequence of event handlers dynamically scheduled at runtime. As a consequence, a priori knowledge of the control flow…