BLAC
Authors:
Open Access
- 1 December 2010
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information and System Security
- Vol. 13 (4) , 1-33
Abstract
Several credential systems have been proposed in which users can authenticate to service providers anonymously. Since anonymity can give users the license to misbehave, some variants allow the selective deanonymization (or linking) of misbehaving users upon a complaint to a Trusted Third Party (TTP). The ability of the TTP to revoke a user’s privacy at any time, however, is too strong a punishment for misbehavior. To limit the scope of deanonymization, some systems have been proposed in which users can be deanonymized only if they authenticate “too many times,” such as “double spending” with electronic cash. While useful in some applications, such techniques cannot be generalized to more subjective definitions of misbehavior, for example, using such schemes it is not possible to block anonymous users who “deface too many Web pages” on a Web site. We present BLAC, the first anonymous credential system in which service providers can revoke the credentials of misbehaving users without relying on a TTP . Since revoked users remain anonymous, misbehaviors can be judged subjectively without users fearing arbitrary deanonymization by a TTP . Additionally, our construction supports a d-strikes-out revocation policy, whereby users who have been subjectively judged to have repeatedly misbehaved at least d times are revoked from the system. Thus, for the first time, it is indeed possible to block anonymous users who have “defaced too many Web pages” using our scheme.Keywords
Funding Information
- Division of Computer and Network Systems (CNS-0524695)
- Institute for Security Technology Studies (2005-DD-BX-1091)
This publication has 33 references indexed in Scilit:
- Zero-Knowledge Sets with Short Proofs2008
- Mesh Signatures2007
- Accumulators from Bilinear Pairings and Applications2005
- Signature Schemes and Anonymous Credentials from Bilinear Maps2004
- Short Group Signatures2004
- Short Signatures Without Random Oracles2004
- Separable Linkable Threshold Ring Signatures2004
- Efficient signature generation by smart cardsJournal of Cryptology, 1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988