loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Julien Bringer 1 and Alain Patey 2

Affiliations: 1 Morpho and Safran Group, France ; 2 Morpho, Safran Group and Télécom ParisTech, France

ISBN: 978-989-8565-24-2

Keyword(s): Group Signatures, Verifier-Local Revocation, Backward Unlinkability, Efficiency, Revocation Check.

Related Ontology Subjects/Areas/Topics: Applied Cryptography ; Cryptographic Techniques and Key Management ; Data and Application Security and Privacy ; Data Engineering ; Databases and Data Security ; Information and Systems Security ; Privacy

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.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.233.226.151

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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

@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},
}

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

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.