Article

Group signatures with verifier-local revocation

Authors:

Hovav ShachamAuthors Info & Claims

CCS '04: Proceedings of the 11th ACM conference on Computer and communications security

Pages 168 - 177

https://doi.org/10.1145/1030083.1030106

Published: 25 October 2004 Publication History

Abstract

Group signatures have recently become important for enabling privacy-preserving attestation in projects such as Microsoft's ngscb effort (formerly Palladium). Revocation is critical to the security of such systems. We construct a short group signature scheme that supports Verifier-Local Revocation (VLR). In this model, revocation messages are only sent to signature verifiers (as opposed to both signers and verifiers). Consequently there is no need to contact individual signers when some user is revoked. This model is appealing for systems providing attestation capabilities. Our signatures are as short as standard RSA signatures with comparable security. Security of our group signature (in the random oracle model) is based on the Strong Diffie-Hellman assumption and the Decision Linear assumption in bilinear groups. We give a precise model for VLR group signatures and discuss its implications.

References

[1]

G.Ateniese,J.Camenisch, M. Joye,and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In M. Bellare,editor, Proceedings of Crypto 2000 volume 1880 of LNCS pages 255--70. Springer-Verlag, Aug.2000.]]

Digital Library

[2]

G.Ateniese,G.Tsudik,and D.Song.Quasi-efficient revocation of group signatures. In M.Blaze, editor, Proceedings of Financial Cryptography 2002 Mar. 2002.]]

Digital Library

[3]

N. Baric and B. Pfitzman. Collision-free accumulators and fail-stop signature schemes with out trees. In Proceedings of Eurocrypt 1997 pages 480--494. Springer-Verlag, May 1997.]]

Digital Library

[4]

M. Bellare, D. Micciancio,and B. Warinschi. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In E. Biham, editor, Proceedings of Eurocrypt 2003 volume 2656 of LNCS pages 614--29. Springer-Verlag,May 2003.]]

Digital Library

[5]

M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing eficient protocols. In Proceedings of CCS 1993 pages 62--73. ACM Press, Nov. 1993.]]

Digital Library

[6]

D. Boneh and X. Boyen. Short signatures with out random oracles. In C. Cachin and J. Camenisch, editors, Proceedings of Eurocrypt 2004 LNCS, pages 56--73. Springer-Verlag, May 2004.]]

[7]

D. Bone,X. Boyen,and H. Shacham. Short group signatures. In M. Franklin, editor, Proceedings of Crypto 2004 volume 3152 of LNCS pages 41--55. Springer-Verlag, Aug.2004.]]

[8]

D.Bone, B. Lynn,and H. Shacham. Short signatures from the Weil pairing.In Proceedings of Asiacrypt 2001 volume 2248 of LNCS pages 514--32. Springer-Verlag, Dec.2001. Full paper: http://crypto.stanford.edu/ dabo/pubs.html]]

Digital Library

[9]

E.Brickell. An eficient protocol for anonymously providing assurance of the container of a private key, Apr. 2003. Submitted to the Trusted Computing Group.]]

[10]

J. Camenisc and A. Lysyanskaya. Dynamic accumulators and application to eficient revocation of anonymous credentials. In M. Yung, editor, Proceedings of Crypto 2002 volume 2442 of LNCS pages 61--76. Springer-Verlag, Aug.2002.]]

Digital Library

[11]

D.Chaum and E.van Heyst.Group signatures. In D. W. Davies, editor, Proceedings of Eurocrypt 1991 volume 547 of LNCS pages 257--65. Springer-Verlag, Apr. 1991.]]

[12]

X. Ding, G. Tsudik,and S. Xu. Leak-free group signatures wit immediate revocation. In T. Lai and K. Okada, editors, Proceedings of ICDCS 2004 Mar. 2004.]]

Digital Library

[13]

A.Fiat and A.S amir.How to prove yourself: Practical solutions to identification and signature problems. In A. M. Odlyzko, editor, Proceedings of Crypto 1986 volume 263 of LNCS pages 186--194. Springer-Verlag,Aug.1986.]]

Digital Library

[14]

A. Kiayias, Y. Tsiounis,and M. Yung. Traceable signatures. In C. Cachin and J. Camenisch,editors, Proceedings of Eurocrypt 2004 volume 3027 of LNCS pages 571--89. Springer-Verlag, May 2004.]]

[15]

S. Mitsunari,R. Sakai,and M. Kasahara. A new traitor tracing.IEICE Trans. Fundamentals E85-A(2):481--4, Feb.2002.]]

[16]

A. Miyaji,M. Nakabayashi,and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundamentals E84-A(5):1234--43, May 2001.]]

[17]

D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. J. Cryptology 13(3): 361--96,2000.]]

Digital Library

[18]

C. Schnorr. Eficient signature generation by smart cards. J. Cryptology 4(3): 161--174, 1991.]]

Digital Library

[19]

V.Shoup. Lower bounds for discrete logarithms and related problems.In W.Fumy,editor,Proceedings of Eurocrypt 1997 volume 1233 of LNCS pages 256--66. Springer-Verlag,May 1997.]]

Digital Library

[20]

Trusted Computing Group. Trusted Computing Platform Alliance (TCPA) Main Specification, 2003. Online:www.trustedcomputinggroup.org]]

[21]

G. Tsudik and S. Xu. Accumulating composites and improved group signing. In C. S. Laih, editor, Proceedings of Asiacrypt 2003 volume 2894 of LNCS pages 269--86. Springer-Verlag, Dec.2003.]]

