3415 search results - page 618 / 683 » Lower Bounds for Kernelizations |
EUROCRYPT
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
ICALP
2001
Springer
14 years 2 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
ICCAD
2000
IEEE
14 years 2 months ago
2000
IEEE
To implement high-performance global interconnect without impacting the performance of existing blocks, the use of buffer blocks is increasingly popular in structured-custom and b...
EUROCRYPT
1999
Springer
14 years 2 months ago
1999
Springer
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model...
FOCS
1993
IEEE
14 years 2 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...