321 search results - page 26 / 65 » Randomness extractors -- applications and constructions |
CRYPTO
1997
Springer
14 years 20 days ago
1997
Springer
Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices and also the secret ...
ASIACRYPT
2011
Springer
12 years 8 months ago
2011
Springer
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
FLAIRS
2004
13 years 10 months ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
ICSE
2011
IEEE-ACM
12 years 12 months ago
2011
IEEE-ACM
Current practice in testing JavaScript web applications requires manual construction of test cases, which is difficult and tedious. We present a framework for feedback-directed a...
AIPS
2007
13 years 10 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...