123 search results - page 13 / 25 » Derandomizing from Random Strings |
102
click to vote
CSB
2003
IEEE
15 years 7 months ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
122
click to vote
EUROCRYPT
2010
Springer
15 years 5 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
107
Voted
CRYPTO
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
113
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...