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 …
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 …
We survey the recent distributed computing literature on checking whether a given distributed system configuration satisfies a given boolean predicate, ie, whether the …
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 …
Abstract Naor, Parter, and Yogev [SODA 2020] recently designed a compiler for automatically translating standard centralized interactive protocols to distributed interactive …
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 …
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 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 …
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 …