Abstract
This paper presents an efficient anonymous credential system that includes two variants. One is a system that lacks a credential revoking protocol, but provides perfect anonymity-unlinkability and computational unforgeability under the strong Diffie-Hellman assumption. It is more efficient than existing credential systems with no revocation. The other is a system that provides revocation as well as computational anonymity-unlinkability and unforgeability under the strong Diffie-Hellman and decision linear Diffie-Hellman assumptions. This system provides two types of revocation simultaneously: one is to blacklist a user who acted wrong so that he can no longer use his credential, and the other is identifying a user who acted wrong from his usage of credential. Both systems are provably secure under the above-mentioned assumptions in the standard model. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Akagi, N., Manabe, Y., & Okamoto, T. (2008). An efficient anonymous credential system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5143 LNCS, pp. 272–286). https://doi.org/10.1007/978-3-540-85230-8_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
