Results 1 to 10 of about 915,235 (218)
QKD parameter estimation by two-universal hashing [PDF]
Quantum, 2023 This paper proposes and proves security of a QKD protocol which uses two-universal hashing instead of random sampling to estimate the number of bit flip and phase flip errors.
Dimiter Ostrev
doaj +5 more sources
Multimixer-128: Universal Keyed Hashing Based on Integer Multiplication
IACR Transactions on Symmetric Cryptology, 2023 In this paper we introduce a new keyed hash function based on 32-bit integer multiplication that we call Multimixer-128. In our approach, we follow the key-then-hash parallel paradigm. So, we first add a variable length input message to a secret key and
Koustabh Ghosh +2 more
doaj +4 more sources
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 Atıcı, D. R. Stinson
semanticscholar +4 more sources
The computational complexity of universal hashing [PDF]
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
semanticscholar +6 more sources
Regular and almost universal hashing: an efficient implementation [PDF]
Software: Practice and Experience, 2016 Random hashing can provide guarantees regarding the performance of data structures such as hash tables – even in an adversarial setting. Many existing families of hash functions are universal: given two data objects, the probability that they have the ...
Dmytro Ivanchykhin +2 more
semanticscholar +7 more sources
Variationally universal hashing [PDF]
Information Processing Letters, 2006 The strongest well-known measure for the quality of a universal hash-function family H is its being e-strongly universal, which measures, for randomly chosen h ∈ H, one's inability to guess h(m') even if h(m) is known for some m ≠ m' We give example applications in which this measure is too weak, and we introduce a stronger measure for the quality of a
Ted Krovetz, Phillip Rogaway
openalex +4 more sources
Universal Hashing for Information-Theoretic Security [PDF]
Proceedings of the IEEE, 2014 Corrected an error in the proof of Lemma ...
Himanshu Tyagi, A. Vardy
semanticscholar +5 more sources
ForestDSH: a universal hash design for discrete probability distributions [PDF]
Data Mining and Knowledge Discovery, 2021 45 pages,11 ...
Arash Gholami Davoodi +5 more
openalex +5 more sources
Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters [PDF]
Symposium on the Theory of ComputingOrthogonal arrays are a type of combinatorial design that emerged in the 1940s in the design of statistical experiments. In 1947, Rao proved a lower bound on the size of any orthogonal array, and raised the problem of constructing arrays of minimum size.
Nicholas J. A. Harvey, Arvin Sahami
openalex +3 more sources
Construction of universal one-way hash functions: Tree hashing revisited
Discrete Applied Mathematics, 2007 AbstractWe present a binary tree based parallel algorithm for extending the domain of a universal one-way hash function (UOWHF). For t⩾2, our algorithm extends the domain from the set of all n-bit strings to the set of all ((2t-1)(n-m)+m)-bit strings, where m is the length of the message digest. The associated increase in key length is 2m bits for t=2;
Palash Sarkar
openalex +3 more sources