Hardness-Preserving Reductions via Cuckoo Hashing
Abstract The focus of this work is hardness-preserving transformations of somewhat limited pseudorandom functions families (PRFs) into ones with more versatile characteristics. Consider the problem of domain extension of pseudorandom functions: given a PRF that takes as input elements...
Main Authors: | Berman, Itay, Haitner, Iftach, Komargodski, Ilan, Naor, Moni |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Springer US
2021
|
Online Access: | https://hdl.handle.net/1721.1/131491 |
Similar Items
-
Bipartite Random Graphs and Cuckoo Hashing
by: Reinhard Kutzelnigg
Published: (2006-01-01) -
A further analysis of Cuckoo Hashing with a Stash and Random Graphs of Excess r
by: Reinhard Kutzelnigg
Published: (2010-01-01) -
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing
by: Brakerski, Zvika, et al.
Published: (2021) -
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing
by: Brakerski, Zvika, et al.
Published: (2022) -
Adversarially robust property-preserving hash functions
by: LaVigne, Rio (Kristen Rio), et al.
Published: (2021)