Universal Hashing
Universal Hashing is a family of hash functions selected in such a way that the probability of collision between any two distinct keys is minimized uniformly across all pairs, thereby providing a probabilistic guarantee of performance in hash-based algorithms and cryptographic constructions.
134
Publications
11.7K
Citations
231
Authors
129
Institutions
Publications per year
2017–2026
10
134
Universal classes of hash functions
J.Lawrence Carter, Mark N. Wegman · Journal of Computer and System Sciences · 1979 · 2.6K citations
Universal one-way hash functions and their cryptographic applications
A complexity theoretic approach to randomness
Michael Sipser · 1983 · 470 citations · Full text
Universal classes of hash functions (Extended Abstract)
J. Lawrence Carter, Mark N. Wegman · 1977 · 349 citations · Full text
1–5 of 134
231
9
h-index
6
h-index
6
h-index
5
h-index
4
h-index
1–5 of 231
129
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
7 h-index
11 publications
10K citations
National University of Singapore
Singapore, Singapore
6 h-index
8 publications
302 citations

Indian Statistical Institute
Kolkata, India
5 h-index
9 publications
147 citations

Indian Institute of Technology Bombay
Mumbai, India
4 h-index
6 publications
194 citations
IBM (United States)
Armonk, United States
4 h-index
4 publications
249 citations

University of Waterloo
Waterloo, Canada
4 h-index
5 publications
405 citations
AT&T (United States)
Bedminster, United States
4 h-index
6 publications
454 citations

IT University of Copenhagen
Copenhagen, Denmark
4 h-index
8 publications
351 citations
1–8 of 129
11 publications · 670 citations
11
h-index
10 publications · 760 citations
10
h-index
4 publications · 249 citations
4
h-index
4 publications · 4.1K citations
4
h-index
Repository · 3 publications · 88 citations
3
h-index
1–5