Anonymous Yoking-Group Proofs

@inproceedings{Li2015AnonymousYP,
  title={Anonymous Yoking-Group Proofs},
  author={Nan Li and Yi Mu and Willy Susilo and Vijay Varadharajan},
  booktitle={AsiaCCS},
  year={2015}
}
Yoking-proofs show an interesting application in Radio Frequency Identification (RFID) that a verifier can check whether two tags are simultaneously scanned by a reader. We consider a scenario that multi-group of tags can be proved to be scanned simultaneously. Grouping-proof, which is an extension of yoking-proofs, allows multiple tags to be proved together, while existing protocols cannot support multiple groups. In this paper, we introduce a novel concept called "yoking-group proofs… CONTINUE READING

Similar Papers

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

One-Round Provably Secure Yoking-Proof for RFID Applications

  • 2017 IEEE Trustcom/BigDataSE/ICESS
  • 2017
VIEW 3 EXCERPTS
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES

Grouping proof for RFID tags

  • 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)
  • 2005
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Distributed Group Authentication for RFID Supply Management

  • IACR Cryptology ePrint Archive
  • 2013
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Provably Secure Grouping-proofs for RFID tags

  • IACR Cryptology ePrint Archive
  • 2007
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL