Sciweavers

713 search results - page 75 / 143
» Dispersing Hash Functions
Sort
View
IPL
2006
110views more  IPL 2006»
14 years 9 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway
ANCS
2009
ACM
14 years 7 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...
P2P
2007
IEEE
153views Communications» more  P2P 2007»
15 years 4 months ago
On Routing in Distributed Hash Tables
There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are ...
Fabius Klemm, Sarunas Girdzijauskas, Jean-Yves Le ...
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
INFOCOM
2006
IEEE
15 years 3 months ago
Reverse Hashing for High-Speed Network Monitoring: Algorithms, Evaluation, and Applications
— A key function for network traffic monitoring and analysis is the ability to perform aggregate queries over multiple data streams. Change detection is an important primitive w...
Robert T. Schweller, Zhichun Li, Yan Chen, Yan Gao...