Cited By

Mbimbi BMurray DWilson M(2024)IoT Forensics-Based on the Integration of a Permissioned Blockchain NetworkBlockchains10.3390/blockchains20400212:4(482-506)Online publication date: 18-Dec-2024
https://doi.org/10.3390/blockchains2040021
Gumarac M(2024)Extent of spending behavior, problems encountered, and financial knowledge across generational cohorts among state universities and colleges employeesInternational Journal of ADVANCED AND APPLIED SCIENCES10.21833/ijaas.2024.02.02411:2(230-237)Online publication date: Feb-2024
https://doi.org/10.21833/ijaas.2024.02.024
Chen KShen PLv KTian XChen C(2024)Dynamic group fuzzy extractorCybersecurity10.1186/s42400-024-00210-27:1Online publication date: 1-Sep-2024
https://doi.org/10.1186/s42400-024-00210-2
Show More Cited By

Index Terms

Group signatures with verifier-local revocation
1. Security and privacy
  1. Cryptography
    1. Public key (asymmetric) techniques
      1. Public key encryption

Recommendations

Hierarchical Group Signatures with Verifier-Local Revocation
Information and Communications Security
Abstract
Group signatures are important when it comes to authentication with privacy. Hierarchical group signatures, as a proper generalization of group signatures, have splendid applications in e-commerce. One key issue for such schemes is to support ...
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, ...
Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
CANS '09: Proceedings of the 8th International Conference on Cryptology and Network Security

Group signatures allow users to anonymously sign messages in the name of a group. Membership revocation has always been a critical issue in such systems. In 2004, Boneh and Shacham formalized the concept of group signatures with <em>verifier-local ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CCS '04: Proceedings of the 11th ACM conference on Computer and communications security

October 2004

376 pages

ISBN:1581139616

DOI:10.1145/1030083

General Chair:
Vijay Atluri
Rutgers University
,
Program Chairs:
Birgit Pfitzmann
IBM Research, Switzerland
,
Patrick McDaniel
AT&T Labs

Copyright © 2004 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 October 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CCS04

Sponsor:

CCS04: 11th ACM Conference on Computer and Communications Security 2004

October 25 - 29, 2004

Washington DC, USA

Acceptance Rates

Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

Upcoming Conference

CCS '25

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 13 - 17, 2025

Taipei , Taiwan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

369
Total Citations
View Citations
1,868
Total Downloads

Downloads (Last 12 months)73
Downloads (Last 6 weeks)14

Reflects downloads up to 17 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Mbimbi BMurray DWilson M(2024)IoT Forensics-Based on the Integration of a Permissioned Blockchain NetworkBlockchains10.3390/blockchains20400212:4(482-506)Online publication date: 18-Dec-2024
https://doi.org/10.3390/blockchains2040021
Gumarac M(2024)Extent of spending behavior, problems encountered, and financial knowledge across generational cohorts among state universities and colleges employeesInternational Journal of ADVANCED AND APPLIED SCIENCES10.21833/ijaas.2024.02.02411:2(230-237)Online publication date: Feb-2024
https://doi.org/10.21833/ijaas.2024.02.024
Chen KShen PLv KTian XChen C(2024)Dynamic group fuzzy extractorCybersecurity10.1186/s42400-024-00210-27:1Online publication date: 1-Sep-2024
https://doi.org/10.1186/s42400-024-00210-2
Yue XBi XYang HBai SHe Y(2024)PAP: A Privacy-Preserving Authentication Scheme With Anonymous Payment for V2G NetworksIEEE Transactions on Smart Grid10.1109/TSG.2024.343502815:6(6092-6111)Online publication date: Nov-2024
https://doi.org/10.1109/TSG.2024.3435028
Li SHe KChen JShi MJia MDu RHan L(2024)MaskAuct: Seller-Autonomous Auction With Bidder Anonymity and Bidding ConfidentialityIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.344911619(7853-7865)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3449116
Jain AGupta H(2024)A Cryptographic Model for the Enhancement of Data Security2024 11th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)10.1109/ICRITO61523.2024.10522303(1-6)Online publication date: 14-Mar-2024
https://doi.org/10.1109/ICRITO61523.2024.10522303
Imura YEmura K(2024)An Identity Management System Using Group Signatures with Message-Dependent Opening2024 19th Asia Joint Conference on Information Security (AsiaJCIS)10.1109/AsiaJCIS64263.2024.00017(40-47)Online publication date: 13-Aug-2024
https://doi.org/10.1109/AsiaJCIS64263.2024.00017
Sudarsono AWidyatra Sudibyo RWinarno IYuliana M(2024)Ephemeral Secret Leakage-Free ID-Role-Based Access Control Authentication and Key Exchange Protocol for Securing Electric Vehicle DataIEEE Access10.1109/ACCESS.2024.345090312(120961-120978)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3450903
Nguyen KSafavi-Naini RSusilo WWang HXu YZeng N(2024)Group encryptionTheoretical Computer Science10.1016/j.tcs.2024.1146781007:COnline publication date: 29-Jul-2024
https://dl.acm.org/doi/10.1016/j.tcs.2024.114678
Wang LChen JDai HTao C(2024)Efficient Code-Based Fully Dynamic Group Signature SchemeTheoretical Computer Science10.1016/j.tcs.2024.114407(114407)Online publication date: Jan-2024
https://doi.org/10.1016/j.tcs.2024.114407
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents