research-article

Building efficient fully collusion-resilient traitor tracing and revocation schemes

Authors:

Abishek Kumarasubramanian,

Brent WatersAuthors Info & Claims

CCS '10: Proceedings of the 17th ACM conference on Computer and communications security

Pages 121 - 130

https://doi.org/10.1145/1866307.1866322

Published: 04 October 2010 Publication History

Abstract

In [8,9] Boneh et al. presented the first fully collusion-resistant traitor tracing and trace & revoke schemes. These schemes are based on composite order bilinear groups and their security depends on the hardness of the subgroup decision assumption.

In this paper we present new, efficient trace & revoke schemes which are based on prime order bilinear groups, and whose security depend on the hardness of the Decisional Linear Assumption or the External Diffie-Hellman (XDH) assumption. This allows our schemes to be flexible and thus much more efficient than existing schemes in terms a variety of parameters including ciphertext size, encryption time, and decryption time.

For example, if encryption time was the major parameter of concern, then for the same level of practical security as [8] our scheme encrypts 6 times faster. Decryption is 10 times faster. The ciphertext size in our scheme is 50% less when compared to [8].

We provide the first implementations of efficient fully collusion-resilient traitor tracing and trace & revoke schemes. The ideas used in this paper can be used to make other cryptographic schemes based on composite order bilinear groups efficient as well

References

[1]

}}D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In Proceedings of CRYPTO '04, LNCS series, pages 41--55. Springer-Verlag, 2004.

[2]

}}D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In M. K. Franklin, editor, CRYPTO, volume 3152 of Lecture Notes in Computer Science, pages 41--55. Springer, 2004.

[3]

}}D. Boneh and M. K. Franklin. An efficient public key traitor tracing scheme. In CRYPTO '99: Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, pages 338--353, London, UK, 1999. Springer-Verlag.

Digital Library

[4]

}}D. Boneh, C. Gentry, and B. Waters. Collusion resistant broadcast encryption with short ciphertexts and private keys. In CRYPTO, pages 258--275, 2005.

Digital Library

[5]

}}D. Boneh, E.-J. Goh, and K. Nissim. Evaluating 2-DNF formulas on ciphertexts. In Second Theory of Cryptography Conference, TCC, volume 3378 of LNCS, pages 325--341, 2005.

Digital Library

[6]

}}D. Boneh, B. Lynn, and H. Shacham. Short signatures from the weil pairing. In ASIACRYPT '01: Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security, pages 514--532, London, UK, 2001. Springer-Verlag.

Digital Library

[7]

}}D. Boneh and M. Naor. Traitor tracing with constant size ciphertext. In ACM Conference on Computer and Communications Security, pages 501--510, 2008.

Digital Library

[8]

}}D. Boneh, A. Sahai, and B. Waters. Fully collusion resistant traitor tracing with short ciphertexts and private keys. In EUROCRYPT 2006, volume 4004 of LNCS, pages 573--592. Springer-Verlag, 2006.

Digital Library

[9]

}}D. Boneh and B. Waters. A fully collusion resistant broadcast, trace, and revoke system. In CCS '06: Proceedings of the 13th ACM conference on Computer and communications security, pages 211--220, New York, NY, USA, 2006. ACM.

Digital Library

[10]

}}H. Chabanne, D. H. Phan, and D. Pointcheval. Public traceability in traitor tracing schemes. In EUROCRYPT, pages 542--558, 2005.

Digital Library

[11]

}}B. Chor, A. Fiat, and M. Naor. Tracing traitors. In CRYPTO '94: Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology, pages 257--270, London, UK, 1994. Springer-Verlag.

Digital Library

[12]

}}Y. Dodis and N. Fazio. Public key trace and revoke scheme secure against adaptive chosen ciphertext attack. In Public Key Cryptography, pages 100--115, 2003.

Digital Library

[13]

}}D. M. Freeman. Converting pairing-based cryptosystems from composite-order groups to prime-order groups. In Preprint, 2009.

[14]

}}C. Gentry and B. Waters. Adaptive security in broadcast encryption systems (with short ciphertexts). In EUROCRYPT, pages 171--188, 2009.

