Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,930,506 papers from all fields of science
Search
Sign In
Create Free Account
Universal hashing
Known as:
Universal family
, Universal hashing function
, Universal hash
Expand
In mathematics and computing universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
28 relations
Broader (1)
Computational complexity theory
Cryptography
Cuckoo hashing
Double hashing
Dynamic perfect hashing
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Stable pair compactifications of the moduli space of degree one del pezzo surfaces via elliptic fibrations
Kenneth Ascher
,
Dori Bejleri
2018
Corpus ID: 54001301
A degree one del Pezzo surface is the blowup of P^2 at 8 general points. By the classical Cayley-Bacharach Theorem, there is a…
Expand
2014
2014
Quantum Hashing via Classical $\epsilon$-universal Hashing Constructions
F. Ablayev
,
M. Ablayev
2014
Corpus ID: 6694689
In the paper, we define the concept of the quantum hash generator and offer design, which allows to build a large amount of…
Expand
2013
2013
Properties of universal hashing
Martin Babka
2013
Corpus ID: 216023624
The aim of this work is to create a model of hashing with an acceptable worst case time complexity. The model is based on the…
Expand
2010
2010
Exotic components of the toric Hilbert scheme
R. Birkner
2010
Corpus ID: 120783474
We introduce an explicit construction of the non-coherent components of toric Hilbert schemes. In particular, we show that the…
Expand
2009
2009
New combinatorial bounds for universal hash functions
L. Nguyen
,
A. W. Roscoe
IACR Cryptology ePrint Archive
2009
Corpus ID: 8346639
Using combinatorial analysis, we introduce a new lower bound for the key length in an almost universal hash function, which is…
Expand
2009
2009
Minimal rational curves on complete toric manifolds
Baohua Fu
,
Jun-Muk Hwang
2009
Corpus ID: 115179930
We shall show that the variety of minimal rational tangents on a complete toric manifold X is linear and minimal components in…
Expand
2008
2008
A New Universal Hash Function and Other Cryptographic Algorithms Suitable for Resource Constrained Devices
P. Sarkar
2008
Corpus ID: 1396403
A new multi-linear universal hash family is described. Messages are sequences over a finite field IFq while keys are sequences…
Expand
2008
2008
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
M. Ahmadi
,
Stephan Wong
IEEE GLOBECOM - IEEE Global Telecommunications…
2008
Corpus ID: 18698380
A bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support…
Expand
2004
2004
Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters
Wen-Guey Tzeng
IEEE transactions on computers
2004
Corpus ID: 35629278
We propose efficient and secure (string) oblivious transfer (OT/sup 1//sub n/) schemes for any n/spl ges/2. We build our OT/sup 1…
Expand
1975
1975
On the dimension of varieties of special divisors, II
R. Lax
1975
Corpus ID: 122125549
. Let Tg denote the TeichmUIler space and let V denote the universal family of TeichmUIler surfaces of genus g. Let V>fl denote…
Expand