摘要： 在Juels模型下，证明Rhee协议具有不可区分的强隐私性，并得到确切的安全界。协议的证明使用基于Game的方法和Shoup引理确定相邻Game之间可区分的概率上界，由于概率上界是可忽略的，因此将协议的不可区分的隐私性归约到随机预言机存在的假设上。该证明技术能够用于分析和解决无线射频识别系统安全性问题。
关键词:
无线射频识别,
安全模型,
强隐私性,
可证明安全,
随机预言机,
认证协议
Abstract: By using the Juels model, a formal proof is given that the output of the Rhee protocol preserves privacy, denotes as ind-privacy. The accurate security boundary of the Rhee protocol is computed rigorously. The privacy of protocol is reduced tightly to assumption that the Random Oracle is existed by utilizing the Game-based technique and the Shoup lemma which can distinguish adjacent game with the negligible probability of upper bound. This technique is a powerful tool for analyzing and solving the privacy problem of Radio Frequency Identification(RFID)system, and provides an effective and universal solution in the future.
Key words:
Radio Frequency Identification(RFID),
security model,
strong privacy,
provable security,
Random Oracle,
authentication protocol
中图分类号:
邓强东, 王立斌. Rhee协议的安全性证明[J]. 计算机工程, 2012, 38(5): 155-157.
DENG Jiang-Dong, WANG Li-Bin. Security Proof for Rhee Protocol[J]. Computer Engineering, 2012, 38(5): 155-157.