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 |
| 会议日期 | June 25, 2012 - June 27, 2012 |
| 会议地点 | Liverpool, United kingdom |
| 关键词 | Ubiquitous computing |
| 页码 | 674-681 |
| 中文摘要 | 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. |
| 收录类别 | EI |
| 会议主办者 | University of Bradford; IEEE Technical Committee on Scalable Computing (TCSC); IEEE; IEEE Computer Society |
| 会议录 | 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
 |
| 语种 | 英语 |
| ISBN号 | 9780769547459 |
| 源URL | [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]. 见:11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom-2012. Liverpool, United kingdom. June 25, 2012 - June 27, 2012. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。