Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > PUBLIC COIN:
Reports tagged with public coin:
TR02-074 | 26th December 2002
Andrew Chi-Chih Yao

#### On the Power of Quantum Fingerprinting

In the simultaneous message model, two parties holding $n$-bit integers
$x,y$ send messages to a third party, the {\it referee}, enabling
him to compute a boolean function $f(x,y)$. Buhrman et al
[BCWW01] proved the remarkable result that, when $f$ is the
equality function, the referee can solve this problem by ... more >>>

TR09-109 | 3rd November 2009
Kai-Min Chung, Feng-Hao Liu

#### Tight Parallel Repetition Theorems for Public-coin Arguments

Following Hastad, Pass, Pietrzak, and Wikstrom (2008), we study parallel repetition theorems for public-coin interactive arguments and their generalization. We obtain the following results:

1. We show that the reduction of Hastad et al. actually gives a tight direct product theorem for public-coin interactive arguments. That is, $n$-fold parallel repetition ... more >>>

ISSN 1433-8092 | Imprint