Article

Group signatures

Authors:

EUROCRYPT'91: Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques

Pages 257 - 265

Published: 08 April 1991 Publication History

Abstract

In this paper we present a new type of signature for a group of persons, called a group signature, which has the following properties: (i) only members of the group can sign messages; (ii) the receiver can verify that it is a valid group signature, but cannot discover which group member made it; (iii) if necessary, the signature can be "opened", so that the person who signed the message is revealed.

The group signatures are a "generalization" of the credential/ membership authentication schemes, in which one person proves that he belongs to a certain group.

We present four schemes that satisfy the properties above. Not all these schemes arc based on the same cryptographic assumption. In some of the schemes a trusted centre is only needed during the setup; and in other schemes, each pason can create the group he belongs to.

References

[1]

Ernest Brickell, David Chaum. Ivan Damgård and Jeroen van de Graaf, Gradual and verifiable release of a secret, Advances in Cryptology -CRYPTO 87, C. Pomerance ed., Lecture Notes in Computer Science 293, Springer-Verlag, pp. 156-166.

Digital Library

Google Scholar

[2]

David Chaum, Showing credentials without identification, Advances in Cryprology - EUROCRYPT 85, F. Pichler ed., Lecture Notes in Computer Science 219, Springer-Verlag, pp. 241-244.

Digital Library

Google Scholar

[3]

David Chaum, Blinding for unanticipated signatures, Advances in Cryptology - EUROCRYPT 87, D. Chaum. W. Price eds., Lecture Notes in Computer Science 304, Springer-Verlag, pp. 227-233.

Digital Library

Google Scholar

[4]

David Chaum, Zero-knowledge undeniable signatures, Advances in Cryptology - EUROCRYPT 90, I. Damgård ed., Lecture Notes in Computer Science 473, Springer-Verlag, pp. 458-464.

Digital Library

Google Scholar

[5]

David Chaum and Hans van Antwerpen, Undeniable signatures, Advances in Cryptology - CRYPT0 89, G. Brassard ed., Lecture Notes in Computer Science 435, Springer-Verlag, pp. 212-216.

Digital Library

Google Scholar

[6]

David Chaum, Jan-Hendrik Evertse and Jeroen van de Graaf, An improved protocol for demonstrating possession of discrete logarithms and some generalizations, Advances in Cryprology-EUROCRYPT 87, D. Chaum, W. Price eds., Lecture Notes in Computer Science 304, Springer-Verlag, pp. 127-141.

Digital Library

Google Scholar

[7]

Taher ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithm, IEEE IT 31 (1985), pp. 469-472.

Digital Library

Google Scholar

[8]

Amos Fiat and Adi Shamir, How to prove yourself: practical solution to identification and signature problems, Advances in Cryprology -CRYPT0 86, A.M. Odlyzko ed., Lecture Notes in Computer Science 263, Springer-Verlag, pp. 186-194.

Digital Library

Google Scholar

[9]

Kazuo Ohta, Tatsuaki Okamoto and Kenji Koyama, Membership authentication for hierarchical multigroup using the extended Fiat-Shamir scheme, Advances in Cryptology -EUROCRYPT 90, I. Damgård ed., Lecture Notes in Computer Science 473, Springer-Verlag, pp. 446-457.

Digital Library

Google Scholar

[10]

René Peralta, Simultaneous security of bits in the discrete log, Advances in Cryptology - EUROCRYPT 85, F. Pichler ed., Lecture Notes in Computer Science 219, Springer-Verlag, pp. 62-72.

Digital Library

Google Scholar

[11]

Hiroki Shizuya, Kenji Koyama and Toshiya Itoh. Demonstrating possession without revealing factors and its applications, Advances in Cryptology AUSCRYPT 90, J. Seberry and J. Pieprzyk eds., Lecture Notes in Computer Science 453, Springer-Verlag, pp. 273-293.

Digital Library

Google Scholar

[12]

Schrift and Shamir, The discrete log is very discreet, Proc. 22nd STOC 1990, pp. 405-415.

Digital Library

Google Scholar

Cited By

View all

Chen LDong CNewton CWang Y(2024)Sphinx-in-the-Head: Group Signatures from Symmetric PrimitivesACM Transactions on Privacy and Security10.1145/363876327:1(1-35)Online publication date: 5-Feb-2024
https://dl.acm.org/doi/10.1145/3638763
Dobias PMalina LIlgner PDzurenda P(2023)On Efficiency and Usability of Group Signatures on Smartphone and Single-board PlatformsProceedings of the 18th International Conference on Availability, Reliability and Security10.1145/3600160.3605015(1-9)Online publication date: 29-Aug-2023
https://dl.acm.org/doi/10.1145/3600160.3605015
AlTawy RGalal HYoussef A(2023)Mjolnir: Breaking the Glass in a Publicly Verifiable Yet Private MannerIEEE Transactions on Network and Service Management10.1109/TNSM.2023.324450620:3(2942-2956)Online publication date: 1-Sep-2023
https://dl.acm.org/doi/10.1109/TNSM.2023.3244506
Show More Cited By

Group signatures

Recommendations

Efficient group signatures from bilinear pairing
CISC'05: Proceedings of the First SKLOIS conference on Information Security and Cryptology

This paper presents two types of group signature schemes from bilinear pairings: the mini type and the improved type. The size of the group public keys and the length of the signatures in both schemes are constant. An on-line third party is introduced ...
Floppy-Sized Group Signatures from Lattices
Applied Cryptography and Network Security
Abstract
We present the first lattice-based group signature scheme whose cryptographic artifacts are of size small enough to be usable in practice: for a group of $2^{25}$ users, signatures take 910 kB and public keys are 501 kB. Our scheme builds upon two ...
Group Signatures with Time-bound Keys Revisited: A New Model and an Efficient Construction
ASIA CCS '17: Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security

Chu et al. (ASIACCS 2012) proposed group signature with time-bound keys (GS-TBK) where each signing key is associated to an expiry time τ. In addition to prove the membership of the group, a signer needs to prove that the expiry time has not passed, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

EUROCRYPT'91: Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques

April 1991

556 pages

ISBN:3540546200

Editor:
Donald W. Davies
Royal Holloway and Bedford New College, Univ. of London, Surrey, UK

In-Cooperation

Northern Telecom
Coopers and Lybrand Deloitte
Logica Aerospace and Defence Limited
ABN Bank

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 08 April 1991

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

316
Total Citations
View Citations
66
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chen LDong CNewton CWang Y(2024)Sphinx-in-the-Head: Group Signatures from Symmetric PrimitivesACM Transactions on Privacy and Security10.1145/363876327:1(1-35)Online publication date: 5-Feb-2024
https://dl.acm.org/doi/10.1145/3638763
Dobias PMalina LIlgner PDzurenda P(2023)On Efficiency and Usability of Group Signatures on Smartphone and Single-board PlatformsProceedings of the 18th International Conference on Availability, Reliability and Security10.1145/3600160.3605015(1-9)Online publication date: 29-Aug-2023
https://dl.acm.org/doi/10.1145/3600160.3605015
AlTawy RGalal HYoussef A(2023)Mjolnir: Breaking the Glass in a Publicly Verifiable Yet Private MannerIEEE Transactions on Network and Service Management10.1109/TNSM.2023.324450620:3(2942-2956)Online publication date: 1-Sep-2023
https://dl.acm.org/doi/10.1109/TNSM.2023.3244506
Kitagawa FMatsuda TYamakawa T(2023)NIZK from SNARGsJournal of Cryptology10.1007/s00145-023-09449-336:2Online publication date: 8-Apr-2023
https://dl.acm.org/doi/10.1007/s00145-023-09449-3
Huang JHe DObaidat MVijayakumar PLuo MChoo K(2021)The Application of the Blockchain Technology in Voting SystemsACM Computing Surveys10.1145/343972554:3(1-28)Online publication date: 17-Apr-2021
https://dl.acm.org/doi/10.1145/3439725
Hu CCheng XTian ZYu JLv W(2021)Achieving Privacy Preservation and Billing via Delayed Information ReleaseIEEE/ACM Transactions on Networking10.1109/TNET.2021.306310229:3(1376-1390)Online publication date: 12-Mar-2021
https://dl.acm.org/doi/10.1109/TNET.2021.3063102
Peng YRen SHu M(2020)The Application of Digital Signature Technology in PKIProceedings of the 3rd International Conference on Information Technologies and Electrical Engineering10.1145/3452940.3453066(647-650)Online publication date: 3-Dec-2020
https://dl.acm.org/doi/10.1145/3452940.3453066
Eisele SEghtesad TCampanelli KAgrawal PLaszka ADubey A(2020)Safe and Private Forward-trading Platform for Transactive MicrogridsACM Transactions on Cyber-Physical Systems10.1145/34037115:1(1-29)Online publication date: 30-Dec-2020
https://dl.acm.org/doi/10.1145/3403711
Satybaldy ANowostawski MGai KRaymond Choo KLiu J(2020)Review of Techniques for Privacy-Preserving Blockchain SystemsProceedings of the 2nd ACM International Symposium on Blockchain and Secure Critical Infrastructure10.1145/3384943.3409416(1-9)Online publication date: 6-Oct-2020
https://dl.acm.org/doi/10.1145/3384943.3409416
Krenn SSamelin KStriecks C(2019)Practical Group-Signatures with Privacy-Friendly OpeningsProceedings of the 14th International Conference on Availability, Reliability and Security10.1145/3339252.3339256(1-10)Online publication date: 26-Aug-2019
https://dl.acm.org/doi/10.1145/3339252.3339256
Show More Cited By

Abstract

References

Cited By

Recommendations

Efficient group signatures from bilinear pairing

Floppy-Sized Group Signatures from Lattices