123 search results - page 12 / 25 » Derandomizing from Random Strings |
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
RECOMB
2004
Springer
14 years 7 months ago
2004
Springer
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
CRYPTO
2004
Springer
13 years 11 months ago
2004
Springer
Let f : {0, 1}n {0, 1}l be a one-way function. A function h : {0, 1}n {0, 1}m is called a hard-core function for f if, when given f(x) for a (secret) x drawn uniformly from {0, 1}n...
SOUPS
2009
ACM
14 years 1 months ago
2009
ACM
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...