Anonymous yoking-group proofs

Nan Li; Yi Mu; Willy Susilo; Vijay Varadharajan

doi:10.1145/2714576.2714609

Anonymous yoking-group proofs

Nan Li, Yi Mu, Willy Susilo, Vijay Varadharajan

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-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 language	English
Title of host publication	Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security
Place of Publication	New York
Publisher	Association for Computing Machinery
Pages	615-620
Number of pages	6
ISBN (Electronic)	9781450332453
DOIs	https://doi.org/10.1145/2714576.2714609
Publication status	Published - Apr 2015
Event	10th ACM Symposium on Information, Computer and Communications Security, ASIACCS - 2015 - , Singapore Duration: 14 Apr 2015 → 17 Apr 2015

Other

Other	10th ACM Symposium on Information, Computer and Communications Security, ASIACCS - 2015
Country/Territory	Singapore
Period	14/04/15 → 17/04/15

Access to Document

10.1145/2714576.2714609

Cite this

@inproceedings{4f03a58de2ed4cf5ac9242e220438267,

title = "Anonymous yoking-group proofs",

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.",

author = "Nan Li and Yi Mu and Willy Susilo and Vijay Varadharajan",

year = "2015",

month = apr,

doi = "10.1145/2714576.2714609",

language = "English",

pages = "615--620",

booktitle = "Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security",

publisher = "Association for Computing Machinery",

note = "10th ACM Symposium on Information, Computer and Communications Security, ASIACCS - 2015 ; Conference date: 14-04-2015 Through 17-04-2015",

}

Li, N, Mu, Y, Susilo, W & Varadharajan, V 2015, Anonymous yoking-group proofs. in Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security. Association for Computing Machinery, New York, pp. 615-620, 10th ACM Symposium on Information, Computer and Communications Security, ASIACCS - 2015, Singapore, 14/04/15. https://doi.org/10.1145/2714576.2714609

TY - GEN

T1 - Anonymous yoking-group proofs

AU - Li, Nan

AU - Mu, Yi

AU - Susilo, Willy

AU - Varadharajan, Vijay

PY - 2015/4

Y1 - 2015/4

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84942519526&partnerID=8YFLogxK

UR - http://purl.org/au-research/grants/arc/DP110101951

U2 - 10.1145/2714576.2714609

DO - 10.1145/2714576.2714609

M3 - Conference proceeding contribution

AN - SCOPUS:84942519526

SP - 615

EP - 620

BT - Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security

PB - Association for Computing Machinery

CY - New York

T2 - 10th ACM Symposium on Information, Computer and Communications Security, ASIACCS - 2015

Y2 - 14 April 2015 through 17 April 2015

ER -

Anonymous yoking-group proofs

Abstract

Other

Access to Document

Other files and links

Fingerprint

Cite this