arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1409.1657cs.ITcs.CRmath.IT
收藏

噪声模型下无密钥认证的最优性

On the Optimality of Keyless Authentication in a Noisy Model

Shaoquan Jiang

摘要:

我们进一步研究了噪声模型下的无密钥认证问题,在此模型中,发送方Alice和接收方Bob之间没有秘密设置,而Alice和Bob之间存在DMC $W_1$,并且它们之间存在双向无噪声但不安全的信道.我们提出了一种结构,使得在DMC $W_1$的消息长度不依赖于源空间的大小。如果源空间为${\cal S}$,$W_1$使用的通道数为$n$,则该协议的轮复杂度为$\log^*|{\cal S}|-\log^*n+4.$。此外,我们还证明了该模型中任何安全协议的轮复杂度的下界为$\log^*|{\cal S}|-\log^* n-5$。当DMC $W_1$上的消息长度给定时,我们还得到了成功概率的下界。最后,我们得到了一般DMC下的非交互式认证协议的容量,扩展了我们以前工作中BSC下的结果。

英文摘要:

We further study the keyless authentication problem in a noisy model in our previous work, where no secret setup is available for sender Alice and receiver Bob while there is DMC $W_1$ from Alice to Bob and a two-way noiseless but insecure channel between them. We propose a construction such that the message length over DMC $W_1$ does not depend on the size of the source space. If the source space is ${\cal S}$ and the number of channel $W_1$ uses is $n$, then our protocol only has a round complexity of $\log^*|{\cal S}|-\log^*n+4.$ In addition, we show that the round complexity of any secure protocol in our model is lower bounded by $\log^*|{\cal S}|-\log^* n-5$. We also obtain a lower bound on the success probability when the message size on DMC $W_1$ is given. Finally, we derive the capacity for a non-interactive authentication protocol under general DMCs, which extends the result under BSCs in our previous work.

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

↑