An efficient offline grouping proof protocol using multiple types of tags

Hyoungmin Ham, Inhwan Kim, Joo Seok Song

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

An offline grouping proof shows that multiple Radio Frequency Identification tags are scanned simultaneously, regardless of a reader device's network connectivity. However, the previous offline grouping proof schemes are unsuitable for passive tags, and do not handle errors that cause performance degradation, such as transmission loss or synchronization failure of shared values between tags and a back-end database. In this paper, we propose an efficient offline grouping proof scheme using multiple types of tags. It makes use of an agent tag which does computing operations instead of the passive tags to reduce the computational cost of them, thus it eventually shortens the time for generating a grouping proof. We show that the number of modules and operations of the passive tags in our scheme are less than half of the previous schemes while it achieves the enhanced security and scalability.

Original languageEnglish
Title of host publicationACM IMCOM 2015 - Proceedings
PublisherAssociation for Computing Machinery, Inc
ISBN (Electronic)9781450333771
DOIs
Publication statusPublished - 2015 Jan 8
Event9th International Conference on Ubiquitous Information Management and Communication, ACM IMCOM 2015 - Bali, Indonesia
Duration: 2015 Jan 82015 Jan 10

Publication series

NameACM IMCOM 2015 - Proceedings

Other

Other9th International Conference on Ubiquitous Information Management and Communication, ACM IMCOM 2015
CountryIndonesia
CityBali
Period15/1/815/1/10

Fingerprint

Radio frequency identification (RFID)
Scalability
Synchronization
Degradation
Costs
Tag
Grouping

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Control and Systems Engineering
  • Management Information Systems

Cite this

Ham, H., Kim, I., & Song, J. S. (2015). An efficient offline grouping proof protocol using multiple types of tags. In ACM IMCOM 2015 - Proceedings [a94] (ACM IMCOM 2015 - Proceedings). Association for Computing Machinery, Inc. https://doi.org/10.1145/2701126.2701162
Ham, Hyoungmin ; Kim, Inhwan ; Song, Joo Seok. / An efficient offline grouping proof protocol using multiple types of tags. ACM IMCOM 2015 - Proceedings. Association for Computing Machinery, Inc, 2015. (ACM IMCOM 2015 - Proceedings).
@inproceedings{7edc9687f060438c951008933c12d1cb,
title = "An efficient offline grouping proof protocol using multiple types of tags",
abstract = "An offline grouping proof shows that multiple Radio Frequency Identification tags are scanned simultaneously, regardless of a reader device's network connectivity. However, the previous offline grouping proof schemes are unsuitable for passive tags, and do not handle errors that cause performance degradation, such as transmission loss or synchronization failure of shared values between tags and a back-end database. In this paper, we propose an efficient offline grouping proof scheme using multiple types of tags. It makes use of an agent tag which does computing operations instead of the passive tags to reduce the computational cost of them, thus it eventually shortens the time for generating a grouping proof. We show that the number of modules and operations of the passive tags in our scheme are less than half of the previous schemes while it achieves the enhanced security and scalability.",
author = "Hyoungmin Ham and Inhwan Kim and Song, {Joo Seok}",
year = "2015",
month = "1",
day = "8",
doi = "10.1145/2701126.2701162",
language = "English",
series = "ACM IMCOM 2015 - Proceedings",
publisher = "Association for Computing Machinery, Inc",
booktitle = "ACM IMCOM 2015 - Proceedings",

}

Ham, H, Kim, I & Song, JS 2015, An efficient offline grouping proof protocol using multiple types of tags. in ACM IMCOM 2015 - Proceedings., a94, ACM IMCOM 2015 - Proceedings, Association for Computing Machinery, Inc, 9th International Conference on Ubiquitous Information Management and Communication, ACM IMCOM 2015, Bali, Indonesia, 15/1/8. https://doi.org/10.1145/2701126.2701162

An efficient offline grouping proof protocol using multiple types of tags. / Ham, Hyoungmin; Kim, Inhwan; Song, Joo Seok.

ACM IMCOM 2015 - Proceedings. Association for Computing Machinery, Inc, 2015. a94 (ACM IMCOM 2015 - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - An efficient offline grouping proof protocol using multiple types of tags

AU - Ham, Hyoungmin

AU - Kim, Inhwan

AU - Song, Joo Seok

PY - 2015/1/8

Y1 - 2015/1/8

N2 - An offline grouping proof shows that multiple Radio Frequency Identification tags are scanned simultaneously, regardless of a reader device's network connectivity. However, the previous offline grouping proof schemes are unsuitable for passive tags, and do not handle errors that cause performance degradation, such as transmission loss or synchronization failure of shared values between tags and a back-end database. In this paper, we propose an efficient offline grouping proof scheme using multiple types of tags. It makes use of an agent tag which does computing operations instead of the passive tags to reduce the computational cost of them, thus it eventually shortens the time for generating a grouping proof. We show that the number of modules and operations of the passive tags in our scheme are less than half of the previous schemes while it achieves the enhanced security and scalability.

AB - An offline grouping proof shows that multiple Radio Frequency Identification tags are scanned simultaneously, regardless of a reader device's network connectivity. However, the previous offline grouping proof schemes are unsuitable for passive tags, and do not handle errors that cause performance degradation, such as transmission loss or synchronization failure of shared values between tags and a back-end database. In this paper, we propose an efficient offline grouping proof scheme using multiple types of tags. It makes use of an agent tag which does computing operations instead of the passive tags to reduce the computational cost of them, thus it eventually shortens the time for generating a grouping proof. We show that the number of modules and operations of the passive tags in our scheme are less than half of the previous schemes while it achieves the enhanced security and scalability.

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

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

U2 - 10.1145/2701126.2701162

DO - 10.1145/2701126.2701162

M3 - Conference contribution

AN - SCOPUS:84926195497

T3 - ACM IMCOM 2015 - Proceedings

BT - ACM IMCOM 2015 - Proceedings

PB - Association for Computing Machinery, Inc

ER -

Ham H, Kim I, Song JS. An efficient offline grouping proof protocol using multiple types of tags. In ACM IMCOM 2015 - Proceedings. Association for Computing Machinery, Inc. 2015. a94. (ACM IMCOM 2015 - Proceedings). https://doi.org/10.1145/2701126.2701162