Reference Hub1
Probably Secure Efficient Anonymous Credential Scheme

Probably Secure Efficient Anonymous Credential Scheme

Chien-Nan Wu, Chun-I Fan, Jheng-Jia Huang, Yi-Fan Tseng, Hiroaki Kikuchi
Copyright: © 2018 |Volume: 6 |Issue: 3 |Pages: 18
ISSN: 2166-7160|EISSN: 2166-7179|EISBN13: 9781522546856|DOI: 10.4018/IJSI.2018070102
Cite Article Cite Article

MLA

Wu, Chien-Nan, et al. "Probably Secure Efficient Anonymous Credential Scheme." IJSI vol.6, no.3 2018: pp.18-35. http://doi.org/10.4018/IJSI.2018070102

APA

Wu, C., Fan, C., Huang, J., Tseng, Y., & Kikuchi, H. (2018). Probably Secure Efficient Anonymous Credential Scheme. International Journal of Software Innovation (IJSI), 6(3), 18-35. http://doi.org/10.4018/IJSI.2018070102

Chicago

Wu, Chien-Nan, et al. "Probably Secure Efficient Anonymous Credential Scheme," International Journal of Software Innovation (IJSI) 6, no.3: 18-35. http://doi.org/10.4018/IJSI.2018070102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This article describes how after the concept of anonymous credential systems was introduced in 1985, a number of similar systems have been proposed. However, these systems use zero-knowledge protocols to authenticate users, resulting in inefficient authentication during the stage of proving credential possession. To overcome this drawback, this article presents a signature scheme that uses partially blind signatures and chameleon hash functions such that both the prover and verifier achieve efficient authentication. In addition to providing a computational cost comparison table showing that the proposed signature scheme achieves a more efficient credential possession proving compared to other schemes, concrete security proofs are provided under a random oracle model to demonstrate that the proposed scheme satisfies the properties of anonymous credentials.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.