17 search results - page 4 / 4 » Proving Hard-Core Predicates Using List Decoding |
ASIACRYPT
2004
Springer
13 years 12 months ago
2004
Springer
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...