arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.16191cs.DC
收藏

分布式交互证明中的共享随机性与私有随机性

Shared vs Private Randomness in Distributed Interactive Proofs

Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport

摘要:

在分布式交互式证明中,图G的节点与一个强大但不可信的证明者交互,该证明者试图在少量的回合中通过短消息说服他们G满足某些性质。这一系列的交互之后是分布式验证阶段,这可能是确定性的或随机的,节点与它们的邻居交换消息。这最后一轮核查的性质确定了两种类型的交互式协议。如果验证回合是确定性的,我们说协议是亚瑟-梅林类型的。如果在验证回合中,允许节点使用一组新的随机位,则我们说该协议是梅林-阿瑟类型的。在Kol,Oshman和Saxena [PODC 2018]引入的原始模型中,随机性是私有的,因为每个节点只能访问随机硬币的单个来源。Crescenzi,Fraigniaud和Paz [DISC 2019]开始研究分布式交互模型中共享随机性(硬币投掷对所有节点可见的情况)的影响。在这项工作中,我们继续研究表明,这两种形式的随机性的影响是非常不同的,这取决于我们是否考虑亚瑟梅林协议或梅林亚瑟协议。虽然私有随机性为第一种协议提供了更多的权力,但共享随机性为第二种协议提供了更多的权力。我们的研究结果还连接共享的随机性在分布式交互式证明与分布式验证,并获得新的下界。

英文摘要:

In distributed interactive proofs, the nodes of a graph G interact with a powerful but untrustable prover who tries to convince them, in a small number of rounds and through short messages, that G satisfies some property. This series of interactions is followed by a phase of distributed verification, which may be either deterministic or randomized, where nodes exchange messages with their neighbors. The nature of this last verification round defines the two types of interactive protocols. We say that the protocol is of Arthur-Merlin type if the verification round is deterministic. We say that the protocol is of Merlin-Arthur type if, in the verification round, the nodes are allowed to use a fresh set of random bits. In the original model introduced by Kol, Oshman, and Saxena [PODC 2018], the randomness was private in the sense that each node had only access to an individual source of random coins. Crescenzi, Fraigniaud, and Paz [DISC 2019] initiated the study of the impact of shared randomness (the situation where the coin tosses are visible to all nodes) in the distributed interactive model. In this work, we continue that research line by showing that the impact of the two forms of randomness is very different depending on whether we are considering Arthur-Merlin protocols or Merlin-Arthur protocols. While private randomness gives more power to the first type of protocols, shared randomness provides more power to the second. Our results also connect shared randomness in distributed interactive proofs with distributed verification, and new lower bounds are obtained.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