A revocable group signature scheme with the property of hiding the number of revoked users

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

Abstract

If there are many displaced workers in a company, then a person who goes for job hunting might not select this company. That is, the number of members who quit is quite negative information. Similarly, in revocable group signature schemes, if one knows (or guesses) the number of revoked users (say r), then one may guess the reason behind such circumstances, and it may lead to harmful rumors. However, no previous revocation procedure can achieve to hide r. In this paper, we propose the first revocable group signature scheme, where r is kept hidden. To handle these properties, we newly define the security notion called anonymity w.r.t. the revocation which guarantees the unlinkability of revoked users. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Emura, K., Miyaji, A., & Omote, K. (2012). A revocable group signature scheme with the property of hiding the number of revoked users. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7259 LNCS, pp. 186–203). https://doi.org/10.1007/978-3-642-31912-9_13

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