Results 1 to 10 of about 1,084,157 (220)
Regular and almost universal hashing: an efficient implementation [PDF]
Software: Practice and Experience 47 (10), 2017, 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 same hash value is low given that we pick hash functions at random.
Dmytro Ivanchykhin +2 more
arxiv +8 more sources
The universality of iterated hashing over variable-length strings [PDF]
Discrete Applied Mathematics 160 (4-5), 604--617 (2012), 2010 Iterated hash functions process strings recursively, one character at a time. At each iteration, they compute a new hash value from the preceding hash value and the next character. We prove that iterated hashing can be pairwise independent, but never 3-wise independent. We show that it can be almost universal over strings much longer than the number of
Daniel Lemire
arxiv +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
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 +3 more sources
Hash Property and Fixed-rate Universal Coding Theorems [PDF]
IEEE Transactions on Information Theory, vol. 56, no. 6, pp.
2688-2698, June 2010. Corrections: IEEE Transactions on Information Theory,
vol. 58, no. 5, pp. 3305-3307, May 2012, 2008 The aim of this paper is to prove the achievability of fixed-rate universal coding problems by using our previously introduced notion of hash property. These problems are the fixed-rate lossless universal source coding problem and the fixed-rate universal channel coding problem.
Jun Muramatsu, Shigeki Miyake
arxiv +3 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
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
Explicit Wiretap Channel Codes via Source Coding, Universal Hashing, and Distribution Approximation, When the Channels' Statistics are Uncertain [PDF]
IEEE Transactions on Information Forensics and Security, 2020 We consider wiretap channels with uncertainty on the eavesdropper channel under (i) noisy blockwise type II, (ii) compound, or (iii) arbitrarily varying models.
Rémi A. Chou
openalex +3 more sources
Universal hash functions from quantum procedures
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 Modern quantum technologies are NISQ (Noisy Intermediate-Scale Quantum) devices, which are used to create insufficiently accurate quantum computers with low computing power.
F.M. Ablayev, M.T. Ziatdinov
doaj +2 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