A Fully-Secure RFID Authentication Protocol from Exact LPN Assumption

A Fully-Secure RFID Authentication Protocol from Exact LPN Assumption
复制标题

DOI:
10.1109/trustcom.2013.17
复制
发表时间:
2013-07
期刊:
2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications
影响因子:
--
通讯作者:
M. Mamun;A. Miyaji
M. Mamun;A. Miyaji
中科院分区:
其他
文献类型:
--
作者:
M. Mamun;A. Miyaji

文献摘要

相似文献

近年来,针对RFID系统提出了几种轻量级的密码解决方案。HB-族是一个很有前途的协议系列,基于学习奇偶性与噪声(LPN)问题的困难。HB系列中的大多数协议由于安全信道假设而不适合移动的/无线读取器应用。在本文中,我们提出了一个完全安全的协同相互认证协议的RFID系统中的两个通道标签阅读器和阅读器服务器被认为是不安全的。更确切地说,我们引入了一个新的变种的HB协议,其中完整的RFID系统进行认证下基于LPN的承诺计划,利用完美的计算隐藏承诺计划,伪逆矩阵和随机希尔密码的属性。此外,通过详细的安全性和隐私性分析,我们表明,我们的计划达到所需的安全性和隐私性,而不是随机预言模型,但标准模型。
In the recent years, several light-weight cryptographic solutions have been proposed for RFID system. HB-family is one of promising protocol series, based on the hardness of the Learning Parity with Noise (LPN) problem. Most protocols in HB-family are not suited for mobile/wireless reader applications due to secure channel assumptions. In this paper, we present a fully secure collaborative mutual authentication protocol for an RFID system where both channels tag-reader and reader-server are considered to be insecure. More precisely, we introduce a new variant of an HB-like protocol where the complete RFID system is authenticated under LPN-based commitment scheme by taking advantages of properties of perfect computational hiding commitment scheme, pseudo inverse matrix, and randomized Hill cipher. In addition, through detailed security and privacy analysis, we show that our scheme achieves required security and privacy properties, under not the random oracle model, but the standard model.