[15]

}}A. Kiayias and M. Yung. Breaking and repairing asymmetric public-key traitor tracing. In Digital Rights Management Workshop, pages 32--50, 2002.

[16]

}}A. Kiayias and M. Yung. Traitor tracing with constant transmission rate. In EUROCRYPT, pages 450--465, 2002.

Digital Library

[17]

}}K. Kurosawa and Y. Desmedt. Optimum traitor tracing and asymmetric schemes. In EUROCRYPT, pages 145--157, 1998.

[18]

}}B. Lynn. The pairing-based cryptography library.

[19]

}}S. Mitsunari, R. Sakai, and M. Kasahara. A new traitor tracing. In IEICE Trans. Fundamentals, pages E85--A(2):481--484, 2002.

[20]

}}A. Miyaji, M. Nakabayashi, and S. Takano. Characterization of elliptic curve traces under fr-reduction. In ICISC, pages 90--108, 2000.

Digital Library

[21]

}}M. Naor and B. Pinkas. Efficient trace and revoke schemes. In Financial Cryptography, pages 1--20, 2000.

Digital Library

[22]

}}B. Pfitzmann. Trials of traced traitors. In Information Hiding, pages 49--64, 1996.

[23]

}}B. Pfitzmann and M. Waidner. Asymmetric fingerprinting for larger collusions. In ACM Conference on Computer and Communications Security, pages 151--160, 1997.

Digital Library

[24]

}}V. D. T ô, R. Safavi-Naini, and F. Zhang. New traitor tracing schemes using bilinear map. In DRM '03: Proceedings of the 3rd ACM workshop on Digital rights management, pages 67--76, New York, NY, USA, 2003. ACM.

Digital Library

[25]

}}Y. Watanabe, G. Hanaoka, and H. Imai. Efficient asymmetric public-key traitor tracing without trusted agents. In CT-RSA, pages 392--407, 2001.

Digital Library

[26]

}}B. Waters. Dual system encryption: Realizing fully secure ibe and hibe under simple assumptions. In CRYPTO, pages 619--636, 2009.

Digital Library

Cited By

Liu YHu YLv XZhou SLi JLiu S(2025)A blockchain and IPFS-Aided anonymous traitor tracing scheme based on puncturable encryption in Industrial Internet of ThingsComputers and Electrical Engineering10.1016/j.compeleceng.2024.109896122(109896)Online publication date: Mar-2025
https://doi.org/10.1016/j.compeleceng.2024.109896
Luo J(2024)Ad Hoc Broadcast, Trace, and RevokeIACR Communications in Cryptology10.62056/a39qxrxqiOnline publication date: 8-Jul-2024
https://doi.org/10.62056/a39qxrxqi
Fan KLi WBai YYang YYang KLi H(2024)EIV-BT-ABE: Efficient Attribute-Based Encryption With Black-Box Traceability Based on Encrypted Identity VectorIEEE Internet of Things Journal10.1109/JIOT.2023.334513411:9(15229-15240)Online publication date: 1-May-2024
https://doi.org/10.1109/JIOT.2023.3345134
Show More Cited By

Index Terms

Building efficient fully collusion-resilient traitor tracing and revocation schemes
1. Security and privacy
  1. Cryptography
    1. Public key (asymmetric) techniques
      1. Public key encryption

Recommendations

Further analysis of pairing-based traitor tracing schemes for broadcast encryption

Pairing-based public key systems have recently received much attention because bilinear property contributes to the designs of many cryptographic schemes. In 2002, Mitsunari et al. proposed the first pairing-based traitor tracing scheme with constant-...
Fully collusion resistant black-box traitor revocable broadcast encryption with short private keys
ICALP'07: Proceedings of the 34th international conference on Automata, Languages and Programming

Broadcast encryption schemes enable senders to efficiently broadcast ciphertexts to a large set of receivers in a way that only nonrevoked receivers can decrypt them. Black-box traitor revocable broadcast encryption schemes are broadcast encryption ...
Collusion resistant traitor tracing from learning with errors
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing

