Traceable signature: Better efficiency and beyond

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent years one of the most active research areas in applied cryptography is the study of techniques for creating a group signature, a cryptographic primitive that can be used to implement anonymous authentication. Some variants of group signature, such as traceable signature, and authentication with variable anonymity in a trusted computing platform, have also been proposed. In this paper we propose a traceable signature scheme with variable anonymity. Our scheme supports two important properties for a practical anonymous authentication system, i.e., corrupted group member detection and fair tracing, which have unfortunately been neglected in most group signature schemes in the literature. We prove the new scheme is secure in the random oracle model, under the strong RSA assumption and the decisional Diffie-Hellman assumption. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Ge, H., & Tate, S. R. (2006). Traceable signature: Better efficiency and beyond. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3982 LNCS, pp. 327–337). Springer Verlag. https://doi.org/10.1007/11751595_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free