Revocable group signature schemes with constant costs for signing and verifying

Toru Nakanishi; Hiroki Fujii; Yuta Hira; Nobuo Funabiki

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

Revocable group signature schemes with constant costs for signing and verifying

Toru Nakanishi, Hiroki Fujii, Yuta Hira, Nobuo Funabiki

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

62 Citations (Scopus)

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 0(v'A)-size public key, where signing and verifying have constant extra costs.

Original language	English
Title of host publication	Public Key Cryptography - PKC 2009 - 12th International Conference on Practice and Theory in Public Key Cryptography, Proceedings
Publisher	Springer Verlag
Pages	463-480
Number of pages	18
ISBN (Print)	3642004679, 9783642004674
DOIs	https://doi.org/10.1007/978-3-642-00468-1_26
Publication status	Published - 2009
Event	12th International Conference on Practice and Theory in Public Key Cryptography, PKC 2009 - Irvine, CA, United States Duration: Mar 18 2009 → Mar 20 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5443
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	12th International Conference on Practice and Theory in Public Key Cryptography, PKC 2009
Country	United States
City	Irvine, CA
Period	3/18/09 → 3/20/09

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

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

Fingerprint 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

Nakanishi, T., Fujii, H., Hira, Y., & Funabiki, N. (2009). Revocable group signature schemes with constant costs for signing and verifying. In Public Key Cryptography - PKC 2009 - 12th International Conference on Practice and Theory in Public Key Cryptography, Proceedings (pp. 463-480). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5443). Springer Verlag. https://doi.org/10.1007/978-3-642-00468-1_26

Revocable group signature schemes with constant costs for signing and verifying. / Nakanishi, Toru; Fujii, Hiroki; Hira, Yuta; Funabiki, Nobuo.

Public Key Cryptography - PKC 2009 - 12th International Conference on Practice and Theory in Public Key Cryptography, Proceedings. Springer Verlag, 2009. p. 463-480 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5443).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Nakanishi, T, Fujii, H, Hira, Y & Funabiki, N 2009, Revocable group signature schemes with constant costs for signing and verifying. in Public Key Cryptography - PKC 2009 - 12th International Conference on Practice and Theory in Public Key Cryptography, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5443, Springer Verlag, pp. 463-480, 12th International Conference on Practice and Theory in Public Key Cryptography, PKC 2009, Irvine, CA, United States, 3/18/09. https://doi.org/10.1007/978-3-642-00468-1_26

Nakanishi T, Fujii H, Hira Y, Funabiki N. Revocable group signature schemes with constant costs for signing and verifying. In Public Key Cryptography - PKC 2009 - 12th International Conference on Practice and Theory in Public Key Cryptography, Proceedings. Springer Verlag. 2009. p. 463-480. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-00468-1_26

Nakanishi, Toru ; Fujii, Hiroki ; Hira, Yuta ; Funabiki, Nobuo. / Revocable group signature schemes with constant costs for signing and verifying. Public Key Cryptography - PKC 2009 - 12th International Conference on Practice and Theory in Public Key Cryptography, Proceedings. Springer Verlag, 2009. pp. 463-480 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{c2d4bc4a3a2649da8354362205cb2dfb,

title = "Revocable group signature schemes with constant costs for signing and verifying",

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 0(v'A)-size public key, where signing and verifying have constant extra costs.",

author = "Toru Nakanishi and Hiroki Fujii and Yuta Hira and Nobuo Funabiki",

note = "Copyright: Copyright 2021 Elsevier B.V., All rights reserved.; 12th International Conference on Practice and Theory in Public Key Cryptography, PKC 2009 ; Conference date: 18-03-2009 Through 20-03-2009",

year = "2009",

doi = "10.1007/978-3-642-00468-1_26",

language = "English",

isbn = "3642004679",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "463--480",

booktitle = "Public Key Cryptography - PKC 2009 - 12th International Conference on Practice and Theory in Public Key Cryptography, Proceedings",

}

TY - GEN

T1 - Revocable group signature schemes with constant costs for signing and verifying

AU - Nakanishi, Toru

AU - Fujii, Hiroki

AU - Hira, Yuta

AU - Funabiki, Nobuo

PY - 2009

Y1 - 2009

N2 - 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 0(v'A)-size public key, where signing and verifying have constant extra costs.

AB - 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 0(v'A)-size public key, where signing and verifying have constant extra costs.

UR - http://www.scopus.com/inward/record.url?scp=67049119911&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67049119911&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-00468-1_26

DO - 10.1007/978-3-642-00468-1_26

M3 - Conference contribution

AN - SCOPUS:67049119911

SN - 3642004679

SN - 9783642004674

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

SP - 463

EP - 480

BT - Public Key Cryptography - PKC 2009 - 12th International Conference on Practice and Theory in Public Key Cryptography, Proceedings

PB - Springer Verlag

T2 - 12th International Conference on Practice and Theory in Public Key Cryptography, PKC 2009

Y2 - 18 March 2009 through 20 March 2009

ER -

Revocable group signature schemes with constant costs for signing and verifying

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this