References

[1] Lee M Z, Dunn A M, Waters B, et al. Anon-pass: practical anonymous subscriptions. In: Proceedings of IEEE Symposium on Security and Privacy (SP), Berkeley, 2013. 319--333. Google Scholar https://scholar.google.com/scholar?&q=Lee M Z, Dunn A M, Waters B, et al. Anon-pass: practical anonymous subscriptions. In: Proceedings of IEEE Symposium on Security and Privacy (SP), Berkeley, 2013. 319--333&

[2] Boudot F. Efficient proofs that a committed number lies in an interval. In: Advances in Cryptology-EUROCRYPT 2000. Berlin: Springer, 2000. 431--444. Google Scholar https://scholar.google.com/scholar?&q=Boudot F. Efficient proofs that a committed number lies in an interval. In: Advances in Cryptology-EUROCRYPT 2000. Berlin: Springer, 2000. 431--444&

[3] Camenisch J, Lysyanskaya A. Signature schemes and anonymous credentials from bilinear maps. In: Advances in Cryptology-CRYPTO 2004. Berlin: Springer, 2004. 56--72. Google Scholar https://scholar.google.com/scholar?&q=Camenisch J, Lysyanskaya A. Signature schemes and anonymous credentials from bilinear maps. In: Advances in Cryptology-CRYPTO 2004. Berlin: Springer, 2004. 56--72&

[4] Camenisch J, Stadler M. Efficient group signature schemes for large groups. In: Advances in Cryptology-CRYPTO'97. Berlin: Springer, 1997. 410--424. Google Scholar https://scholar.google.com/scholar?&q=Camenisch J, Stadler M. Efficient group signature schemes for large groups. In: Advances in Cryptology-CRYPTO'97. Berlin: Springer, 1997. 410--424&

[5] Blanton M. Online subscriptions with anonymous access. In: Proceedings of the ACM Symposium on Information, Computer and Communications Security. New York: ACM, 2008. 217--227. Google Scholar https://scholar.google.com/scholar?&q=Blanton M. Online subscriptions with anonymous access. In: Proceedings of the ACM Symposium on Information, Computer and Communications Security. New York: ACM, 2008. 217--227&