Results 11 to 20 of about 1,013,929 (223)
Universal Hashing and Multiple Authentication [PDF]
Annual International Cryptology Conference, 1996 In this paper, we study unconditionally secure codes that provide authentication without secrecy. Our point of view is the universal hashing approach pioneered by Wegman and Carter in 1981. We first compare several recent universal-hashing based constructions for authentication codes.
Mustafa Atici, Douglas R. Stinson
semanticscholar +3 more sources
One-Time Universal Hashing Quantum Digital Signatures without Perfect Keys [PDF]
Physical Review Applied, 2023 Quantum digital signatures (QDS), generating correlated bit strings among three remote parties for signatures through quantum law, can guarantee non-repudiation, authenticity, and integrity of messages. Recently, one-time universal hashing QDS framework,
Bing-Hong Li +6 more
openalex +3 more sources
A Fast Single-Key Two-Level Universal Hash Function
IACR Transactions on Symmetric Cryptology, 2017 Universal hash functions based on univariate polynomials are well known, e.g. Poly1305 and GHASH. Using Horner’s rule to evaluate such hash functionsrequire l − 1 field multiplications for hashing a message consisting of l blocks where each block is one ...
Debrup Chakraborty +2 more
doaj +3 more sources
Universal Hashing for Information-Theoretic Security [PDF]
Proceedings of the IEEE, 2015 Corrected an error in the proof of Lemma ...
Himanshu Tyagi, Alexander Vardy
openaire +4 more sources
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing [PDF]
Theory of Computing, 2021 This paper uses a variant of the notion of inaccessible entropy (Haitner, Reingold, Vadhan and Wee, STOC 2009), to give an alternative construction and proof for the fundamental result, first proved by Rompel (STOC 1990), that Universal One-Way Hash ...
Iftach Haitner +4 more
openalex +3 more sources
The computational complexity of universal hashing
Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yishay Mansour +2 more
openaire +2 more sources
Software Performance of Universal Hash Functions [PDF]
, 1999 This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toeplitz hashing, division hashing, evaluation hashing, and MMH hashing. An objective comparison between these widely varying approaches is achieved by defining constructions that offer a ...
Nevelsteen, W., Preneel, Bart
openaire +3 more sources
Universal hashing and authentication codes [PDF]
Designs, Codes and Cryptography, 1994 In this paper (for a preliminary version see [Lect. Notes Comput. Sci. 576, 74-85 (1992; Zbl 0789.68050)]) the author studies the applications of universal hashing to the construction of unconditionally secure authentication codes without secrecy. He generalizes the construction given by \textit{M. N. Wegman} and \textit{J. L. Carter} [J. Comput. Syst.
Douglas R Stinson
openaire +3 more sources
AAAI Conference on Artificial IntelligenceDeep Hashing (DH)-based image retrieval has been widely applied to face-matching systems due to its accuracy and efficiency. However, this convenience comes with an increased risk of privacy leakage.
Long Tang +4 more
openalex +3 more sources
Quantum Hashing via Classical $ε$-universal Hashing Constructions [PDF]
CoRR, 2014 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.
Farid M. Ablayev, Marat Ablayev
+5 more sources