4850 search results - page 200 / 970 » Proof and Computation in Geometry |
189
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
HMAC was proved in [3] to be a PRF assuming that (1) the underlying compression function is a PRF, and (2) the iterated hash function is weakly collision-resistant. However, recent...
170
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
153
click to vote
CRYPTO
2007
Springer
16 years 22 days ago
2007
Springer
In this paper we identify the (P, Q)-DDH assumption, as an extreme, powerful generalization of the Decisional Diffie-Hellman (DDH) assumption: virtually all previously proposed gen...
155
Voted
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
135
Voted
IMR
2003
Springer
15 years 11 months ago
2003
Springer
A Cartesian grid generation methodology is developed for unsteady control volume computational fluid dynamic (CFD) solvers. Arbitrary combinations and numbers of moving and statio...