Results 141 to 150 of about 44,375 (171)
Some of the next articles are maybe not open access.
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 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
A caution on universal classes of hash functions
Information Processing Letters, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Analysis of a universal class of hash functions
1978In 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 +2 more
openaire +1 more source
On the program size of perfect and universal hash functions
23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), 1982We address the question of program size of of perfect and universal hash functions. We prove matching upper and lower bounds (up to constant factors) on program size. Furthermore, we show that minimum or nearly minimum size programs can be found efficiently.
openaire +2 more sources
Aggregated Authentication (AMAC) Using Universal Hash Functions
2009Aggregation 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 +2 more
openaire +2 more sources
Universal one-way hash functions and their cryptographic applications
Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89, 1989We define a Universal One-Way Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x. We prove constructively that universal one-way hash functions exist if any 1-1 one-way functions exist.Among the various applications of the primitive is a ...
Moni Naor, Moti Yung
openaire +1 more source
A new universal class of hash functions and dynamic hashing in real time
2005The 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 +1 more
openaire +1 more source
On the Universal Hash Functions in Luby-Rackoff Cipher
2003It is known that a super-pseudorandom permutation on 2n bits can be obtained from a random function f on n bits and two bisymmetric and AXU hash functions h1 and h2 on n bits. It has a Feistel type structure which is usually denoted by φ(h1, f, f, h2).
Tetsu Iwata, Kaoru Kurosawa
openaire +2 more sources
New Constructions of Universal Hash Functions Based on Function Sums
2006In this paper, we propose a generalization of the SQUARE hash function family to the function sum hash, which is based on functions with low maximal differential over arbitrary Abelian groups. These new variants allow the designer to construct SQUARE-like hash functions on different platforms for efficient and secure message authentication.
Khoongming Khoo, Swee-Huay Heng
openaire +1 more source
Source coding using a class of universal hash functions
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004We consider a source coding scheme in which we use a mapping f /spl isin/ /spl Fscr/ as an encoder, where /spl Fscr/ is a class of universal hash functions. It is shown that, if /spl Fscr/ satisfies a certain condition, for any discrete source there exist an encoder using an f /spl isin/ /spl Fscr/ and a decoder such that the decoding error probability
openaire +1 more source