Trade-offs in Distributed Interactive Proofs
Trade-offs in Distributed Interactive Proofs
复制标题
分布式交互式证明的权衡
DOI:
10.4230/lipics.disc.2019.13
复制
发表时间:
2019
期刊:
影响因子:
--
通讯作者:
A. Paz
中科院分区:
文献类型:
--
作者:
P. Crescenzi;P. Fraigniaud;A. Paz
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.
DOI:
--
发表时间:
2018
期刊:
ACM Symposium on Principles of Distributed Computing
影响因子:
--
作者:
Kol, Gillat;Oshman, Rotem;Saxena, Raghuvansh.
通讯作者:
Saxena, Raghuvansh.
DOI:
10.1137/1.9781611975482.51
发表时间:
2019
期刊:
SODA 2019
影响因子:
--
作者:
Chang, Y.-J.;Pettie, S.;Zhang, H.
通讯作者:
Zhang, H.