arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1511.08020cs.ITmath.IT
收藏

使用猜测附件进行身份验证

Authentication With a Guessing Adversary

Farshad Naghibi, Tobias J. Oechtering, Mikael Skoglund

摘要:

在本文中,我们考虑的认证问题,由一个身份不明的用户提出的候选人的测量相比,以前存储的测量的合法用户,注册,相对于一定的失真认证标准。攻击者希望通过猜测注册来冒充合法用户,直到系统对其进行身份验证。对于这种设置,我们研究所需的猜测(平均)的最小数量的对手一个成功的模仿攻击,并找到完整的表征的渐近指数的度量,称为欺骗指数。我们的结果是Arikan和Merhav [19]关于Guessing问题的结果的直接应用。为了验证[19]中的工作,我们还将该结果扩展到对手可以访问与注册数据相关的附加辅助信息的情况。本文是IEEE WIFS 2015提交的修订版,与会议版本相比,对论文的引用[19]进行了澄清。

英文摘要:

In this paper, we consider the authentication problem where a candidate measurement presented by an unidentified user is compared to a previously stored measurement of the legitimate user, the enrollment, with respect to a certain distortion criteria for authentication. An adversary wishes to impersonate the legitimate user by guessing the enrollment until the system authenticates him. For this setting, we study the minimum number of required guesses (on average) by the adversary for a successful impersonation attack and find the complete characterization of the asymptotic exponent of this metric, referred to as the deception exponent. Our result is a direct application of the results of the Guessing problem by Arikan and Merhav [19]. Paralleling the work in [19] we also extend this result to the case where the adversary may have access to additional side information correlated to the enrollment data. The paper is a revised version of a submission to IEEE WIFS 2015, with the referencing to the paper [19] clarified compared with the conference version.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