Results 171 to 180 of about 17,753 (215)

Quantum hashing via ∈-universal hashing constructions and classical fingerprinting

Lobachevskii Journal of Mathematics, 2015
© 2015, Pleiades Publishing, Ltd. In the paper, we define the concept of the quantum hash generator and offer design, which allows to build a large amount of different quantum hash functions. The construction is based on composition of classical ∈-universal hash family and a given family of functions-quantum hash generator.
Ablayev F., Ablayev M.
openaire   +4 more sources

Energy Scalable Universal Hashing

IEEE Transactions on Computers, 2005
Message authentication codes (MACs) are valuable tools for ensuring the integrity of messages. MACs may be built around a universal hash function (NH) which was explored in the construction of UMAC. In this paper, we use a variation on NH called WH. WH reaches optimally in the sense that it is universal with half the hash length of NH and it achieves ...
K. Yuksel, Berk Sunar, Jens-Peter Kaps
openaire   +2 more sources

Universal hash functions for an infinite universe and hash trees

Information Processing Letters, 2009
In this note we describe the adaptation of the universal hashing idea to an infinite universe, and to prefix hash trees. These are a structure underlying all extendible hash methods, which have up to now only been studied under the uniform hashing assumption.
openaire   +2 more sources

Universal Hashing and Geometric Codes

Designs, Codes and Cryptography, 1997
A universal class of hash functions is, grosso modo, a collection of hash functions such that a random choice of a function in the set yields a low probability that any two distinct inputs will collide. The concept is due to Carter and Wegman, and has numerous applications. (See the introduction to [\textit{D. R.
openaire   +2 more sources

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.
Safavi-Naini, Rei, Tonien, Joseph
openaire   +3 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
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 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