NLHB：一个非线性Hopper Blum协议
NLHB : A Non-Linear Hopper Blum Protocol
摘要：
在本文中，我们提出了一个轻量级的可证明安全的认证协议称为NLHB协议，这是HB协议的变体。HB协议使用解码线性码的复杂性来防止被动攻击。与此相反，NLHB协议的安全性证明减少被动攻击的问题，一类非线性代码的解码是证明困难。我们证明了现有的被动攻击HB协议族，这有助于大大减少其有效的密钥大小，对NLHB协议是无效的。从证据中，我们得出结论，较小的密钥大小是足够的NLHB协议实现相同级别的被动攻击的安全性作为HB协议。此外，对于这种参数的选择，我们提供了一个实施例的NLHB协议的证明者/验证者的复杂性低于HB协议，使认证非常低成本的设备，如RFID标签。最后，在HB $^{+}$协议的精神，我们扩展了NLHB协议的NLHB $^{+}$协议，并证明了对DET模型中定义的主动攻击类的安全性。
英文摘要：
In this paper, we propose a light-weight provably-secure authentication protocol called the NLHB protocol, which is a variant of the HB protocol. The HB protocol uses the complexity of decoding linear codes for security against passive attacks. In contrast, security for the NLHB protocol is proved by reducing passive attacks to the problem of decoding a class of non-linear codes that are provably hard. We demonstrate that the existing passive attacks on the HB protocol family, which have contributed to considerable reduction in its effective key-size, are ineffective against the NLHB protocol. From the evidence, we conclude that smaller-key sizes are sufficient for the NLHB protocol to achieve the same level of passive attack security as the HB Protocol. Further, for this choice of parameters, we provide an implementation instance for the NLHB protocol for which the Prover/Verifier complexity is lower than the HB protocol, enabling authentication on very low-cost devices like RFID tags. Finally, in the spirit of the HB$^{+}$ protocol, we extend the NLHB protocol to the NLHB$^{+}$ protocol and prove security against the class of active attacks defined in the DET Model.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
