The Hidden Complexity of Distributed Systems

About
Privacy
Disclaimer

Graph Chatbot

Related publications (27)

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Interactive oracle proofs (IOPs) are a multi-round generalization of probabilistically checkable proofs that play a fundamental role in the construction of efficient cryptographic proofs. ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

On the Grothendieck-Serre conjecture for classical groups

Eva Bayer Fluckiger

We prove some new cases of the Grothendieck-Serre conjecture for classical groups. This is based on a new construction of the Gersten-Witt complex for Witt groups of Azumaya algebras with involution on regular semilocal rings, with explicit second residue ...

WILEY2022

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!

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

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic communication complexity in the worst case. While it has been shown that the bound is tight in synchronous environments, it is still unknown whether ...

Dagstuhl Publishing2022

Gravitational wave signal from primordial magnetic fields in the Pulsar Timing Array frequency band

Andrii Neronov

The NANOGrav, Parkes, European, and International Pulsar Timing Array (PTA) Collaborations have reported evidence for a common-spectrum process that can potentially correspond to a stochastic gravitational wave background (SGWB) in the 1-100 nHz frequency ...

American Physical Society2022

Lifetime of dielectric elastomer actuators under DC electric fields

Fabio Beco Albuquerque

Dielectric elastomer actuators (DEAs) are interesting soft actuators compared to other actuation technologies owing to large achievable actuation strains, high energy density and fast actuation. However, because DEAs need to be operated under high electric ...

EPFL2022

The Universal Gossip Fighter

Rachid Guerraoui, Anne-Marie Kermarrec, Anastasiia Kucherenko, Rafaël Benjamin Pinot

The notion of adversary is a staple of distributed computing. An adversary typically models “hostile” assumptions about the underlying distributed environment, e.g., a network that can drop messages, an operating system that can delay processes or an attac ...

IEEE2022

Review-Origin and Promotional Effects of Plasmonics in Photocatalysis

Olivier Martin, Madasamy Thangamuthu

Plasmonic effects including near-field coupling, light scattering, guided mode through surface plasmon polaritons (SPPs), Forster resonant energy transfer (FRET), and thermoplasmonics are extensively used for harnessing inexhaustible solar energy for photo ...

ELECTROCHEMICAL SOC INC2022

Page 3 of 3

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Alessandro Chiesa, Siqi Liu

Interactive oracle proofs (IOPs) are a multi-round generalization of probabilistically checkable proofs that play a fundamental role in the construction of efficient cryptographic proofs. ...

SPRINGER INTERNATIONAL PUBLISHING AG2022