Interactive distributed proofs

G Kol, R Oshman, RR Saxena - … of the 2018 ACM Symposium on …, 2018 - dl.acm.org
Interactive proof systems allow a resource-bounded verifier to decide an intractable
language (or compute a hard function) by communicating with a powerful but untrusted …

Distributed zero-knowledge proofs over networks

A Bick, G Kol, R Oshman - Proceedings of the 2022 Annual ACM-SIAM …, 2022 - SIAM
Zero knowledge proofs are one of the most influential concepts in theoretical computer
science. In the seminal definition due to Goldwasser, Micali and Rackoff dating back to the …

Compact distributed certification of planar graphs

L Feuilloley, P Fraigniaud, P Montealegre… - Proceedings of the 39th …, 2020 - dl.acm.org
Naor, Parter, and Yogev (SODA 2020) have recently demonstrated the existence of a
distributed interactive proof for planarity (ie, for certifying that a network is planar), using a …

Survey of distributed decision

L Feuilloley, P Fraigniaud - arXiv preprint arXiv:1606.04434, 2016 - arxiv.org
We survey the recent distributed computing literature on checking whether a given
distributed system configuration satisfies a given boolean predicate, ie, whether the …

Approximate proof-labeling schemes

K Censor-Hillel, A Paz, M Perry - Theoretical Computer Science, 2020 - Elsevier
We study a new model of verification of boolean predicates over distributed networks. Given
a network configuration, the proof-labeling scheme (PLS) model defines a distributed proof …

Local certification of graphs with bounded genus

L Feuilloley, P Fraigniaud, P Montealegre… - Discrete Applied …, 2023 - Elsevier
Abstract Naor, Parter, and Yogev [SODA 2020] recently designed a compiler for
automatically translating standard centralized interactive protocols to distributed interactive …

Redundancy in distributed proofs

L Feuilloley, P Fraigniaud, J Hirvonen, A Paz… - Distributed …, 2021 - Springer
Distributed proofs are mechanisms that enable the nodes of a network to collectively and
efficiently check the correctness of Boolean predicates on the structure of the network (eg …

Towards a complexity theory for the congested clique

JH Korhonen, J Suomela - Proceedings of the 30th on Symposium on …, 2018 - dl.acm.org
The congested clique model of distributed computing has been receiving attention as a
model for densely connected distributed systems. While there has been significant progress …

Distributed detection of cycles

P Fraigniaud, D Olivetti - ACM Transactions on Parallel Computing …, 2019 - dl.acm.org
Distributed property testing in networks has been introduced by Brakerski and Patt-Shamir
[6], with the objective of detecting the presence of large dense sub-networks in a distributed …

Brief announcement: Towards a complexity theory for the congested clique

JH Korhonen, J Suomela - 31st International Symposium on …, 2017 - drops.dagstuhl.de
The congested clique model of distributed computing has been receiving attention as a
model for densely connected distributed systems. While there has been significant progress …