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 |
| id |
th-cmuir.6653943832-5064 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-50642014-08-30T02:56:07Z Variationally universal hashing Krovetz T. Rogaway P. 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 weak, and we introduce a stronger measure for the quality of a hash-function family, ε-variationally universal, which measures one's inability to distinguish h (m′) from a random value even if h (m) is known for some m ≠ m′. We explain the utility of this notion and provide an approach for constructing efficiently computable ε-VU hash-function families. © 2006 Elsevier B.V. All rights reserved. 2014-08-30T02:56:07Z 2014-08-30T02:56:07Z 2006 Article 00200190 10.1016/j.ipl.2005.11.026 IFPLA http://www.scopus.com/inward/record.url?eid=2-s2.0-33745661204&partnerID=40&md5=31c0bde5858dc2a710cfc0bfa5f5b695 http://cmuir.cmu.ac.th/handle/6653943832/5064 English |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| language |
English |
| description |
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 weak, and we introduce a stronger measure for the quality of a hash-function family, ε-variationally universal, which measures one's inability to distinguish h (m′) from a random value even if h (m) is known for some m ≠ m′. We explain the utility of this notion and provide an approach for constructing efficiently computable ε-VU hash-function families. © 2006 Elsevier B.V. All rights reserved. |
| format |
Article |
| author |
Krovetz T. Rogaway P. |
| spellingShingle |
Krovetz T. Rogaway P. Variationally universal hashing |
| author_facet |
Krovetz T. Rogaway P. |
| author_sort |
Krovetz T. |
| title |
Variationally universal hashing |
| title_short |
Variationally universal hashing |
| title_full |
Variationally universal hashing |
| title_fullStr |
Variationally universal hashing |
| title_full_unstemmed |
Variationally universal hashing |
| title_sort |
variationally universal hashing |
| publishDate |
2014 |
| url |
http://www.scopus.com/inward/record.url?eid=2-s2.0-33745661204&partnerID=40&md5=31c0bde5858dc2a710cfc0bfa5f5b695 http://cmuir.cmu.ac.th/handle/6653943832/5064 |
| _version_ |
1681420354873982976 |