Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being ε-strongly universal, which measures, for randomly chosen h ∈ H, one's inability to guess h (m′) even if h (m) is known for some m ≠ m′. We give example applications in which this measure is too...
Saved in:
Main Authors: | Ted Krovetz, Phillip Rogaway |
---|---|
Format: | Journal |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=33745661204&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/61605 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
Variationally universal hashing
by: Krovetz T., et al.
Published: (2014) -
Formalizing human ignorance collision-resistant hashing without the keys
by: Phillip Rogaway
Published: (2018) -
Deep variational and structural hashing
by: Liong, Venice Erin, et al.
Published: (2020) -
Cross-Modal Deep Variational Hashing
by: Liong, Venice Erin, et al.
Published: (2017) -
Deep learning with application to hashing
by: Zhang, Boshen
Published: (2014)