A Lightweight Privacy-Preserving Grouping Proof Protocol for RFID Systems

GUO Yi-min; LI Shun-dong; CHEN Zhen-hua; LIU Xin

doi:10.3969/j.issn.0372-2112.2015.02.013

您当前的位置：

首页 >

文章列表页 >

A Lightweight Privacy-Preserving Grouping Proof Protocol for RFID Systems

更新时间：2025-07-16

- A Lightweight Privacy-Preserving Grouping Proof Protocol for RFID Systems
- Acta Electronica Sinica Vol. 43, Issue 2, Pages: 289-292(2015)
- 作者机构：
  
  陕西师范大学计算机科学学院,陕西,西安,710119
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.61070189, No.61272435, No.61373020)
- DOI：10.3969/j.issn.0372-2112.2015.02.013
  CLC： TP393.08
- Published：2015
- 稿件说明：
移动端阅览
GUO Yi-min, LI Shun-dong, CHEN Zhen-hua, et al. A Lightweight Privacy-Preserving Grouping Proof Protocol for RFID Systems[J]. Acta Electronica Sinica, 2015, 43(2): 289-292.
DOI：

GUO Yi-min, LI Shun-dong, CHEN Zhen-hua, et al. A Lightweight Privacy-Preserving Grouping Proof Protocol for RFID Systems[J]. Acta Electronica Sinica, 2015, 43(2): 289-292. DOI： 10.3969/j.issn.0372-2112.2015.02.013.

摘要

设计高效安全的群组证明协议有利于RFID(Radio Frequency Identification)系统的广泛应用.本文提出了一种轻量级隐私保护的RFID群组证明协议LPGP(Lightweight Privacy-Preserving Grouping Proof)

LPGP协议只使用计算复杂度比较小的伪随机发生器和散列运算来提高协议的运行效率

并且LPGP协议具有认证性、隐私性和可证明安全性

满足了RFID系统群组证明协议的安全性要求.与现有的群组证明协议相比

LPGP协议的标签只需较小的计算复杂度和存储空间

具有较高的效率.

Abstract

Efficient and secure grouping proof protocols are necessary for RFID applications.This paper proposes a lightweight privacy-preserving grouping proof (LPGP) protocol for RFID systems

which uses only a pseudo-random generator with relatively lower computational complexity and a hash algorithm to improve the operating efficiency.The LPGP protocol can provide privacy

authentication and provably security

and can meet the security requirements of grouping proofs for RFID systems.Compared with existing grouping proofs protocols

the tags in the LPGP only need a small computational cost and small require storage space

thus LPGP is more effective than other grouping proofs protocols.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

An Automatic Construction Method of Indistinguishable Obfuscation for Generic Computing Circuits

Two Efficient Hierarchical Identity Based Signature Schemes

A New Message Authentication Code and Its Security Proof

Public Key Timed-Release Searchable Encryption in One-to-Many Scenarios

Related Author

LI Yu

HAN Yi-liang

ZHU Shuai-shuai

王大印

温巧燕

徐津

WANG Yan-ming

ZHANG Fang-guo

Related Institution

Engineering College of Cryptography， Engineering University of the APF

Network and Information Security Key Laboratory of APF

State Key Laboratory of Information Security,Institute of Software,Chinese Academy of Science

Beijing Electronic Science and Technology Institute

State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications

⁰