Cross referencing algorithm for identifying group completeness in RFID system

Tags and readers are two main components in RFID systems. Information delivery between these components is based on radio frequency. Comparing to bar codes, RFID provides the ability of reading and writing a great amount of information from and into tags simultaneously. As a result of existing RFID systems, factors such as noise interference can cause lacking of reliability and results in the read rate cannot reach 100%. The paper proposed a cross referencing algorithm which can mutually identify a complete group of tags using the information stored in these tags. The information is encrypted before it is written into tags. The method not only can improve the reading rate be identifying the missing tags, but can prevent re play attacks as well.

[1]  Kouichi Sakurai,et al.  Grouping proof for RFID tags , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).

[2]  Jung-Hui Chiu,et al.  Reading order independent grouping proof for RFID tags , 2008, 2008 IEEE International Conference on Intelligence and Security Informatics.

[3]  Selwyn Piramuthu,et al.  On Existence Proofs for Multiple RFID Tags , 2006, 2006 ACS/IEEE International Conference on Pervasive Services.

[4]  Ari Juels,et al.  "Yoking-proofs" for RFID tags , 2004, IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second.