Results 181 to 190 of about 914,695 (232)

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
Ulf Schellbach, Martin Dietzfelbinger
openaire   +2 more sources

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.
Jan-Åke Larsson, Aysajan Abidin
openaire   +2 more sources

Universally composable anonymous Hash certification model [PDF]

Science in China Series F: Information Sciences, 2007
Ideal function is the fundamental component in the universally composable security model. However, the certification ideal function defined in the universally composable security model realizes the identity authentication by binding identity to messages and the signature, which fails to characterize the special security requirements of anonymous ...
SangJae Moon, Fan Zhang, Jianfeng Ma
openaire   +1 more source

On aspects of university and performance for closed hashing

Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89, 1989
We consider two hashing models for storing a set S ⊂ {0, 1, 2, …, m - 1} in a table T of size n.The first model uses universal hashing for a partially loaded table. A set of hash functions is universal if, for any the input set, a randomly selected function has an efficient expected performance.
Alan Siegel, J. P. Schmidt
openaire   +2 more sources

Universal hashing algorithm on the Suzuki curve

, 2011
An algorithm for universal hashing on the Suzuki curve over a finite field , which is determined by calculating the Horner's scheme for the four rational functions .
Геннадий Зайдулович Халимов, Евгений Владимирович Котух   +1 more
semanticscholar   +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   +2 more sources

Universal Hashing Based on Field Multiplication and (Near-)MDS Matrices

IACR Cryptology ePrint Archive, 2023
Koustabh Ghosh, Jonathan Fuchs, P. A. Eliasi, J. Daemen   +3 more
semanticscholar   +1 more source

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   +2 more sources

Multimixer-156: Universal Keyed Hashing Based on Integer Multiplication and Cyclic Shift

International Conference on Cryptology in India, 2023
Koustabh Ghosh, P. A. Eliasi, Joan Daemen   +2 more
semanticscholar   +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.
Mark N. Wegman, George Markowsky, J. Lawrence Carter   +2 more
openaire   +1 more source