K-times anonymous authentication

Isamu Teranishi*, Jun Furukawa, Kazue Sako

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)


We propose an authentication scheme in which users can be authenticated anonymously so long as times that they are authenticated is within an allowable number. The proposed scheme has two features: 1) no one, not even an authority, can identify users who have been authenticated within the allowable number, 2) anyone can trace, without help from the authority, dishonest users who have been authenticated beyond the allowable number by using the records of these authentications. Our scheme can be applied to e-voting, e-cash, electronic coupons, and trial browsing of content. In these applications, our scheme, unlike the previous one, conceals users' participation from protocols and guarantees that they will remain anonymous to everyone.

Original languageEnglish
Pages (from-to)147-165
Number of pages19
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number1
Publication statusPublished - 2009 Jan
Externally publishedYes


  • Group signature
  • K-times anonymous authentication
  • Public verifiability

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'K-times anonymous authentication'. Together they form a unique fingerprint.

Cite this