Abstract
Solutions based on error-correcting codes for the blacklisting problem of a broadcast distribution system have been proposed by Kumar, Rajagopalan and Sahai. We have optimized their schemes by choosing the parameters properly. In this paper, we propose the further improvement for their schemes. On the transmission, the improved schemes with the parameters chosen for the optimized original schemes are more efficient than the optimized original schemes. The average amount of transmission is 70 percents of that for the optimized original scheme in one of the typical cases, while the amount of the storage is the same.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Anzai, N. Matsuzaki and T. Matsumoto, “Quick Group Key Distribution Scheme with Entity Revocation,” Advances in Cryptology—ASIACRYPT’ 99 (LNCS 1716), pp.333–347, Springer-Verlag, 1999.
C. Blundo, L. F. Mattos, and D. R. Stinson, “Generalized Beimel-Chor Schemes for Broadcast Encryption and Interactive Key Distribution,” Theoretical Computer Science, vol.200, nos 1–2, pp.313–334, 1998.
A. Fiat and M. Naor, “Broadcast Encryption,” Advances in Cryptology— CRYPTO’ 93 (LNCS 773), pp.480–491, Springer-Verlag, 1994.
J.A. Garay, J. Staddon and A. Wool, “Long-Lived Broadcast Encryption,” Advances in Cryptology—CRYPTO 2000 (LNCS 1880), pp.333–352, Springer-Verlag, 2000.
E. Gafni, J. Staddon and Y.L. Yin, “Efficient methods for integrating traceability and broadcast encryption,” Advances in Cryptology—CRYPTO’ 99 (LNCS 1666), pp.372–387, Springer-Verlag, 1999.
R. Kumar, S. Rajagopalan and A. Sahai, “Coding Constructions for Blacklisting Problems without Computational Assumptions,” Advances in Cryptology—CRYPTO’ 99 (LNCS 1666), pp.609–623, Springer-Verlag, 1999.
K. Kurosawa, T. Yoshida and Y. Desmedt, “Inherently Large Traceability of Broadcast Encryption Scheme,” Proc. of 2000 IEEE International Symposium on Information Theory, p.464, Sorrento, Italy, 2000.
M. Naor and B. Pinkas, “Efficient Trace and Revoke Schemes,” Financial Cryptography 2000, Anguilla, British West Indies, February 2000.
M. Yoshida, T. Horikawa and T. Fujiwara, “An Improvement of Coding Constructions for Blacklisting Problems,” Proc. of the 2000 International Symposium on Information Theory and Its Applications, pp.493–496, Honolulu, Hawaii, U.S.A., November2000.
M. Yoshida and T. Fujiwara, “Analysis and Optimization of Kumar-Rajagopalan-Sahai Coding Constructions for Blacklisting Problem,” IEICE Transactions of Fundamentals, vol.E84-A, no.9, pp.2338–2345, September 2001.
M. Yoshida and T. Fujiwara, “An Efficient Traitor Tracing Scheme for Broadcast Encryption,” Proc. of 2000 IEEE International Symposium on Information Theory, p.463, Sorrento, Italy, 2000.
R.L. Graham, D.E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoshida, M., Fujiwara, T. (2001). Further Improvement of Kumar-Rajagopalan-Sahai Coding Constructions for Blacklisting Problem. In: Honary, B. (eds) Cryptography and Coding. Cryptography and Coding 2001. Lecture Notes in Computer Science, vol 2260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45325-3_4
Download citation
DOI: https://doi.org/10.1007/3-540-45325-3_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43026-1
Online ISBN: 978-3-540-45325-3
eBook Packages: Springer Book Archive