J
Jovan Komatovic
Researcher at École Polytechnique Fédérale de Lausanne
Publications - 13
Citations - 96
Jovan Komatovic is an academic researcher from École Polytechnique Fédérale de Lausanne. The author has contributed to research in topics: Computer science & Broadcasting (networking). The author has an hindex of 3, co-authored 5 publications receiving 26 citations.
Papers
More filters
Proceedings ArticleDOI
Online Payments by Merely Broadcasting Messages
Daniel Collins,Rachid Guerraoui,Jovan Komatovic,Petr Kuznetsov,Matteo Monti,Matej Pavlovic,Yvonne-Anne Pignolet,Dragos-Adrian Seredinschi,Andrei Tonkikh,Athanasios Xygkis +9 more
TL;DR: Astro, a system solving the problem of online payments efficiently in a decentralized, deterministic, and completely asynchronous manner, achieves a 5× improvement over a state-of-the-art consensus-based solution, while exhibiting sub-second 95^th percentile latency.
Posted Content
Online Payments by Merely Broadcasting Messages (Extended Version).
Daniel Collins,Rachid Guerraoui,Jovan Komatovic,Matteo Monti,Athanasios Xygkis,Matej Pavlovic,Petr Kuznetsov,Yvonne-Anne Pignolet,Dragos-Adrian Seredinschi,Andrei Tonkikh +9 more
TL;DR: A Astro system solving the problem of online payments efficiently in a decentralized, deterministic, and completely asynchronous manner, and achieves a $5\times improvement over a state-of-the-art consensus-based solution, while exhibiting sub-second $95^{th}$ percentile latency.
Proceedings ArticleDOI
Byzantine Consensus Is Θ(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony!
Pierre Civit,M. Ayaz Dzulfikar,Seth Gilbert,Vincent Gramoli,Rachid Guerraoui,Jovan Komatovic,M. Vidigueira +6 more
TL;DR: The Dolev-Reischuk bound for Byzantine consensus in partially synchronous settings was shown to be tight in this paper , and it is unknown whether a consensus protocol with quadratic communication complexity can be obtained in partial synchrony.
Posted Content
Dynamic Byzantine Reliable Broadcast [Technical Report].
TL;DR: The first specification of a dynamic Byzantine reliable broadcast (DBRB) primitive that is amenable to an asynchronous implementation is introduced and it is proved that even if only one process in the system can fail, then it is impossible to implement a stronger primitive.
Proceedings ArticleDOI
As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!
TL;DR: This paper introduces ABC, a simple yet efficient transformation of any Byzantine consensus protocol to an accountable one, and proves a tight lower bound on the accountability complexity, a complex-ity metric representing the number of accountability-specific messages that correct processes must send.