Abstract
A cover-free family is a well-studied combinatorial structure that has many applications in computer science and cryptography. In this paper, we propose a new public key traitor tracing scheme based on cover-free families. The new traitor tracing scheme is similar to the Boneh-Franklin scheme except that in the Boneh-Franklin scheme, decryption keys are derived from Reed-Solomon codes while in our case they are derived from a cover-free family. This results in much simpler and faster tracing algorithms for single-key pirate decoders, compared to the tracing algorithms of Boneh-Franklin scheme that use Berlekamp-Welch algorithm. Our tracing algorithms never accuse innocent users and identify all traitors with overwhelming probability.
Chapter PDF
References
Berlekamp, E.R., Welch, L.: Error Correction of Algebraic Block Codes, U.S. Patent No. 4633470 (1986)
Boneh, D., Franklin, M.K.: An Efficient Public Key Traitor Scheme (Extended Abstract). In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 338–353. Springer, Heidelberg (1999)
Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 257–270. Springer, Heidelberg (1994)
Cramer, R., Shoup, V.: A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13–25. Springer, Heidelberg (1998)
Dodis, Y., Fazio, N.: Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 100–115. Springer, Heidelberg (2002)
D’yachkov, A.G., Macula, A.J., Rykov, V.V.: New Constructions of Superimposed Codes. IEEE Transactions on Information Theory 46, 284–290 (2000)
D’yachkov, A.G., Rykov, V.V.: Bounds on the Length of Disjunctive Codes. Problemy Peredachi Informatsii 18, 7–13 (1982) (Russian)
Füredi, Z.: On r-Cover-Free Families. Journal of Combinatorial Theory A 73, 172–173 (1996)
Kautz, W.H., Singleton, R.C.: Nonrandom Binary Superimposed Codes. IEEE Transactions on Information Theory 10, 363–377 (1964)
Kiayias, A., Yung, M.: Self Protecting Pirates and Black-Box Traitor Tracing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 63–79. Springer, Heidelberg (2001)
Kiayias, A., Yung, M.: On Crafty Pirates and Foxy Tracers. In: Sander, T. (ed.) DRM 2001. LNCS, vol. 2320, pp. 22–39. Springer, Heidelberg (2002)
Kiayias, A., Yung, M.: Traitor Tracing with Constant Transmission Rate. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 450–465. Springer, Heidelberg (2002)
Kiayias, A., Yung, M.: Breaking and Repairing Asymmetric Public-Key Traitor Tracing. In: Feigenbaum, J. (ed.) DRM 2002. LNCS, vol. 2696, pp. 32–50. Springer, Heidelberg (2003)
Kim, C.H., Hwang, Y.-H., Lee, P.J.: An Efficient Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 359–373. Springer, Heidelberg (2003)
Kim, C.H., Hwang, Y.-H., Lee, P.J.: TTS without Revocation Capability Secure Against CCA2. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 36–49. Springer, Heidelberg (2004)
Kurosawa, K., Desmedt, Y.G.: Optimum Traitor Tracing and Asymmetric Schemes. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 145–157. Springer, Heidelberg (1998)
Kurosawa, K., Yoshida, T.: Linear Code Implies Public-Key Traitor Tracing. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 172–187. Springer, Heidelberg (2002)
Matsushita, T., Imai, H.: A Public-Key Black-Box Traitor Tracing Scheme with Sublinear Ciphertext Size Against Self-Defensive Pirates. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 260–275. Springer, Heidelberg (2004)
Naor, M., Pinkas, B.: Threshold Traitor Tracing. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 502–517. Springer, Heidelberg (1998)
Naor, M., Pinkas, B.: Efficient Trace and Revoke Schemes. In: Frankel, Y. (ed.) FC 2000. LNCS, vol. 1962, pp. 1–20. Springer, Heidelberg (2001)
Narayanan, A., Rangan, C.P., Kim, K.: Practical Pay TV Schemes. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, pp. 192–203. Springer, Heidelberg (2003)
Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)
Ruszinkó, M.: On the Upper Bound of the Size of the r-Cover-Free Families. Journal of Combinatorial Theory A 66, 302–310 (1994)
Safavi-Naini, R., Wang, H.: Multireceiver Authentication Codes: Models, Bounds, Constructions, and Extensions. Information and Computation 151, 148–172 (1999)
Stinson, D.R., van Trung, T., Wei, R.: Secure Frameproof Codes, Key Distribution Patterns, Group Testing Algorithms and Related Structures. Journal of Statistical Planning and Inference
Stinson, D.R., Wei, R., Zhu, L.: Some New Bounds for Cover-Free Families. Journal of Combinatorial Theory A 90, 224–234 (2000)
Tonien, D.: On a Traitor Tracing Scheme from ACISP 2003, Cryptology ePrint Archive 2005/371 (2005)
Tonien, D., Safavi-Naini, R.: An Efficient Single-Key Pirates Tracing Scheme USing Cover-Free Families, Cryptology ePrint Archive 2006/099 (2006)
Tzeng, W., Tzeng, Z.: A Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 207–224. Springer, Heidelberg (2001)
Yan, J., Wu, Y.: An Attack on Black-box Traitor Tracing Schemes, Rump session. In: IEEE Symposium on Security and Privacy, Oakland, USA (May 2001)
Yan, J., Wu, Y.: An Attack on A Traitor Tracing Scheme, Cryptology ePrint Archive Report 2001/067 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tonien, D., Safavi-Naini, R. (2006). An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families. In: Zhou, J., Yung, M., Bao, F. (eds) Applied Cryptography and Network Security. ACNS 2006. Lecture Notes in Computer Science, vol 3989. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11767480_6
Download citation
DOI: https://doi.org/10.1007/11767480_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34703-3
Online ISBN: 978-3-540-34704-0
eBook Packages: Computer ScienceComputer Science (R0)