Paper 2009/609

Grouping-Proof Protocol for RFID Tags: Security Definition and Scalable Construction

Dang Nguyen Duc and Kwangjo Kim


In this paper, we propose a grouping-proof protocol for RFID tags based on secret sharing. Our proposed protocol addresses the scalability issue of the previous protocols by removing the need for an RFID reader to relay messages from one tag to another tag. We also present a security model for a secure grouping-proof protocol which properly addresses the so called \emph{mafia fraud atttack}. Mafia fraud attack (sometimes called distance fraud) is a simple relay attack suggested by Yvo Desmedt. Any location-based protocol including RFID protocols is vulnerable to this attack even if cryptography is used. One practical countermeasure to mafia fraud attack is to employ a distance-bounding protocol into a location-based protocol. However, in the light of work by Chandran et al., mafia fraud attack cannot be theoretically prevented. Therefore, we need to take hits fact into account in order to make sense about security notion for secure grouping-proof protocols.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
RFID SecurityYoking-ProofGrouping-ProofScalabilitySecurity Notion
Contact author(s)
nguyenduc @ icu ac kr
2009-12-09: received
Short URL
Creative Commons Attribution


      author = {Dang Nguyen Duc and Kwangjo Kim},
      title = {Grouping-Proof Protocol for RFID Tags: Security Definition and Scalable Construction},
      howpublished = {Cryptology ePrint Archive, Paper 2009/609},
      year = {2009},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.