Sciweavers

33 search results - page 2 / 7
» A Direct Product Theorem for Discrepancy
Sort
View
CRYPTO
2007
Springer
145views Cryptology» more  CRYPTO 2007»
15 years 7 months ago
Chernoff-Type Direct Product Theorems
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...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
15 years 10 months ago
Almost Optimal Bounds for Direct Product Threshold Theorem
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 ...
Charanjit S. Jutla