Mobility

Study on an Elliptic Curve Based Grouping-Proof Protocol for RFID

Download Now Free registration required

Executive Summary

Due to small key size and computational efficiency, ECC-based algorithm maybe a good choice to solve the requirements of RFID system among public-key cryptographic algorithms. In this paper, using the security analysis method of lv et al., the authors can find that Lin et al. proposed a privacy-preserving grouping proof protocol for RFID based on ECC is not secure against the tracking attack. Their proofs of security was analyzed and discussed. Finally, they propose a revised protocol to resist the tracking attack. The protocol reduces the workload of tags, and enhances the security and efficiency.

  • Format: PDF
  • Size: 766.75 KB