摘要: 现有无线射频识别(RFID)群证明方案中的群证明生成效率较低。针对该问题,基于椭圆曲线离散对数困难性问题,采用多重签名的思想,并行且匿名地生成群证明。理论分析结果表明,该方案满足安全性和隐私性要求,与同类方案相比,只需一次点乘即可生成群证明,效率更高。
关键词:
无线射频识别,
群证明,
匿名,
椭圆曲线,
可证明安全,
适应性选择消息攻击
Abstract: In order to solve the problem that efficiency of current grouping proof schemes is low, this paper constructs a disordered and anonymous grouping proof Radio Frequency Identification(RFID) protocol based on elliptic curve discrete logarithm problem. This grouping proof protocol is disorderly created using the method of multiple signatures. The new scheme is proved to be secure and untracked, and compared with existed schemes, it uses only one scalar multiplication.
Key words:
Radio Frequency Identification(RFID),
grouping proof,
anonymous,
elliptic curve,
provable secure,
adaptive chosen message attack
中图分类号:
杨震, 彭长根, 丁红发. 一种无序匿名的RFID群证明方案[J]. 计算机工程, 2012, 38(20): 85-88.
YANG Shen, BANG Chang-Gen, DING Gong-Fa. A Disordered and Anonymous RFID Grouping Proof Scheme[J]. Computer Engineering, 2012, 38(20): 85-88.