Sciweavers

TCC
2010
Springer
188views Cryptology» more  TCC 2010»
14 years 1 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