VLR Group Signatures - How to Achieve Both Backward Unlinkability and Efficient Revocation Checks

Julien Bringer, Alain Patey

2012

Abstract

Verifier-Local Revocation (VLR) group signatures are a particular case of dynamic group signature schemes where the revocation process does not influence the activity of the signers. The verifiers use a Revocation List and in all known schemes, checking a signature requires a computational time linear in the number of revoked members. Usually, it requires one pairing per revoked user. Recently, Chen and Li proposed a scheme where Revocation Check uses exponentiations instead of pairings. In this paper, we first propose a correction of their scheme to enable a full proof of the traceability property and we succeed with a constant additional cost only to extend this tweaked scheme to ensure Backward Unlinkability (BU). This important property prevents the loss of anonymity of past signatures when a user is revoked. We thus obtain the scheme with the most efficient Revocation Check among VLR schemes enabling BU.

Paper Citation

in Harvard Style

Bringer J. and Patey A. (2012). VLR Group Signatures - How to Achieve Both Backward Unlinkability and Efficient Revocation Checks . In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2012) ISBN 978-989-8565-24-2, pages 215-220. DOI: 10.5220/0004017502150220

in Bibtex Style

@conference{secrypt12,
author={Julien Bringer and Alain Patey},
title={VLR Group Signatures - How to Achieve Both Backward Unlinkability and Efficient Revocation Checks},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2012)},
year={2012},
pages={215-220},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004017502150220},
isbn={978-989-8565-24-2},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2012)
TI - VLR Group Signatures - How to Achieve Both Backward Unlinkability and Efficient Revocation Checks
SN - 978-989-8565-24-2
AU - Bringer J.
AU - Patey A.
PY - 2012
SP - 215
EP - 220
DO - 10.5220/0004017502150220