Publications by Matej Pavlovic

The consensus number of a cryptocurrency (vol 35, pg 1, 2022)

Rachid Guerraoui, Dragos-Adrian Seredinschi, Matej Pavlovic, Matteo Monti

SPRINGER2022

The consensus number of a cryptocurrency (extended version)

Rachid Guerraoui, Dragos-Adrian Seredinschi, Matej Pavlovic, Matteo Monti

Many blockchain-based algorithms, such as Bitcoin, implement a decentralized asset transfer system, often referred to as a cryptocurrency. As stated in the original paper by Nakamoto, at the heart of these systems lies the problem of preventing double-spen ...

SPRINGER2022

Online Payments by Merely Broadcasting Messages

Rachid Guerraoui, Jovan Komatovic, Dragos-Adrian Seredinschi, Matej Pavlovic, Daniel Patrick Collins, Matteo Monti, Athanasios Xygkis, Andrei Tonkikh

We address the problem of online payments, where users can transfer funds among themselves. We introduce Astro, a system solving this problem efficiently in a decentralized, deterministic, and completely asynchronous manner. Astro builds on the insight tha ...

IEEE2020

The Fake News Vaccine

Rachid Guerraoui, Willy Zwaenepoel, Anne-Marie Kermarrec, Alexandre David Olivier Maurer, Matej Pavlovic, Oana Maria Balmau

While spreading fake news is an old phenomenon, today social media enables misinformation to instantaneously reach millions of people. Content-based approaches to detect fake news, typically based on automatic text checking, are limited. It is indeed diffi ...

2019

The Consensus Number of a Cryptocurrency

Rachid Guerraoui, Dragos-Adrian Seredinschi, Matej Pavlovic, Matteo Monti

Many blockchain-based algorithms, such as Bitcoin, implement a decentralized asset transfer system, often referred to as a cryptocurrency. As stated in the original paper by Nakamoto, at the heart of these systems lies the problem of preventing double-spen ...

ASSOC COMPUTING MACHINERY2019

Scalable Byzantine Reliable Broadcast

Rachid Guerraoui, Dragos-Adrian Seredinschi, Matej Pavlovic, Matteo Monti

Byzantine reliable broadcast is a powerful primitive that allows a set of processes to agree on a message from a designated sender, even if some processes (including the sender) are Byzantine. Existing broadcast protocols for this setting scale poorly, as ...

Schloss Dagstuhl--Leibniz-Zentrum fer Informatik2019

Scaling Byzantine Fault Tolerance

Matej Pavlovic

Online services are becoming more and more ubiquitous and keep growing in scale. At the same time, they are required to be highly available, secure, energy-efficient, and to achieve high performance. To ensure these (and many other) properties, replication ...

EPFL2019

Brief Announcement: Persistent Multi-Word Compare-and-Swap

Matej Pavlovic

This brief announcement presents a fundamental concurrent primitive for persistent memory - a persistent atomic multi-word compare-and-swap (PMCAS). We present a novel algorithm carefully crafted to ensure that atomic updates to a multitude of words modifi ...

ASSOC COMPUTING MACHINERY2018

Closing the Performance Gap Between Volatile and Persistent Key-Value Stores Using Cross-Referencing Logs

Matej Pavlovic

Key-Value (K-V) stores are an integral building block in modern datacenter applications. With byteaddressable persistent memory (PM) technologies, such as Intel/Micron's 3D XPoint, on the horizon, there has been an influx of new high performance K-V stores ...

USENIX ASSOC2018

Incremental Consistency Guarantees for Replicated Objects

Rachid Guerraoui, Dragos-Adrian Seredinschi, Matej Pavlovic

Programming with replicated objects is difficult. Developers must face the fundamental trade-off between consistency and performance head on, while struggling with the complexity of distributed storage stacks. We introduce Correctables, a novel abstraction ...

2016