Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Dynamic Threshold Public-Key Encryption
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Efficient attributes for anonymous credentials
Proceedings of the 15th ACM conference on Computer and communications security
Full-domain subgroup hiding and constant-size group signatures
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
P-signatures and noninteractive anonymous credentials
TCC'08 Proceedings of the 5th conference on Theory of cryptography
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Efficient proofs of attributes in pairing-based anonymous credential system
PETS'11 Proceedings of the 11th international conference on Privacy enhancing technologies
| Hi-index | 0.00 |
As an important property of anonymous credential, attribute proof allows user to prove the possession of attributes issued by the issuing authority anonymously. In this paper, we introduced the notation of Attribute-based signature into anonymous credential to propose an anonymous credential with constant complexity attribute proof. Compared with other constant complexity pairing based schemes, our scheme could support more types of attribute relations while the public parameter is much shorter.