In this work we provide a traitor tracing construction with ciphertexts that grow polynomially in log(n) where n is the number of users and prove it secure under the Learning with Errors (LWE) assumption. This is the first traitor tracing scheme with ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CCS '10: Proceedings of the 17th ACM conference on Computer and communications security

October 2010

782 pages

ISBN:9781450302456

DOI:10.1145/1866307

General Chair:
Ehab Al-Shaer
University of North Carolina, Charlotte, USA
,
Program Chairs:
Angelos D. Keromytis
Columbia University, USA
,
Vitaly Shmatikov
University of Texas at Austin, USA

Copyright © 2010 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

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 October 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CCS '10

Sponsor:

SIGSAC

CCS '10: 17th ACM Conference on Computer and Communications Security 2010

October 4 - 8, 2010

Illinois, Chicago, USA

Acceptance Rates

CCS '10 Paper Acceptance Rate 55 of 325 submissions, 17%;

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

62
Total Citations
View Citations
651
Total Downloads

Downloads (Last 12 months)18
Downloads (Last 6 weeks)4

Reflects downloads up to 12 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Liu YHu YLv XZhou SLi JLiu S(2025)A blockchain and IPFS-Aided anonymous traitor tracing scheme based on puncturable encryption in Industrial Internet of ThingsComputers and Electrical Engineering10.1016/j.compeleceng.2024.109896122(109896)Online publication date: Mar-2025
https://doi.org/10.1016/j.compeleceng.2024.109896
Luo J(2024)Ad Hoc Broadcast, Trace, and RevokeIACR Communications in Cryptology10.62056/a39qxrxqiOnline publication date: 8-Jul-2024
https://doi.org/10.62056/a39qxrxqi
Fan KLi WBai YYang YYang KLi H(2024)EIV-BT-ABE: Efficient Attribute-Based Encryption With Black-Box Traceability Based on Encrypted Identity VectorIEEE Internet of Things Journal10.1109/JIOT.2023.334513411:9(15229-15240)Online publication date: 1-May-2024
https://doi.org/10.1109/JIOT.2023.3345134
Liu SPan HWang XZhao SLi Q(2024)A traceable and revocable broadcast encryption scheme for preventing malicious encryptors in Medical IoTJournal of Systems Architecture10.1016/j.sysarc.2024.103100149(103100)Online publication date: Apr-2024
https://doi.org/10.1016/j.sysarc.2024.103100
Liu SHu YWang XLiu XYin YWang T(2024)Puncturable-based broadcast encryption with tracking for preventing malicious encryptors in cloud file sharingJournal of Information Security and Applications10.1016/j.jisa.2024.10380384(103803)Online publication date: Aug-2024
https://doi.org/10.1016/j.jisa.2024.103803
Boneh DPartap ARotem L(2024)Accountability for Misbehavior in Threshold Decryption via Threshold Traitor TracingAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68394-7_11(317-351)Online publication date: 18-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-68394-7_11
Boneh DPartap ARotem L(2024)Traceable Secret Sharing: Strong Security and Efficient ConstructionsAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68388-6_9(221-256)Online publication date: 17-Aug-2024
https://doi.org/10.1007/978-3-031-68388-6_9
He XLi LPeng H(2023)An enhanced traceable CP-ABE scheme against various types of privilege leakage in cloud storageJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2023.102833136:COnline publication date: 1-Mar-2023
https://dl.acm.org/doi/10.1016/j.sysarc.2023.102833
Mandal MSarkar R(2023)Efficient identity-based traceable cloud data broadcasting with outsider anonymity and simultaneous individual transmissionJournal of Information Security and Applications10.1016/j.jisa.2023.10358478(103584)Online publication date: Nov-2023
https://doi.org/10.1016/j.jisa.2023.103584
Aono YShikata J(2023)Anonymous Broadcast Authentication with Logarithmic-Order Ciphertexts from LWECryptology and Network Security10.1007/978-981-99-7563-1_2(28-50)Online publication date: 31-Oct-2023
https://doi.org/10.1007/978-981-99-7563-1_2
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