Highly-Efficient Fully-Anonymous Dynamic Group Signatures

David Derler, Daniel Slamanig

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem Konferenzband


Group signatures are a central tool in privacy-enhancing cryptography, which allow members of a group to anonymously produce signatures on behalf of the group. Consequently, they are an attractive means to implement privacy-friendly authentication mechanisms. Ideally, group signatures are dynamic and thus allow to dynamically and concurrently enroll new members to a group. For such schemes, Bellare et al. (CT-RSA»05) proposed the currently strongest security model (BSZ model). This model, in particular, ensures desirable anonymity guarantees. Given the prevalence of the resource asymmetry in current computing scenarios, i.e., a multitude of (highly) resource-constrained devices are communicating with powerful (cloud-powered) services, it is of utmost importance to have group signatures that are highly-efficient and can be deployed in such scenarios. Satisfying these requirements in particular means that the signing (client) operations are lightweight.
We propose a novel, generic approach to construct dynamic group signature schemes, being provably secure in the BSZ model and particularly suitable for resource-constrained devices. Our results are interesting for various reasons: We can prove our construction secure without requiring random oracles. Moreover, when opting for an instantiation in the random oracle model (ROM) the so obtained scheme is extremely efficient and outperforms the fastest constructions providing anonymity in the BSZ model - which also rely on the ROM - known to date. Regarding constructions providing a weaker anonymity notion than BSZ, we surprisingly outperform the popular short BBS group signature scheme (CRYPTO»04; also proven secure in the ROM) and thereby even obtain shorter signatures. We provide a rigorous comparison with existing schemes that highlights the benefits of our scheme. On a more theoretical side, we provide the first construction following the "without encryption" paradigm introduced by Bichsel et al. (SCN»10) in the strong BSZ model.
TitelProceedings of the 2018 ACM Asia Conference on Computer and Communications Security, AsiaCCS 2018
Herausgeber (Verlag)Association of Computing Machinery
ISBN (Print)978-1-4503-5576-6
PublikationsstatusVeröffentlicht - 2018
Veranstaltung13th ACM ASIA Conference on Information, Computer and Communications Security - Incheon, Südkorea
Dauer: 4 Jun 20188 Jun 2018


Konferenz13th ACM ASIA Conference on Information, Computer and Communications Security
KurztitelACM ASIACCS 2018

Fingerprint Untersuchen Sie die Forschungsthemen von „Highly-Efficient Fully-Anonymous Dynamic Group Signatures“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren