4325 search results - page 578 / 865 » Incremental computation with names |
178
click to vote
PERCOM
2005
ACM
16 years 6 months ago
2005
ACM
This paper considers the problem of maintaining the coverage degree of a wireless sensor network at an application specific level while keeping the sensing units of only a subset o...
160
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
At ASIACRYPT 2006, Chang et al. analyzed the indifferentiability of some popular hash functions based on block ciphers, namely, the twenty collision resistant PGV, the MDC2 and th...
140
Voted
DCC
2003
IEEE
16 years 6 months ago
2003
IEEE
Two ways of constructing maximal sets of mutually orthogonal Latin squares are presented. The first construction uses maximal partial spreads in PG(3, 4)\ PG(3, 2) with r lines, wh...
196
click to vote
DCC
2003
IEEE
16 years 6 months ago
2003
IEEE
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
191
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
In hostile environments, the enemy can launch traffic analysis against interceptable routing information embedded in routing messages and data packets. Allowing adversaries to tra...