6251 search results - page 1068 / 1251 » Randomness, Computability, and Density |
147
click to vote
EUROCRYPT
2004
Springer
15 years 9 months ago
2004
Springer
Denoting by P = [k]G the elliptic-curve double-and-add multiplication of a public base point G by a secret k, we show that allowing an adversary access to the projective representa...
147
click to vote
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
131
click to vote
GD
2004
Springer
15 years 9 months ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
134
click to vote
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
We study the problem of non-interactive correlation distillation (NICD). Suppose Alice and Bob each has a string, denoted by A = a0a1 · · · an−1 and B = b0b1 · · · bn−1,...
131
click to vote
MWCN
2004
Springer
15 years 9 months ago
2004
Springer
In Mobile IPv6, each packet sent and received by a mobile node contains its home address. As a result, it is very easy for an eavesdropper or for a correspondent node to track the ...