Results 151 to 160 of about 1,394 (186)

Universal hash functions for an infinite universe and hash trees

Information Processing Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +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 ...
openaire   +1 more source

New Universal Hash Functions

2012
Universal hash functions are important building blocks for unconditionally secure message authentication codes. In this paper, we present a new construction of a class of e-Almost Strongly Universal2 hash functions with much smaller description (or key) length than the Wegman-Carter construction.
Aysajan Abidin, Jan-Åke Larsson
openaire   +1 more source

FUZZY UNIVERSAL HASHING AND APPROXIMATE AUTHENTICATION

Discrete Mathematics, Algorithms and Applications, 2011
Traditional data authentication systems are sensitive to single bit changes and so are unsuitable for message spaces that are naturally "fuzzy" where "similar" messages are considered "the same" or indistinguishable. In this paper, we study unconditionally secure approximate authentication.
Reihaneh Safavi-Naini, Dongvu Tonien
openaire   +3 more sources

Quantum Hashing via ε-Universal Hashing Constructions and Freivalds’ Fingerprinting Schemas

Lecture Notes in Computer Science, 2014
We define the concept of a quantum hash generator and offer a design, which allows one to build a large number of different quantum hash functions. The construction is based on composition of a classical ε-universal hash family and a given family of functions - quantum hash generators.
Farid Ablayev, Ablayev Farid
exaly   +4 more sources

Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes

2009
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T 1 and T 2 each of which has m cells of capacity 1 such that constant access time is guaranteed. For m ≥ (1 + e)n and hash functions h 1, h 2 that are c logn-wise independent, Pagh [11] showed that the keys of an arbitrary set S can be stored using
Martin Dietzfelbinger, Ulf Schellbach
openaire   +1 more source

Universal hashing in VLSI

2006
A problem is presented with deterministic VLSI complexity AT det 2 =Ω(N2), but Las Vegas complexity only AT Las Vegas 2 =O (N poly(logN)). (The Las Vegas algorithm always decides correctly, but T is only the expected running time; A is the area of the chip).
openaire   +1 more source

Universally composable anonymous Hash certification model

Science in China Series F: Information Sciences, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan Zhang, Jianfeng Ma 0001, Sang-Jae Moon   +2 more
openaire   +2 more sources

Universal Hash-Function Families: From Hashing to Authentication

2014
Due to their potential use as building blocks for constructing highly efficient message authentication codes (MACs), universal hash-function families have been attracting increasing research attention, both from the design and analysis points of view.
openaire   +1 more source

Analysis of a universal class of hash functions

1978
In this paper we use linear algebraic methods to analyze the performance of several classes of hash functions, including the class H2 presented by Carter and Wegman [2]. Suppose H is a suitable class, the hash functions in H map A to B, S is any subset of A whose size is equal to that of B, and x is any element of A.
George Markowsky, Larry Carter, Mark N. Wegman   +2 more
openaire   +1 more source