Revocable group signature schemes with constant costs for signing and verifying

Toru Nakanishi, Hiroki Fujii, Yuta Hira, Nobuo Funabiki

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)


Lots of revocable group signature schemes have been proposed so far. In one type of revocable schemes, signing and/or verifying algorithms have O(N) or O(R) complexity, where N is the group size and R is the number of revoked members. On the other hand, in Camenisch-Lysyanskaya scheme and the followers, signing and verifying algorithms have O(1) complexity. However, before signing, the updates of the secret key are required. The complexity is O(R) in the worst case. In this paper, we propose a revocable scheme with signing and verifying of O(1) complexity, where any update of secret key is not required. The compensation is the long public key of O(N). In addition, we extend it to the scheme with O(√N)-size public key, where signing and verifying have constant extra costs.

Original languageEnglish
Pages (from-to)50-62
Number of pages13
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number1
Publication statusPublished - Jan 2010


  • Anonymity
  • Group signatures
  • Pairings
  • Revocations

ASJC Scopus subject areas

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


Dive into the research topics of 'Revocable group signature schemes with constant costs for signing and verifying'. Together they form a unique fingerprint.

Cite this