### Abstract

A k-Times Anonymous Authentication (k-TAA) scheme allows users to be authenticated anonymously so long as the number of times that they are authenticated is within an allowable number. Some promising applications are e-voting, e-cash, e-coupons, and trial browsing of contents. However, the previous schemes are not efficient in the case where the allowable number k is large, since they require both users and verifiers to compute O(k) exponentiation in each authentication. We propose a k-TAA scheme where the numbers of exponentiations required for the entities in an authentication are independent of k. Moreover, we propose a notion of public detectability in a k-TAA scheme and present an efficient publicly verifiable k-TAA scheme, where the number of modular exponentiations required for the entities is O(log(k)).

Original language | English |
---|---|

Title of host publication | Public Key Cryptography - PKC 2006 - 9th International Conference on Theory and Practice in Public-Key Cryptography, Proceedings |

Pages | 525-542 |

Number of pages | 18 |

DOIs | |

Publication status | Published - 2006 |

Externally published | Yes |

Event | 9th International Conference on Theory and Practice in Public-Key Cryptography, PKC 2006 - New York, NY, United States Duration: 2006 Apr 24 → 2006 Apr 26 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 3958 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 9th International Conference on Theory and Practice in Public-Key Cryptography, PKC 2006 |
---|---|

Country | United States |

City | New York, NY |

Period | 06/4/24 → 06/4/26 |

### Keywords

- Efficiency
- K-times anonymous authentication
- Public verifiability

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'k-Times Anonymous Authentication with a constant proving cost'. Together they form a unique fingerprint.

## Cite this

*Public Key Cryptography - PKC 2006 - 9th International Conference on Theory and Practice in Public-Key Cryptography, Proceedings*(pp. 525-542). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3958 LNCS). https://doi.org/10.1007/11745853_34