Results 171 to 180 of about 18,375 (213)

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

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 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

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   +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

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

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.
Ablayev F., Ablayev M.
openaire   +3 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

Aggregated Authentication (AMAC) Using Universal Hash Functions

2009
Aggregation is a very important issue to reduce the energy consumption in Wireless Sensors Networks (WSNs). There is currently a lack of cryptographic primitives for authentication of aggregated data. The theoretical background for Aggregated Message Authentication Codes (AMACs) has been proposed by Chan and Castelluccia at ISIT 08.
Znaidi, Wassim, Lauradoux, Cédric, Minier, Marine   +2 more
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