Probably secure efficient anonymous credential scheme

Chien Nan Wu, Chun I. Fan, Jheng Jia Huang, Yi Fan Tseng, Hiroaki Kikuchi

Research output: Contribution to journalArticle


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.

Original languageEnglish
Pages (from-to)18-35
Number of pages18
JournalInternational Journal of Software Innovation
Issue number3
Publication statusPublished - 1 Jul 2018



  • Anonymous Credentials
  • Authentication
  • Chameleon Hash Functions
  • Cryptography
  • Information Security
  • Partially Blind Signatures
  • Random Oracle Models
  • Unforgeability
  • Unlinkability

Cite this