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: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2014
|
| Online Access: | http://www.scopus.com/inward/record.url?eid=2-s2.0-33745661204&partnerID=40&md5=31c0bde5858dc2a710cfc0bfa5f5b695 http://cmuir.cmu.ac.th/handle/6653943832/5064 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Language: | English |