658 search results - page 74 / 132 » The Grindahl Hash Functions |
107
Voted
ICMCS
2010
IEEE
15 years 1 months ago
2010
IEEE
The increasingly large amount of digital multimedia content has created a need for technologies to search and identify multimedia files. Multimedia fingerprinting has been widely ...
126
Voted
CCS
2008
ACM
15 years 2 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
115
click to vote
IPL
2006
15 years 23 days ago
2006
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...
100
Voted
P2P
2007
IEEE
15 years 7 months ago
2007
IEEE
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 ...
90
Voted
CRYPTO
2005
Springer
15 years 6 months ago
2005
Springer
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...