PE(AR) 2: Privacy-enhanced anonymous authentication with reputation and revocation

26Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Anonymous authentication schemes allow users to act freely without being tracked. The users may not want to trust a third party in ensuring their privacy, yet a service provider (SP) should have the authority to blacklist a misbehaving user. They are seemingly contradicting requirements. PEREA was the most efficient solution to this problem. However, there are a few drawbacks which make it vulnerable and not practical enough. In this paper, we propose PE(AR) 2, which not only fixes PEREA's vulnerability, but also significantly improves its computation efficiency. Apart from revoking repeated misbehaving users, our system also rewards anonymous users via a built-in reputation system. Our scheme does not require the SP to timely review all previously authenticated sessions, and does not have the dependency on the blacklist size for user-side computation (c.f. EPID/BLAC(R)). Our benchmark on PE(AR) 2 shows that an SP can handle over 160 requests/second - a 460-fold efficiency improvement over PEREA, when the credentials store 1000 single-use tickets. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Yu, K. Y., Yuen, T. H., Chow, S. S. M., Yiu, S. M., & Hui, L. C. K. (2012). PE(AR) 2: Privacy-enhanced anonymous authentication with reputation and revocation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7459 LNCS, pp. 679–696). https://doi.org/10.1007/978-3-642-33167-1_39

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