Sciweavers

Share
TCC
2016
Springer

From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back

4 years 7 months ago
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
G¨o¨os, Pitassi and Watson (ITCS, 2015) have recently introduced the notion of Zero-Information Arthur-Merlin Protocols (ZAM). In this model, which can be viewed as a private version of the standard Arthur-Merlin communication complexity game, Alice and Bob are holding a pair of inputs x and y respectively, and Merlin, the prover, attempts to convince them that some public function f evaluates to 1 on (x, y). In addition to standard completeness and soundness, G¨o¨os et al., require a “zero-knowledge” property which asserts that on each yes-input, the distribution of Merlin’s proof leaks no information about the inputs (x, y) to an external observer. In this paper, we relate this new notion to the well-studied model of Private Simultaneous Messages (PSM) that was originally suggested by Feige, Naor and Kilian (STOC, 1994). Roughly speaking, we show that the randomness complexity of ZAM corresponds to the communication complexity of PSM, and that the communication complexity ...
Benny Applebaum, Pavel Raykov
Added 10 Apr 2016
Updated 10 Apr 2016
Type Journal
Year 2016
Where TCC
Authors Benny Applebaum, Pavel Raykov
Comments (0)
books