1. [1] Sudarsono, A., Nakanishi, T. and Funabiki, N.: Efficient proofs of attributes in pairing-based anonymous credential system, Proc. 11th Privacy Enhancing Technologies Symposium (PETS 2011), LNCS 6794, springer-verlag (2011).
2. [2] Libert, B., Peters, T. and Yung, M.: Scalable group signatures with revocation, Advance in Cryptology-EUROCRYPT 2012, LNCS 7323, pp.609-627, Springer-Verlag (2012).
3. [3] Libert, B., Peter, T., Joye, M. and Yung, M.: Linear Homomorphic Structure-Preserving Signatures and Their Applications, Crypto 2013, LNCS 8043, pp.289-307 (2013).
4. [4] Camenisch, J. and Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials, Advances in Cryptology-CRYPTO 2002, LNCS 2442, pp.61-76, Springer-Verlag (2002).
5. [5] Camenisch, J. and Groß, T.: Efficient attributes for anonymous credentials, Proc. ACM Conference on Computer and Communications Security 2008 (ACM-CCS'08), pp.345-356 (2008).