{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T08:54:03Z","timestamp":1676451243826},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2011,12]]},"abstract":"<jats:p> 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. <\/jats:p>","DOI":"10.1142\/s1793830911001425","type":"journal-article","created":{"date-parts":[[2012,1,4]],"date-time":"2012-01-04T19:00:28Z","timestamp":1325703628000},"page":"587-607","source":"Crossref","is-referenced-by-count":5,"title":["FUZZY UNIVERSAL HASHING AND APPROXIMATE AUTHENTICATION"],"prefix":"10.1142","volume":"03","author":[{"given":"REIHANEH","family":"SAFAVI-NAINI","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Calgary, Canada"}]},{"given":"DONGVU","family":"TONIEN","sequence":"additional","affiliation":[{"name":"Mathematical Sciences Institute, Australian National University, Australia"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1694"},{"key":"rf7","volume-title":"Guide to Biometrics","author":"Bolle R.","year":"2003"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(99)00055-2"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90122-2"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01388651"},{"key":"rf23","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90033-7"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830911001425","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T01:40:50Z","timestamp":1565142050000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830911001425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":7,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2011,12]]}},"alternative-id":["10.1142\/S1793830911001425"],"URL":"https:\/\/doi.org\/10.1142\/s1793830911001425","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}