Trade-offs in Distributed Interactive Proofs

08/09/2019
by   Pierluigi Crescenzi, et al.
0

The study of interactive proofs in the context of distributed network computing is a novel topic, recently introduced by Kol, Oshman, and Saxena [PODC 2018]. In the spirit of sequential interactive proofs theory, we study the power of distributed interactive proofs. This is achieved via a series of results establishing trade-offs between various parameters impacting the power of interactive proofs, including the number of interactions, the certificate size, the communication complexity, and the form of randomness used. Our results also connect distributed interactive proofs with the established field of distributed verification. In general, our results contribute to providing structure to the landscape of distributed interactive proofs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/29/2020

Shared vs Private Randomness in Distributed Interactive Proofs

In distributed interactive proofs, the nodes of a graph G interact with ...
research
10/04/2022

Distributed Quantum Interactive Proofs

The study of distributed interactive proofs was initiated by Kol, Oshman...
research
12/28/2018

The Power of Distributed Verifiers in Interactive Proofs

We explore the power of interactive proofs with a distributed verifier. ...
research
09/02/2021

A logic of interactive proofs

We introduce the probabilistic two-agent justification logic IPJ, a logi...
research
02/22/2022

How Hard Are Verifiable Delay Functions?

Verifiable delay functions (VDF) are functions that enable a verifier to...
research
03/08/2018

Redundancy in Distributed Proofs

Distributed proofs are mechanisms enabling the nodes of a network to col...
research
08/26/2023

SOK: Privacy Definitions and Classical Mechanisms in the Local Setting

This paper delves into the intricate landscape of privacy notions, speci...

Please sign up or login with your details

Forgot password? Click here to reset