offline rfid grouping proofs with trusted timestamps

ISCAS OpenIR

	offline rfid grouping proofs with trusted timestamps
	Ma Cunqing; Lin Jingqiang; Wang Yuewu; Shang Ming
	2012
会议名称	11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom-2012
会议录名称	Proc. of the 11th IEEE Int. Conference on Trust, Security and Privacy in Computing and Communications, TrustCom-2012 - 11th IEEE Int. Conference on Ubiquitous Computing and Communications, IUCC-2012
页码	674-681
会议日期	June 25, 2012 - June 27, 2012
会议地点	Liverpool, United kingdom
收录类别	EI
ISBN	9780769547459
部门归属	(1) State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China; (2) Graduate University of the Chinese Academy of Sciences Beijing China; (3) China National Software and Service Co. Ltd. Beijing China
摘要	With the wide deployment of RFID applications, RFID security issues are drawing more and more attention. The RFID grouping proof aims to provide a verifiable evidence that two or more RFID tags were scanned simultaneously. It extends the yoking proof for two RFID tags, to prove the coexistence of a set of tags (e.g., some drugs can only be sold in the existence of a prescription). In many grouping proof scenarios, the time when the grouping proof was generated is critical to judge whether a transaction is legal or not, and the protocol usually should work in offline mode. Although lots of grouping proof protocols with various features have been proposed, they either work in online mode or have difficulties in generating a grouping proof with the precise transaction time in offline mode. Therefore, we propose a protocol to generate offline RFID grouping proofs with trusted timestamps, where the verifier can obtain the precise transaction time. As far as we know, it is the first practical offline grouping proof protocol that includes the precise transaction time. Properties, performance evaluation and security analysis of our design are also presented in this paper. © 2012 IEEE.; With the wide deployment of RFID applications, RFID security issues are drawing more and more attention. The RFID grouping proof aims to provide a verifiable evidence that two or more RFID tags were scanned simultaneously. It extends the yoking proof for two RFID tags, to prove the coexistence of a set of tags (e.g., some drugs can only be sold in the existence of a prescription). In many grouping proof scenarios, the time when the grouping proof was generated is critical to judge whether a transaction is legal or not, and the protocol usually should work in offline mode. Although lots of grouping proof protocols with various features have been proposed, they either work in online mode or have difficulties in generating a grouping proof with the precise transaction time in offline mode. Therefore, we propose a protocol to generate offline RFID grouping proofs with trusted timestamps, where the verifier can obtain the precise transaction time. As far as we know, it is the first practical offline grouping proof protocol that includes the precise transaction time. Properties, performance evaluation and security analysis of our design are also presented in this paper. © 2012 IEEE.
关键词	Ubiquitous Computing
主办者	University of Bradford; IEEE Technical Committee on Scalable Computing (TCSC); IEEE; IEEE Computer Society
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15958
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Ma Cunqing,Lin Jingqiang,Wang Yuewu,et al. offline rfid grouping proofs with trusted timestamps[C],2012:674-681.