The following publications are possibly variants of this publication:
- An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with NegationsRyo Okishima, Toru Nakanishi 0001. ieiceta, 103-A(12):1381-1392, 2020. [doi]
- An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with NegationsRyo Okishima, Toru Nakanishi 0001. IWSEC 2019: 89-106 [doi]
- Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential SystemNasima Begum, Toru Nakanishi, Nobuo Funabiki. ieicet, 96-A(12):2422-2433, 2013. [doi]
- Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential SystemNasima Begum, Toru Nakanishi, Nobuo Funabiki. icisc 2013: 495-509 [doi]
- Implementation and Evaluation of an Pairing-Based Anonymous Credential System with Constant-Size Proofs and Efficient Proof GenerationsNasima Begum, Toru Nakanishi, Nobuo Funabiki. In ICNC. 2012: 264-268 [doi]
- Reduction of certificates in an anonymous credential system with proofs for monotone formulas on attributesShahidatul Sadiah, Toru Nakanishi 0001. icce-tw 2016: 1-2 [doi]
- Reduction of authentication time in an anonymous credential system with proofs for monotone formulas on attributesNasima Begum, Toru Nakanishi 0001, Yasuyuki Nogami. icce-tw 2015: 376-377 [doi]
- Anonymous Credential System with Efficient Proofs for Monotone Formulas on AttributesShahidatul Sadiah, Toru Nakanishi, Nobuo Funabiki. IWSEC 2015: 262-278 [doi]