2157 search results - page 87 / 432 » Optimal Fast Hashing |
143
Voted
INFOSCALE
2006
ACM
15 years 10 months ago
2006
ACM
A fundamental paradigm in P2P is that of a large community of intermittently-connected nodes that cooperate to share files. Because nodes are intermittently connected, the P2P co...
133
Voted
PKC
1999
Springer
15 years 8 months ago
1999
Springer
This paper presents a simple and efficient conversion from a semantically secure public-key encryption scheme against passive adversaries to a non-malleable (or semantically secure...
268
click to vote
CRYPTO
2000
Springer
15 years 7 months ago
2000
Springer
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
161
click to vote
FCSC
2007
15 years 4 months ago
2007
Application-level content-based routing using XML is a key technology for decentralized publish/subscribe systems. In this paper, a new approach is proposed to support the efficien...
134
click to vote
SP
2002
IEEE
15 years 3 months ago
2002
IEEE
We describe a novel method for authenticating multicast packets that is robust against packet loss. Our main focus is to minimize the size of the communication overhead required t...