Article

A Practical and Provably Secure Coalition-Resistant Group Signature Scheme

Authors:

Giuseppe Ateniese,

Gene TsudikAuthors Info & Claims

CRYPTO '00: Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology

Pages 255 - 270

Published: 20 August 2000 Publication History

Abstract

A group signature scheme allows a group member to sign messages anonymously on behalf of the group. However, in the case of a dispute, the identity of a signature's originator can be revealed (only) by a designated entity. The interactive counterparts of group signatures are identity escrow schemes or group identification scheme with revocable anonymity. This work introduces a new provably secure group signature and a companion identity escrow scheme that are significantly more efficient than the state of the art. In its interactive, identity escrow form, our scheme is proven secure and coalition-resistant under the strong RSA and the decisional Diffie-Hellman assumptions. The security of the noninteractive variant, i.e., the group signature scheme, relies additionally on the Fiat-Shamir heuristic (also known as the random oracle model).

References

[1]

N. Baric and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Advances in Cryptology -- EUROCRYPT'97, vol. 1233 of LNCS, pp. 480-494, Springer-Verlag, 1997.

[2]

M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In 1st ACM Conference on Computer and Communication Security, pp. 62-73, ACM Press, 1993.

[3]

D. Boneh. The decision Diffie-Hellman problem. In Algorithmic Number Theory (ANTS-III), vol. 1423 of LNCS, pp. 48-63, Springer-Verlag, 1998.

[4]

S. Brands. An efficient off-line electronic cash system based on the representation problem. Technical Report CS-R9323, Centrum voor Wiskunde en Informatica, April 1993.

[5]

J. Camenisch and M. Michels. A group signature scheme with improved efficiency. In Advances in Cryptology -- ASIACRYPT'98, vol. 1514 of LNCS, pp. 160-174, Springer-Verlag, 1998.

[6]

J. Camenisch and M. Michels. A group signature scheme based on an RSA-variant. Technical Report RS-98-27, BRICS, University of Aarhus, November 1998. An earlier version appears in {CM98a}.

[7]

J. Camenisch and M. Michels. Proving in zero-knowledge that a number is the product of two safe primes. In Advances in Cryptology -- EUROCRYPT'99, vol. 1592 of LNCS, pp. 107-122, Springer-Verlag, 1999.

[8]

J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes. In Advances in Cryptology -- CRYPTO'99, vol. 1666 of LNCS, pp. 413-430, Springer-Verlag, 1999.

[9]

L. Chen and T.P. Pedersen. New group signature schemes. In Advances in Cryptology -- EUROCRYPT'94, vol. 950 of LNCS, pp. 171-181, 1995.

[10]

J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In Advances in Cryptology -- CRYPTO'97, vol. 1296 of LNCS, pp. 410-424, Springer-Verlag, 1997.

[11]

J. Camenisch. Group signature schemes and payment systems based on the discrete logarithm problem. PhD thesis, vol. 2 of ETH Series in Information Security an Cryptography, Hartung-Gorre Verlag, Konstanz, 1998. ISBN 3- 89649-286-1.

[12]

D. Coppersmith. Finding a small root of a bivariatre interger equation; factoring with high bits known. In Advances in Cryptology -- EUROCRYPT '96, volume 1070 of LNCS, pages 178-189. Springer Verlag, 1996.

[13]

D. Chaum and E. van Heyst. Group signatures. In Advances in Cryptology -- EUROCRYPT'91, vol. 547 of LNCS, pp. 257-265, Springer-Verlag, 1991.

[14]

W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6): 644-654, 1976.

[15]

E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology -- CRYPTO'97, vol. 1297 of LNCS, pp. 16-30, Springer-Verlag, 1997.

[16]

E. Fujisaki and T. Okamoto. A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In Advances in Cryptology -- EUROCRYPT'98, vol. 1403 of LNCS, pp. 32-46, Springer-Verlag, 1998.

[17]

A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In Advances in Cryptology -- CRYPTO'86, vol. 263 of LNCS, pp. 186-194, Springer-Verlag, 1987.

[18]

S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281-308, 1988.

[19]

J. Kilian and E. Petrank. Identity escrow. In Advances in Cryptology -- CRYPTO'98, vol. 1642 of LNCS, pp. 169-185, Springer-Verlag, 1998.

[20]

