Coding and Cryptology, Second International Workshop, IWCC 2009, Zhangjiajie, China, June 1-5, 2009. Proceedings
Coding and Cryptology, Second International Workshop, IWCC 2009, Zhangjiajie, China, June 1-5, 2009. Proceedings
复制标题
DOI：
10.1007/978-3-642-01877-0
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
Yeow Meng Chee;Zhenbo Guo;S. Ling;Fengjing Shao;Yuansheng Tang;Huaxiong Wang;C. Xing
中科院分区：
文献类型：
--
作者：
Yeow Meng Chee;Zhenbo Guo;S. Ling;Fengjing Shao;Yuansheng Tang;Huaxiong Wang;C. Xing
近似消息认证码(AMAC)自然出现在生物测定和多媒体应用中，其中明文是模糊的，并且其中为消息X计算的标签(x‘，t)应该通过验证测试。明文的模糊性可能是由多种因素造成的，包括对数据进行可接受的压缩和解压缩变换，或者传感器读取生物特征数据的不准确，提出了一个无条件安全设置的近似消息认证系统框架。给出了AMAC的形式化定义，分析了两种攻击：模仿攻击和替换攻击。在所有密钥都是等概率的假设下，我们得到了对手在这些攻击中的欺骗概率的下界。我们的界推广了经典认证理论中已知的组合界。
Approximate message authentication codes (AMAC) arise naturally in biometric and multimedia applications where plaintexts arefuzzyand a tagged message (x′,t) wheretis the calculated tag for a messagexthat is ‘close’ tox′ should pass the verification test. Fuzziness of plaintexts can be due to a variety of factors including applying acceptable transforms such as compression and decompression to data, or inaccuracy of sensors in reading biometric data.This paper develops a framework for approximate message authentication systems inunconditionally security setting. We give formal definition of AMAC and analyze two attacks, impersonation attack and substitution attack. We derive lower bounds on an opponent’s deception probability in these attacks under the assumption that all keys are equiprobable. Our bounds generalize known combinatorial bounds in classical authentication theory.