Advertisement

Designs, Codes and Cryptography

, Volume 35, Issue 1, pp 47–61 | Cite as

A Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares

  • Wen-Guey TzengEmail author
  • Zhi-Jia Tzeng
Article

Abstract.

We proposed a new public-key traitor tracing scheme with revocation capability using dynamic shares and entity revocation techniques. Our scheme’s traitor tracing and revocation programs cohere tightly. The size of the enabling block of our scheme is independent of the number of receivers. Each receiver holds one decryption key only. The distinct feature of our scheme is that when traitors are found, we can revoke their private keys (up to some threshold z) without updating the private keys of other receivers. In particular, no revocation messages are broadcast and all receivers do nothing. Previously proposed revocation schemes need update existing keys and entail large amount of broadcast messages. Our traitor tracing algorithm works in a black-box way. It is conceptually simple and fully k-resilient, that is, it can find all traitors if the number of them is k or less. The encryption algorithm of our scheme is semantically secure assuming that the decisional Diffie-Hellman problem is hard.

Keywords

broadcast encryption traitor tracing revocation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abdalla, Y. Shavitt and A. Wool, Key management for restricted multicast using broadcast encryption, In Proc. of Financial Cryptology 99, Lecture Notes in Computer Science 1648, Springer-Verlag (1999).Google Scholar
  2. J. Anzai, N. Matsuzaki and T. Matsumoto, A quick group key distribution scheme with ‘‘entity revocation’’, In Proc. of Advances in Cryptology - Asiacrypt 99, Lecture Notes in Computer Science 1716, Springer-Verlag (1999) pp. 333–347.Google Scholar
  3. D. Boneh and M. Franklin, An efficient public key traitor tracing scheme, Proceedings of Advances in Cryptology - Crypto 99, Lecture Notes in Computer Science 1666, Springer-Verlag (1999) pp. 338–353.Google Scholar
  4. D.Boneh and J.Shaw, Collusion-secure fingerprinting for digital data, IEEE Transaction on Information Theory 44(5),1998. In Proc. of Advances in Cryptology - Crypto 95, Lecture Notes in Computer Science 963, pp. 452--465,Springer-Verlag (1995) pp. 1897--1905. Google Scholar
  5. Canetti, R., Malkin, T., Nissim, K. 1999Efficient communication-storage tradeoffs for multicast encryptionLecture Notes in Computer Science1592459474In Proc. of Advances in Cryptology - Eurocrypt 99CrossRefGoogle Scholar
  6. B. Chor, A. Fiat and M. Naor, Tracing traitors, In Proc. of Advances in Cryptology - Crypto 94, Lecture Notes in Computer Science 839, Springer-Verlag (1994) pp. 257–270.Google Scholar
  7. ElGamal, T. 1985A public-key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory31469472zbMATHMathSciNetGoogle Scholar
  8. A. Fiat and T. Tassa, Dynamic traitor tracing, In Proc. of Advances in Cryptology - Crypto 99, Lecture Notes in Computer Science 1666, Springer-Verlag (1999) pp. 354–371.Google Scholar
  9. A. Fiat and M. Naor, Broadcast encryption, In Proc. of Advances in Cryptology - Crypto 93, Lecture Notes in Computer Science 773, Springer-Verlag (1993) pp. 480–491.Google Scholar
  10. E. Gafni, J. Staddon and Y. L. Yin, Efficient methods for integrating traceability and broadcast encryption, In Proc. of Advances in Cryptology - Crypto 99, Lecture Notes in Computer Science 1666, Springer-Verlag (1999) pp. 372–387.Google Scholar
  11. R. Kumar, S. Rajagopalan and A. Sahai, Coding constructions for blacklisting problems without computational assumptions, In Proc. of Advances in Cryptology - Crypto 99, Lecture Notes in Computer Science 1666, Springer-Verlag (1999) pp. 609–623.Google Scholar
  12. K. Kurosawa and Y. Desmedt, Optimum traitor tracing and asymmetric schemes, In Proc. of Advances in Cryptology - Eurocrypt 98, Lecture Notes in Computer Science 1403, Springer-Verlag (1998) pp. 145–157.Google Scholar
  13. K. Kurosawa and Y. Yoshida, Linear code implies public-key traitor tracing, In Proc. of the 5th International Workshop on Practive and Theory in Public Key Cryptosystems (PKC 02), Lecture Notes in Computer Science 2274, Springer-Verlag (2002) pp. 172–187.Google Scholar
  14. M. Luby and J. Staddon, Combinatorial bounds for braodcast encryption, In Proc. of Advances of Cryptology - Eurocrypt 98, Lecture Notes in Compouter Science 1403, Springer-Verlag (1998) pp. 512–526.Google Scholar
  15. M. Naor and B. Pinkas, Threshold traitor tracing, In Proc. of Advances in Cryptology - Crypto 98, Lecture Notes in Computer Science 1462, Springer-Verlag (1998) pp. 502–517.Google Scholar
  16. M. Naor and B. Pinkas, Efficient trace and revoke schemes, In Proc. of Financial Cryptography 00 (2000).Google Scholar
  17. B. Pfitzmann, Trials of traced traitors, In Proc. of Workshop on Information Hiding, Lecture Notes in Computer Science 1174, Springer-Verlag (1996) pp. 49–64.Google Scholar
  18. B. Pfitzmann and M. Waidner, Asymmetric fingerprinting for large collusions, In Proc. of ACM Conference on Computer and Communication Security, (1997) pp. 151–160.Google Scholar
  19. Stinson, D.R., Wei, R. 1998Combinatorial properties and constructions of traceability schemes and frameproof codesSIAM J. on Discrete Math114153zbMATHMathSciNetGoogle Scholar
  20. W.-G. Tzeng and Z.-J. Tzeng, A public-key traitor tracing scheme with revocation using dyanmic shares, In Proc. of the 4th International Workshop on Practive and Theory in Public Key Cryptosystems (PKC 01), Lecture Notes in Computer Science 1992, Springer-Verlag (2001) pp. 207–224.Google Scholar
  21. C. K. Wong, M. Gouda and S. Lam, Secure group communications using key graphs, In Proc. of ACM SIGCOMM ‘98 (1998) pp. 68–79.Google Scholar
  22. M. Yoshida and T. Fujiwara, An efficient traitor tracing scheme for broadcast encryption, In Proc. of 2000 IEEE International Symposium on Information Theory (2000) pp. 463.Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  1. 1.Department of Computer and Information ScienceNational Chiao Tung UniversityHsinchuTaiwan

Personalised recommendations