597 search results - page 51 / 120 » Homomorphisms of random paths |
ASIACRYPT
2011
Springer
12 years 10 months ago
2011
Springer
We present a generic method to secure various widely-used cryptosystems against arbitrary side-channel leakage, as long as the leakage adheres three restrictions: first, it is bou...
CRYPTO
2011
Springer
12 years 9 months ago
2011
Springer
We consider the problem of delegating computation, where the delegator doesn’t even know the input to the function being delegated, and runs in time significantly smaller than ...
ICRA
2005
IEEE
14 years 3 months ago
2005
IEEE
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
APPROX
2006
Springer
14 years 1 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
IVEVA
2004
13 years 11 months ago
2004
Abstract. In this paper we describe a system where behavior of characters and groups of characters are determined by assigning attributes to groups and individuals hierarchically a...