International Workshop on Public Key Cryptography

PKC 2009: Public Key Cryptography – PKC 2009 pp 463-480

Revocable Group Signature Schemes with Constant Costs for Signing and Verifying

  • Toru Nakanishi
  • Hiroki Fujii
  • Yuta Hira
  • Nobuo Funabiki
Conference paper

DOI: 10.1007/978-3-642-00468-1_26

Volume 5443 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Nakanishi T., Fujii H., Hira Y., Funabiki N. (2009) Revocable Group Signature Schemes with Constant Costs for Signing and Verifying. In: Jarecki S., Tsudik G. (eds) Public Key Cryptography – PKC 2009. PKC 2009. Lecture Notes in Computer Science, vol 5443. Springer, Berlin, Heidelberg

Abstract

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, 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 no updates of secret key are required. The compensation is the long public key of O(N). In addition, we extend it to the scheme with \(O(\sqrt{N})\)-size public key, where signing and verifying have constant extra costs.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Toru Nakanishi
    • 1
  • Hiroki Fujii
    • 1
  • Yuta Hira
    • 1
  • Nobuo Funabiki
    • 1
  1. 1.Department of Communication Network EngineeringOkayama UniversityOkayamaJapan