32 search results - page 1 / 7 » Chernoff-Type Direct Product Theorems |
CRYPTO
2007
Springer
13 years 10 months ago
2007
Springer
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user and at most β < α for an attacker. One example is a CAP...
CORR
2010
Springer
12 years 11 months ago
2010
Springer
We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a general...
COCO
2008
Springer
13 years 6 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
TOC
2010
12 years 11 months ago
2010
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...