Group-Signature Schemes on Constrained Devices: The Gap Between Theory and Practice

Raphael Spreitzer, Jörn-Marc Schmidt

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

Abstract

Group-signature schemes allow members within a predefined group to prove specific properties without revealing more information than necessary. Potential areas of application include electronic IDs (eIDs) and smartcards, i.e., resource-constrained environments. Though literature provides many theoretical proposals for group-signature schemes, practical evaluations regarding the applicability of such mechanisms in resource-constrained environments are missing. In this work, we investigate four different group-signature schemes in terms of mathematical operations, signature length, and the proposed revocation mechanisms. We also use the RELIC toolkit to implement the two most promising of the investigated group-signature schemes---one of which is going to be standardized in ISO/IEC 20008---for the AVR microcontroller. This allows us to give practical insights into the applicability of pairings on the AVR microcontroller in general and the applicability of group-signature schemes in particular on the very same. Contrary to the general recommendation of precomputing and storing pairing evaluations if possible, we observed that the evaluation of pairings might be faster than computations on cached pairings.
Original languageEnglish
Title of host publicationCS2'14 Proceedings
PublisherAssociation of Computing Machinery
Pages31-36
ISBN (Print)978-1-4503-2484-7
DOIs
Publication statusPublished - 2014
EventWorkshop on Cryptography and Security in Computing Systems - Wien, Austria
Duration: 20 Jan 201422 Jan 2014

Conference

ConferenceWorkshop on Cryptography and Security in Computing Systems
CountryAustria
CityWien
Period20/01/1422/01/14

Fingerprint

resource
evaluation
electronics
recommendation

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Application

Cite this

Spreitzer, R., & Schmidt, J-M. (2014). Group-Signature Schemes on Constrained Devices: The Gap Between Theory and Practice. In CS2'14 Proceedings (pp. 31-36). Association of Computing Machinery. https://doi.org/10.1145/2556315.2556321

Group-Signature Schemes on Constrained Devices: The Gap Between Theory and Practice. / Spreitzer, Raphael; Schmidt, Jörn-Marc.

CS2'14 Proceedings. Association of Computing Machinery, 2014. p. 31-36.

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

Spreitzer, R & Schmidt, J-M 2014, Group-Signature Schemes on Constrained Devices: The Gap Between Theory and Practice. in CS2'14 Proceedings. Association of Computing Machinery, pp. 31-36, Workshop on Cryptography and Security in Computing Systems, Wien, Austria, 20/01/14. https://doi.org/10.1145/2556315.2556321
Spreitzer R, Schmidt J-M. Group-Signature Schemes on Constrained Devices: The Gap Between Theory and Practice. In CS2'14 Proceedings. Association of Computing Machinery. 2014. p. 31-36 https://doi.org/10.1145/2556315.2556321
Spreitzer, Raphael ; Schmidt, Jörn-Marc. / Group-Signature Schemes on Constrained Devices: The Gap Between Theory and Practice. CS2'14 Proceedings. Association of Computing Machinery, 2014. pp. 31-36
@inproceedings{540c0cf874be4f34b15832f138e8c0e6,
title = "Group-Signature Schemes on Constrained Devices: The Gap Between Theory and Practice",
abstract = "Group-signature schemes allow members within a predefined group to prove specific properties without revealing more information than necessary. Potential areas of application include electronic IDs (eIDs) and smartcards, i.e., resource-constrained environments. Though literature provides many theoretical proposals for group-signature schemes, practical evaluations regarding the applicability of such mechanisms in resource-constrained environments are missing. In this work, we investigate four different group-signature schemes in terms of mathematical operations, signature length, and the proposed revocation mechanisms. We also use the RELIC toolkit to implement the two most promising of the investigated group-signature schemes---one of which is going to be standardized in ISO/IEC 20008---for the AVR microcontroller. This allows us to give practical insights into the applicability of pairings on the AVR microcontroller in general and the applicability of group-signature schemes in particular on the very same. Contrary to the general recommendation of precomputing and storing pairing evaluations if possible, we observed that the evaluation of pairings might be faster than computations on cached pairings.",
author = "Raphael Spreitzer and J{\"o}rn-Marc Schmidt",
note = "Im Rahmen der HiPEAC Conference 2014",
year = "2014",
doi = "10.1145/2556315.2556321",
language = "English",
isbn = "978-1-4503-2484-7",
pages = "31--36",
booktitle = "CS2'14 Proceedings",
publisher = "Association of Computing Machinery",
address = "United States",

}

TY - GEN

T1 - Group-Signature Schemes on Constrained Devices: The Gap Between Theory and Practice

AU - Spreitzer, Raphael

AU - Schmidt, Jörn-Marc

N1 - Im Rahmen der HiPEAC Conference 2014

PY - 2014

Y1 - 2014

N2 - Group-signature schemes allow members within a predefined group to prove specific properties without revealing more information than necessary. Potential areas of application include electronic IDs (eIDs) and smartcards, i.e., resource-constrained environments. Though literature provides many theoretical proposals for group-signature schemes, practical evaluations regarding the applicability of such mechanisms in resource-constrained environments are missing. In this work, we investigate four different group-signature schemes in terms of mathematical operations, signature length, and the proposed revocation mechanisms. We also use the RELIC toolkit to implement the two most promising of the investigated group-signature schemes---one of which is going to be standardized in ISO/IEC 20008---for the AVR microcontroller. This allows us to give practical insights into the applicability of pairings on the AVR microcontroller in general and the applicability of group-signature schemes in particular on the very same. Contrary to the general recommendation of precomputing and storing pairing evaluations if possible, we observed that the evaluation of pairings might be faster than computations on cached pairings.

AB - Group-signature schemes allow members within a predefined group to prove specific properties without revealing more information than necessary. Potential areas of application include electronic IDs (eIDs) and smartcards, i.e., resource-constrained environments. Though literature provides many theoretical proposals for group-signature schemes, practical evaluations regarding the applicability of such mechanisms in resource-constrained environments are missing. In this work, we investigate four different group-signature schemes in terms of mathematical operations, signature length, and the proposed revocation mechanisms. We also use the RELIC toolkit to implement the two most promising of the investigated group-signature schemes---one of which is going to be standardized in ISO/IEC 20008---for the AVR microcontroller. This allows us to give practical insights into the applicability of pairings on the AVR microcontroller in general and the applicability of group-signature schemes in particular on the very same. Contrary to the general recommendation of precomputing and storing pairing evaluations if possible, we observed that the evaluation of pairings might be faster than computations on cached pairings.

UR - http://www.hipeac.net/conference

UR - http://dl.acm.org/citation.cfm?id=2556321

U2 - 10.1145/2556315.2556321

DO - 10.1145/2556315.2556321

M3 - Conference contribution

SN - 978-1-4503-2484-7

SP - 31

EP - 36

BT - CS2'14 Proceedings

PB - Association of Computing Machinery

ER -