45 search results - page 2 / 9 » The Intersection Theorem for Direct Products |
CORR
2010
Springer
13 years 4 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 ...
SIAMCOMP
2010
13 years 4 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
CRYPTO
2007
Springer
14 years 4 days 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...
TCC
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We consider weakly-verifiable puzzles which are challengeresponse puzzles such that the responder may not be able to verify for itself whether it answered the challenge ...
STOC
2006
ACM
14 years 6 months ago
2006
ACM