FUZZY UNIVERSAL HASHING AND APPROXIMATE AUTHENTICATION
2011 ◽
Vol 03
(04)
◽
pp. 587-607
◽
Traditional data authentication systems are sensitive to single bit changes and so are unsuitable for message spaces that are naturally "fuzzy" where "similar" messages are considered "the same" or indistinguishable. In this paper, we study unconditionally secure approximate authentication. We generalize traditional universal hashing to fuzzy universal hashing and use it to construct secure approximate authentication for multiple messages.
2018 ◽
Vol 6
(9)
◽
pp. 723-731
2018 ◽
Vol 31
(1)
◽
pp. 277
◽
1974 ◽
Vol 8
(2)
◽
pp. 161-192
◽
Keyword(s):
Keyword(s):