Optimal Byzantine Agreement with Little Cryptography

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.

Byzantine agreement enables n processes to agree on a common L-bit value, despite up to t > 0 arbitrary failures. A long line of work has been dedicated to improving the bit complexity of Byzantine agreement in synchrony. This has culminated in COOL, an er ...

In this paper, we are presenting a new architecture to directly compute the ‘Percent-free PSA’ diagnostics index to enhance the differentiation of prostate cancer from benign prostatic disease. The proposed circuit uses silicon nanowires-based memristive b ...

Ordinary metals contain electron liquids within well-defined 'Fermi' surfaces at which the electrons behave as if they were non-interacting. In the absence of transitions to entirely new phases such as insulators or superconductors, interactions between el ...

In a non-synchronous system with n processes, no t(0)-resilient (deterministic or probabilistic) Byzantine consensus protocol can prevent a disagreement among correct processes if the number of faulty processes is > n - 2t(0). Therefore, the community defi ...

By supporting the access of multiple memory words at the same time, Bit-line Computing (BC) architectures allow the parallel execution of bit-wise operations in-memory. At the array periphery, arithmetic operations are then derived with little additional o ...

Homomorphic Encryption (HE) enables computations to be executed directly on encrypted data. As such, it is an auspicious solution for protecting the confidentiality of sensitive data without impeding its usability. However, HE does not provide any guarant ...

In this article, we consider decentralized optimization problems where agents have individual cost functions to minimize subject to subspace constraints that require the minimizers across the network to lie in low-dimensional subspaces. This constrained fo ...

We consider the problem of making a multi-agent system (MAS) resilient to Byzantine failures through replication. We consider a very general model of MAS, where randomness can be involved in the behavior of each agent. We propose the first universal scheme ...

Hot exciton materials have the potential to improve the quantum efficiency of organic light-emitting diodes (OLEDs) by promoting high reversed intersystem crossing (hRISC) between a high-lying triplet (T-n, n >= 2) and a radiative singlet (S-m). In recent ...

Interactive simulations allow students to discover the underlying principles of a scientific phenomenon through their own exploration. Unfortunately, students often struggle to learn effectively in these environments. Classifying students’ interaction data ...

This paper aims to analyze the transnational discourse behind the programmatic shift in spatial production and layout of workers’ housing in Turkey from the state-financed model of the interwar period to the aided self-help model by the introduction of the ...

Computing servers play a key role in the development and process of emerging compute-intensive applications in recent years. However, they need to operate efficiently from an energy perspective viewpoint, while maximizing the performance and lifetime of th ...

Conversational interfaces have recently become a ubiquitous element in both the personal sphere by easing access to services, and industrial environments by the automation of services, improved customer support and its corresponding cost savings. However, ...

This paper introduces a new approach to reduce end-to-end costs in large-scale replicated systems built under a Byzantine fault model. Specifically, our approach transforms a given replicated state machine (RSM) to another RSM where nodes incur lower costs ...

Amid a data revolution that is transforming industries around the globe, computing systems have undergone a paradigm shift where many applications are scaled out to run on multiple computers in a computing cluster. As the storage and processing capabilitie ...

SA-BDPA is a water-soluble, narrow-line width radical previously used for dynamic nuclear polarization (DNP) signal enhancement in solid-state magic angle spinning NMR spectroscopy. Here, we report the first study using SA-BDPA under dissolution DNP condit ...

In this thesis, we revisit classic problems in shared-memory distributed computing through the lenses of (1) emerging hardware technologies and (2) changing requirements. Our contributions consist, on the one hand, in providing a better understanding of th ...

Optimal Byzantine Agreement with Little Cryptography

Chat with Graph Search

Efficient Signature-Free Validated Agreement

Enhancing Prostate Cancer Diagnosis with In-Memory Sensing and Edge Computing of Percent-free PSA Index

Anomalous electrons in a metallic kagome ferromagnet

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Bit-Line Computing for CNN Accelerators Co-Design in Edge AI Inference

Thwarting Malicious Adversaries in Homomorphic Encryption Pipelines

Quantization for Decentralized Learning Under Subspace Constraints

Byzantine-Resilient Multi-Agent System

Donor-Acceptor-Donor "Hot Exciton" Triads for High Reverse Intersystem Crossing in OLEDs

Generalisable Methods for Early Prediction in Interactive Simulations for Education

From State-led to Aided Self-help: Marshall Plan and Workers’ Housing Cooperatives in Turkey

Reinforcement Learning-Based Joint Reliability and Performance Optimization for Hybrid-Cache Computing Servers

Towards versatile conversations with data-driven dialog management and its integration in commercial platforms

Replicated state machines without replicated execution

An Architecture for Load Balance in Computer Cluster Applications

C-13 Dynamic Nuclear Polarization using SA-BDPA at 6.7 T and 1.1 K: Coexistence of Pure Thermal Mixing and Well-Resolved Solid Effect

Distributed Computing with Modern Shared Memory