Results 11 to 20 of about 17,753 (215)
Regular and almost universal hashing: an efficient implementation [PDF]
Software: Practice and Experience, 2016 Random hashing can provide guarantees regarding the performance of data structures such as hash tables---even in an adversarial setting. Many existing families of hash functions are universal: given two data objects, the probability that they have the ...
Ignatchenko, Sergey +2 more
core +5 more sources
Variationally universal hashing [PDF]
Information Processing Letters, 2006 The strongest well-known measure for the quality of a universal hash-function family H is its being e-strongly universal, which measures, for randomly chosen h ∈ H, one's inability to guess h(m') even if h(m) is known for some m ≠ m' We give example applications in which this measure is too weak, and we introduce a stronger measure for the quality of a
Ted Krovetz, Phillip Rogaway
openalex +4 more sources
Universal Hashing and Multiple Authentication [PDF]
, 1996 In this paper, we study unconditionally secure codes that provide authentication without secrecy. Our point of view is the universal hashing approach pioneered by Wegman and Carter in 1981. We first compare several recent universal-hashing based constructions for authentication codes.
Mustafa Atıcı, D. R. Stinson
openalex +3 more sources
ForestDSH: a universal hash design for discrete probability distributions [PDF]
Data Mining and Knowledge Discovery, 2021 45 pages,11 ...
Arash Gholami Davoodi +5 more
openalex +5 more sources
The computational complexity of universal hashing [PDF]
Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yishay Mansour +2 more
openalex +5 more sources
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;
Palash Sarkar
openalex +3 more sources
The universality of iterated hashing over variable-length strings
Discrete Applied Mathematics, 2011 Iterated hash functions process strings recursively, one character at a time. At each iteration, they compute a new hash value from the preceding hash value and the next character. We prove that iterated hashing can be pairwise independent, but never 3-wise independent. We show that it can be almost universal over strings much longer than the number of
Daniel Lemire
openalex +5 more sources
Universal classes of hash functions
Journal of Computer and System Sciences, 1979 AbstractThis paper gives an input independent average linear time algorithm for storage and retrieval on keys. The algorithm makes a random choice of hash function from a suitable class of hash functions. Given any sequence of inputs the expected time (averaging over all functions in the class) to store and retrieve elements is linear in the length of ...
J.Lawrence Carter, Mark N. Wegman
openalex +4 more sources
Secret Key Distillation with Speech Input and Deep Neural Network-Controlled Privacy Amplification
Mathematics, 2023 We propose a new high-speed secret key distillation system via public discussion based on the common randomness contained in the speech signal of the protocol participants.
Jelica Radomirović +3 more
doaj +1 more source
Hashing practice: analysis of hashing and universal hashing
ACM SIGMOD Record, 1988 Much of the literature on hashing deals with overflow handling (collision resolution) techniques and its analysis. What does all the analytical results mean in practice and how can they be achieved with practical files? This paper considers the problem of achieving analytical performance of hashing techniques in practice with reference to successful ...
M. Ramakrishna
openalex +3 more sources