Results 191 to 200 of about 945,337 (242)

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

Universally composable anonymous Hash certification model

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

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

Toward a Universal, Transferable, and Robust Adversarial Perturbation Framework Against Deep Hashing-Based Facial Image Retrieval

IEEE transactions on circuits and systems for video technology (Print)
Deep Hashing (DH) based image retrieval is commonly used in facial recognition systems for its precision and effectiveness. However, this convenience is accompanied by a mounting threat to privacy.
Long Tang, Yunna Lv, Dengpan Ye, Yiheng He, Ziyi Liu, Caiyun Xie   +5 more
semanticscholar   +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

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   +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.
J. P. Schmidt, A. Siegel
openaire   +1 more source

A new universal class of hash functions and dynamic hashing in real time

2005
The paper presents a new universal class of hash functions which have many desirable features of random functions, but can be (probabilistically) constructed using sublinear time and space, and can be evaluated in constant time.
Martin Dietzfelbinger, Friedhelm Meyer auf der Heide   +1 more
openaire   +1 more source

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