321 search results - page 10 / 65 » Randomness extractors -- applications and constructions |
WISE
2005
Springer
14 years 2 months ago
2005
Springer
Many databases have become Web-accessible through form-based search interfaces (i.e., search forms) that allow users to specify complex and precise queries to access the underlying...
PKC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. At PKC 2006, Yang, Wong, Deng and Wang proposed the notion of anonymous signature schemes where signatures do not reveal the signer’s identity, as long as some parts of...
COCO
2003
Springer
14 years 1 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
OOPSLA
2000
Springer
14 years 17 hour ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...