Institutional Repository
| offline rfid grouping proofs with trusted timestamps | |
| Ma Cunqing; Lin Jingqiang; Wang Yuewu; Shang Ming | |
| 2012 | |
| Conference Name | 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom-2012 |
| Source | 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 |
| Pages | 674-681 |
| Conference Date | June 25, 2012 - June 27, 2012 |
| Conference Place | Liverpool, United kingdom |
| Indexed Type | EI |
| ISBN | 9780769547459 |
| Department | (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 |
| English Abstract | 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. |
| Keyword | Ubiquitous Computing |
| Sponsorship | University of Bradford; IEEE Technical Committee on Scalable Computing (TCSC); IEEE; IEEE Computer Society |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15958 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Ma Cunqing,Lin Jingqiang,Wang Yuewu,et al. offline rfid grouping proofs with trusted timestamps[C],2012:674-681. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment