1. [1] Y. Sakai, K. Emura, G. Hanaoka, Y. Kawai, and K. Omote, “Towards restricting plaintext space in public key encryption,” Advances in Information and Computer Security, 6th International Workshop, IWSEC 2011, ed. T. Iwata and M. Nishigaki, Lect. Notes Comput. Sci., vol.7038, pp.193-209, Springer, Berlin, 2011.
2. [2] S. Goldwasser and S. Micali, “Probabilistic encryption,” J. Comput. Syst. Sci., vol.28, no.2, pp.270-299, April 1984.
3. [3] I. Teranishi, J. Furukawa, and K. Sako, “k-times anonymous authentication,” IEICE Trans. Fundamentals, vol.E92-A, no.1, pp.147-165, Jan. 2009.
4. [4] F. Boudot, “Efficient proofs that a committed number lies in an interval,” Advances in Cryptology — EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques, ed. B. Preneel, Lect. Notes Comput. Sci., vol.1807, pp.431-444, Springer, Berlin, 2000.
5. [5] T. Nakanishi, H. Fujii, Y. Hira, and N. Funabiki, “Revocable group signature schemes with constant costs for signing and verifying,” IEICE Trans. Fundamentals, vol.E93-A, no.1, pp.50-62, Jan. 2010.