7811 search results - page 1283 / 1563 » computing 2004 |
114
click to vote
EUROCRYPT
2004
Springer
15 years 9 months ago
2004
Springer
Textbooks tell us that a birthday attack on a hash function h with range size r requires r1/2 trials (hash computations) to find a collision. But this is quite misleading, being t...
121
Voted
EUROCRYPT
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Dining cryptographers networks (or DC-nets) are a privacypreserving primitive devised by Chaum for anonymous message publication. A very attractive feature of the basic D...
146
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
Voted
EUROPAR
2004
Springer
15 years 9 months ago
2004
Springer
Address correlation is a technique that links the addresses that reference the same data values. Using a detailed source-code level analysis, a recent study [1] revealed that diffe...
150
click to vote
EUROPAR
2004
Springer
15 years 9 months ago
2004
Springer
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...