Abstract

The anonymous credential system allows users to convince relying parties the possession of a credential released by an issuer. To adhere to the minimal information disclose principle, the anonymous credential facilitates predicate proofs of attributes without revealing the values. In this paper, we extend the pairing-based CL-anonymous credential system and present a series of attributes proof protocols. They enable users to prove to relying parties the AND and OR relations over multiple attributes, as well as equality to a given value and lying into a given interval over some single attribute.