Anonymous yoking-group proofs

Nan Li, Yi Mu, Willy Susilo, Vijay Varadharajan

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

4 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the 10th ACM Symposium on Information, Computer and Communications Security
Place of PublicationNew York
PublisherAssociation for Computing Machinery
Pages615-620
Number of pages6
ISBN (Electronic)9781450332453
DOIs
Publication statusPublished - Apr 2015
Event10th ACM Symposium on Information, Computer and Communications Security, ASIACCS - 2015 - , Singapore
Duration: 14 Apr 201517 Apr 2015

Other

Other10th ACM Symposium on Information, Computer and Communications Security, ASIACCS - 2015
CountrySingapore
Period14/04/1517/04/15

Fingerprint

Dive into the research topics of 'Anonymous yoking-group proofs'. Together they form a unique fingerprint.

Cite this