Sciweavers

455 search results - page 3 / 91
» Distributed Processes on Tree Hash
Sort
View
ICPPW
1999
IEEE
13 years 12 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
IADIS
2003
13 years 9 months ago
A New Key Distribution Scheme for Secure Multicast Communications
In this short paper, we propose a new key management architecture for Multicast communications. This architecture combines the complementary variable approach with hashed keys and...
Martin St-Amand, Boucif Amar Bansaber, Dominique S...
BROADCOM
2008
IEEE
14 years 2 months ago
UnoHop: Efficient Distributed Hash Table with O(1) Lookup Performance
Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These eve...
Herry Imanta Sitepu, Carmadi Machbub, Armein Z. R....
HPCA
2003
IEEE
14 years 8 months ago
Caches and Hash Trees for Efficient Memory Integrity
We study the hardware cost of implementing hash-tree based verification of untrusted external memory by a high performance processor. This verification could enable applications s...
Blaise Gassend, G. Edward Suh, Dwaine E. Clarke, M...
CIKM
1994
Springer
13 years 11 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet