Publications associées à Partial Synchrony for Free: New Upper Bounds for Byzantine Agreement

Publications associées (9)

Learning to Reason with Neural Networks: Principles and Methods

This thesis focuses on understanding and improving the reasoning capabilities of neural networks. It develops theoretical results and empirical analyses to uncover reasoning potential and limitations, leveraging these insights to guide the design of improv ...

EPFL2025

zkSNARKs in the ROM with Unconditional UC-Security

Alessandro Chiesa, Giacomo Fenzi

The universal composability (UC) framework is a “gold standard” for security in cryptography. UC-secure protocols achieve strong security guarantees against powerful adaptive adversaries, and retain these guarantees when used as part of larger protocols. Z ...

Springer Science and Business Media Deutschland GmbH2025

Laser-based manufacturing of freeform glass micro-optics through topological transformation

Samuel Youcef Benketaf

Glass has been the material of choice for making optical elements, in large part due to its intrinsic properties: a temperature-dependent viscosity, which enables shaping the material into a broad variety of functional and artistic glassware. Silica glass ...

EPFL2024

On the Validity of Consensus

Rachid Guerraoui, Seth Gilbert, Jovan Komatovic, Manuel José Ribeiro Vidigueira, Pierre Philippe Civit

The Byzantine consensus problem involves.. processes, out of which t < n could be faulty and behave arbitrarily. Three properties characterize consensus: (1) termination, requiring correct (nonfaulty) processes to eventually reach a decision, (2) agreement ...

Assoc Computing Machinery2023

Crime and Punishment in Distributed Byzantine Decision Tasks

Rachid Guerraoui, Vincent Gramoli, Seth Gilbert, Jovan Komatovic, Zarko Milosevic, Pierre Philippe Civit

A decision task is a distributed input-output problem in which each process starts with its input value and eventually produces its output value. Examples of such decision tasks are broad and range from consensus to reliable broadcast to lattice agreement. ...

IEEE COMPUTER SOC2022

Factorial Lower Bounds for (Almost) Random Order Streams

Mikhail Kapralov

In this paper we introduce and study the STREAMINGCYCLES problem, a random order streaming version of the Boolean Hidden Hypermatching problem that has been instrumental in streaming lower bounds over the past decade. In this problem the edges of a graph G ...

IEEE COMPUTER SOC2022

Latest experimental and theoretical advances in the production of negative ions in caesium-free plasmas

Ivo Furno, Alan Howling, Riccardo Agnello, Philippe Frédérique Bruno Guittienne, Rémy Jacquier, Samir Suweis

This topical review gathers the last updates concerning caesium-free negative ion sources presented during the 63rd Course of the International school of Quantum Electronics of the Ettore Majorana Foundation and European collaborative works related to thes ...

2021

Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits

Ola Nils Anders Svensson, Abbas Bazzi

Initially developed for the min-knapsack problem, the knapsack cover inequalities are used in the current best relaxations for numerous combinatorial optimization problems of covering type. In spite of their widespread use, these inequalities yield linear ...

UNIV CHICAGO, DEPT COMPUTER SCIENCE2018

Provably Secure Authenticated Encryption

Damian Vizár

Authenticated Encryption (AE) is a symmetric key cryptographic primitive that ensures confidentiality and authenticity of processed messages at the same time. The research of AE as a primitive in its own right started in 2000. The security goals of AE wer ...

EPFL2018