Sciweavers

1080 search results - page 92 / 216
» Distributed Hash Tables
Sort
View
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
15 years 8 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
PERCOM
2007
ACM
16 years 5 months ago
Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment
? Peer-to-peer is a popular distributed system. With the advancement in mobile technologies, mobile p2p has revealed its attraction. But, the resource constraints such as bandwidth...
Dewan Tanvir Ahmed, Shervin Shirmohammadi
IPPS
2003
IEEE
15 years 11 months ago
Performance Modeling of the Grace Hash Join on Cluster Architectures
Aim of the paper is to develop a concise but comprehensive analytical model for the well-known Grace Hash Join algorithm on cost effective cluster architectures. This approach is ...
Erich Schikuta
ICPPW
1999
IEEE
15 years 10 months ago
Performance Evaluation of Public-Key Certificate Revocation System with Balanced Hash Tree
A new method for updating certificate revocation trees (CRT) is proposed. Efficient revocation of publickey certificates is a current issue in public-key Infrastructure because a ...
Hiroaki Kikuchi, Kensuke Abe, Shohachiro Nakanishi
DCOSS
2006
Springer
15 years 10 months ago
Locating Compromised Sensor Nodes Through Incremental Hashing Authentication
Abstract. While sensor networks have recently emerged as a promising computing model, they are vulnerable to various node compromising attacks. In this paper, we propose COOL, a CO...
Youtao Zhang, Jun Yang 0002, Lingling Jin, Weijia ...