Results 171 to 180 of about 945,337 (242)

More Efficient Privacy Amplification with Non-Uniform Random Seeds via Dual Universal Hash Function.

, 2013
Masahito Hayashi, Toyohiro Tsurumaru
openalex   +1 more source

On almost-universal multilinear modular hashing with composite moduli

, 2015
Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh   +2 more
openalex   +1 more source

Time trends in new diagnoses of 19 long-term conditions: a population-level cohort study in England using OpenSAFELY

Russell MD, Schaffer A, Bechman K, Gibson M, Massey J, Higgins R, MacKenna B, Inglesby P, Bacon S, Mehrkar A, Goldacre B, Alveyn E, Allen V, Yang Z, Patel S, Adas MA, Sandhu G, Price E, Gama RM, Bramham K, Hotopf M, Norton S, Cope AP, Galloway JB.   +23 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Universal hashing

Introduction to Coding Theory, 2018
Using universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see definition below). This guarantees a low number of collisions in
Juergen Bierbrauer
openaire   +2 more sources

Quantum hashing via ∈-universal hashing constructions and classical fingerprinting

Lobachevskii Journal of Mathematics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ablayev F., Ablayev M.
openaire   +4 more sources

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

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.
J. Bierbrauer
openaire   +2 more sources