Anonymous yoking-group proofs

Authors

Nan Li, University of WollongongFollow
Yi Mu, University of WollongongFollow
Willy Susilo, University of WollongongFollow
Vijay Varadharajan, Macquarie University

RIS ID

97881

Publication Details

Li, N., Mu, Y., Susilo, W. & Varadharajan, V. (2015). Anonymous yoking-group proofs. Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security (ASIA CCS '15) (pp. 615-620). United States: ACM.

Abstract

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". Additionally, we propose an anonymous yoking-proof protocol and an anonymous yoking-group proof protocol and prove their security in Universal Composability framework.

Grant Number

ARC/DP110101951

Additional Grant Number

http://purl.org/au-research/grants/ARC/DP110101951