Results 91 to 100 of about 1,013,929 (223)
Improved Densification of One Permutation Hashing [PDF]
, 2014 The existing work on densification of one permutation hashing reduces the query processing cost of the $(K,L)$-parameterized Locality Sensitive Hashing (LSH) algorithm with minwise hashing, from $O(dKL)$ to merely $O(d + KL)$, where $d$ is the number of ...
Li, Ping, Shrivastava, Anshumali
core
Construction of universal one-way hash functions: Tree hashing revisited
Discrete Applied Mathematics, 2007 AbstractWe present a binary tree based parallel algorithm for extending the domain of a universal one-way hash function (UOWHF). For t⩾2, our algorithm extends the domain from the set of all n-bit strings to the set of all ((2t-1)(n-m)+m)-bit strings, where m is the length of the message digest. The associated increase in key length is 2m bits for t=2;
openaire +1 more source
The power of primes: security of authentication based on a universal hash-function family [PDF]
, 2010 Basel Alomair +2 more
openalex +1 more source
Universal classes of hash functions (Extended Abstract) [PDF]
, 1977 J. Lawrence Carter, Mark N. Wegman
openalex +1 more source
Short-Output Universal Hash Functions and Their Use in Fast and Secure Data Authentication [PDF]
, 2012 Long Nguyen, A. W. Roscoe
openalex +1 more source
A Composition Theorem for Universal One-Way Hash Functions [PDF]
, 2000 Victor Shoup
openalex +1 more source
Universal one-way hash functions and their cryptographic applications [PDF]
, 1989 Moni Naor, Moti Yung
openalex +1 more source
ForestDSH: A Universal Hash Design for Discrete Probability\n Distributions [PDF]
, 2019 Arash Gholami Davoodi +5 more
openalex +1 more source
On Risks of Using Cuckoo Hashing with Simple Universal Hash Classes [PDF]
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009 Martin Dietzfelbinger, Ulf Schellbach
openaire +1 more source