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

Authors

231

  1. DR
    Douglas R. Stinson

    University of Waterloo, Canada

    9 publications · 884 citations

    9

    h-index

  2. RP
    Rasmus Pagh

    IT University of Copenhagen, Denmark

    6 publications · 298 citations

    6

    h-index

  3. PS
    Palash Sarkar

    Indian Statistical Institute, India

    6 publications · 115 citations

    6

    h-index

  4. KS
    Kuldeep S. Meel

    National University of Singapore, Singapore

    5 publications · 155 citations

    5

    h-index

  5. SC
    Supratik Chakraborty

    Indian Institute of Technology Bombay, India

    4 publications · 135 citations

    4

    h-index

1–5 of 231

Venues

  1. Designs Codes and Cryptography

    11 publications · 670 citations

    11

    h-index

  2. IEEE Transactions on Information Theory

    10 publications · 760 citations

    10

    h-index

  3. SIAM Journal on Computing

    4 publications · 249 citations

    4

    h-index

  4. Journal of Computer and System Sciences

    4 publications · 4.1K citations

    4

    h-index

  5. arXiv (Cornell University)

    Repository · 3 publications · 88 citations

    3

    h-index

1–5