123 search results - page 12 / 25 » Derandomizing from Random Strings |
176
Voted
TCC
2007
Springer
16 years 14 days 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...
194
Voted
RECOMB
2004
Springer
16 years 6 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 ...
142
Voted
CRYPTO
2004
Springer
15 years 10 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...
168
Voted
SOUPS
2009
ACM
16 years 26 days 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...
163
Voted
FOCS
2004
IEEE
15 years 10 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...