A. Lysyanskaya and Z. Ramzan. Group blind digital signatures: A scalable solution to electronic cash. In Financial Cryptography (FC'98), vol. 1465 of LNCS, pp. 184-197, Springer-Verlag, 1998.

[21]

C.P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161-174, 1991.

Cited By

Peng KEmura KWang Y(2021)Perfect ZK Argument of Knowledge of Discrete Logarithm in A Cyclic Group with Unknown OrderProceedings of the 8th ACM on ASIA Public-Key Cryptography Workshop10.1145/3457338.3458287(33-40)Online publication date: 24-May-2021
https://dl.acm.org/doi/10.1145/3457338.3458287
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
Walter JAbendroth Bvon Pape TPlappert CZelle DKrauß CGagzow GDecke H(2018)The user-centered privacy-aware control system PRICONProceedings of the 13th International Conference on Availability, Reliability and Security10.1145/3230833.3233269(1-10)Online publication date: 27-Aug-2018
https://dl.acm.org/doi/10.1145/3230833.3233269
Show More Cited By

A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
1. Security and privacy
  1. Systems security

Recommendations

Provably Secure Convertible Nominative Signature Scheme
Information Security and Cryptology

Nominative signature, introduced by Kim, Park and Won, is a useful cryptographic primitive to limit the publicly verifiable property of ordinary digital signature. In a nominative signature scheme, a nominator and a nominee jointly generate a signature ...
A Provably Secure Proxy Signature Scheme in Certificateless Cryptography

A proxy signature scheme enables an original signer to delegate its signing capability to a proxy signer and then the proxy signer can sign a message on behalf of the original signer. Recently, in order to eliminate the use of certificates in certified ...
A new provably secure certificateless short signature scheme

Certificateless public key cryptography simplifies the complex certificate management in the traditional public key cryptography and resolves the key escrow problem in identity-based cryptography. In 2007, Huang et al. revisited the security models of ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

CRYPTO '00: Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology

August 2000

544 pages

ISBN:3540679073

Editor:
Mihir Bellare

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 20 August 2000

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

201
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 17 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Peng KEmura KWang Y(2021)Perfect ZK Argument of Knowledge of Discrete Logarithm in A Cyclic Group with Unknown OrderProceedings of the 8th ACM on ASIA Public-Key Cryptography Workshop10.1145/3457338.3458287(33-40)Online publication date: 24-May-2021
https://dl.acm.org/doi/10.1145/3457338.3458287
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
Walter JAbendroth Bvon Pape TPlappert CZelle DKrauß CGagzow GDecke H(2018)The user-centered privacy-aware control system PRICONProceedings of the 13th International Conference on Availability, Reliability and Security10.1145/3230833.3233269(1-10)Online publication date: 27-Aug-2018
https://dl.acm.org/doi/10.1145/3230833.3233269
Derler DSlamanig DKim JAhn GKim SKim YLopez JKim T(2018)Highly-Efficient Fully-Anonymous Dynamic Group SignaturesProceedings of the 2018 on Asia Conference on Computer and Communications Security10.1145/3196494.3196507(551-565)Online publication date: 29-May-2018
https://dl.acm.org/doi/10.1145/3196494.3196507
Belyaev KSun WRay IRay I(2018)On the design and analysis of protocols for Personal Health Record storage on Personal Data Server devicesFuture Generation Computer Systems10.1016/j.future.2016.05.02780:C(467-482)Online publication date: 1-Mar-2018
https://dl.acm.org/doi/10.1016/j.future.2016.05.027
Hu XTang CWong DZheng X(2018)Efficient pairing-free PRE schemes for multimedia data sharing in IoTMultimedia Tools and Applications10.1007/s11042-017-5387-177:14(18327-18354)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s11042-017-5387-1
Yameng CXiangguo C(2017)Certificateless Group Signature Scheme from Bilinear PairingsProceedings of the 2017 2nd International Conference on Communication and Information Systems10.1145/3158233.3159347(262-267)Online publication date: 7-Nov-2017
https://dl.acm.org/doi/10.1145/3158233.3159347
Hasan RKhan R(2017)Unified authentication factors and fuzzy service access using interaction provenanceComputers and Security10.1016/j.cose.2017.02.01467:C(211-231)Online publication date: 1-Jun-2017
https://dl.acm.org/doi/10.1016/j.cose.2017.02.014
Libert BLing SNguyen KWang H(2016)Zero-Knowledge Arguments for Lattice-Based AccumulatorsProceedings, Part II, of the 35th Annual International Conference on Advances in Cryptology --- EUROCRYPT 2016 - Volume 966610.5555/3081738.3081739(1-31)Online publication date: 8-May-2016
https://dl.acm.org/doi/10.5555/3081738.3081739
Libert BMouhartem FPeters TYung MChen XWang XHuang X(2016)Practical "Signatures with Efficient Protocols" from Simple AssumptionsProceedings of the 11th ACM on Asia Conference on Computer and Communications Security10.1145/2897845.2897898(511-522)Online publication date: 30-May-2016
https://dl.acm.org/doi/10.1145/2897845.2897898
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents