Generalized “Yoking-Proofs” for a Group of RFID Tags

Recently Ari Juels suggested a yoking-proof where a pair of radio-frequency identication (RFID) tags are both read within a specied time bound, and left open for fu- ture research the problem of generating a proof for larger groups of tags. We generalize his protocol by developing a proof which ensures that a group of tags is read within a cer- tain time perio..