Partial Synchrony for Free: New Upper Bounds for Byzantine Agreement

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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 ...

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 ...

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 ...

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 ...

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. ...

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 ...

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 ...

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 ...

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 ...

Partial Synchrony for Free: New Upper Bounds for Byzantine Agreement

Chat with Graph Search

Learning to Reason with Neural Networks: Principles and Methods

zkSNARKs in the ROM with Unconditional UC-Security

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

On the Validity of Consensus

Crime and Punishment in Distributed Byzantine Decision Tasks

Factorial Lower Bounds for (Almost) Random Order Streams

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

Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits

Provably Secure Authenticated Encryption