Abstract
We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excluded users can understand the contents of the message. Using error-correcting codes, and avoiding any computational assumptions in our constructions, we construct natural schemes that completely avoid any dependence on n in the transmission overhead.
Specifically, we construct: (i) (for illustrative purposes), a randomized scheme where the server’s storage is exponential (in n), but the transmission overhead is O(k), and each user’s storage is O(kn); (ii) a scheme based on polynomials where the transmission overhead is O(kn) and each user’s storage is O(kn); and (iii) a scheme using algebraic-geometric codes where the transmission overhead is O(k 2) and each user is required to store O(kn) keys. In the process of proving these results, we show how to construct very good cover-free set systems and combinatorial designs based on algebraic-geometric codes, which may be of independent interest and application. Our approach also naturally extends to solve the problem in the case where the broadcast channel may introduce errors or lose information.
Chapter PDF
Similar content being viewed by others
References
S. Berkovits. How to broadcast a secret. Proc. of EUROCRYPT, Springer LNCS 547:535–541, 1991.
E. R. Berlekamp. Bounded distance + 1 soft decision Reed-Solomon coding. IEEE Trans. on Information Theory, 42:704–720, 1996.
C. Blundo, L. F. Mattos, and D. R. Stinson. Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution. Theoretical Computer Science, 200(1–2):313–334, 1998.
R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas. Multicast security: A taxonomy and some efficient constructions. Proc. IEEE INFOCOM’99.
R. Canetti, T. Malkin, and K. Nissim. Efficient communication-storage tradeoffs for multicast encryption. Proc. EUROCRYPT 99, to appear.
B. Chor, A. Fiat, and M. Naor. Tracing traitors. Proc. CRYPTO, pp. 257–270, 1994.
H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23:493–509, 1952.
I. J. Cox, J. Kilian, T. Leighton, and T. Shamoon. A secure, robust watermark for multimedia. Workshop on Information Hiding. Newton Institute, University of Cambridge, 1996.
I. J. Cox and M. L. Miller. A review of watermarking and the importance of perceptual modeling. Proc. Electronic Imaging, 1997.
C. Dwork. Copyright? Protection? TheMathematics of Coding, Extraction, and Distribution: IMA Volumes in Mathematics and its Applications, 107, 1996.
C. Dwork, J. Lotspiech, and M. Naor. DigitalSignets: Self-enforcing protection of digital information. Proc. 28th ACM Symposium on Theory of Computing, pp. 489–498, 1996.
P. Erdos, P. Frankl, and Z. Furedi. Families of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics, 51:79–89, 1985.
A. Fiat and M. Naor. Broadcast encryption. Proc. CRYPTO, pp. 480–491, 1993.
IEEE. 1394 Specifications. Available from customer.service@ieee.org.
A. Garcia and H. Stichtenoth. A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound. Invent.Math., 121:211–222, 1995.
V. D. Goppa. Codes on algebraic curves. SovietMath. Dokl., 24:170–172, 1981.
Y. I. Manin and S. G. Vladut. Linear codes andmodular curves. J. SovietMath., 30:2611–2643, 1985.
S. Mittra. Iolus: A framework for scalable secure multicasting. Proc. ACM SIGCOMM Conference: Applications, Technologies,Architectures, and Protocols for Computer Communication, pp. 277–288, 1997.
M. A. Shokrollahi and H. Wasserman. Decoding algebraic-geometric codes beyond the error-correction bound. Proc. 30th ACM Symposium on Theory of Computing, pp. 241–248, 1998.
H. Stichtenoth. Algebraic Function Fields and Codes. Universitext, Springer-Verlag, 1993.
D. R. Stinson and T. van Trung. Some new results on key distribution patters and broadcast encryption. Designs, Codes, and Cryptography, to appear.
D. R. Stinson and R. Wei. An application of ramp schemes to broadcast encryption. Manuscript.
D. R. Stinson and R. Wei. Key preassigned traceability schemes for broadcast encryption. Manuscript.
L. Trevisan. Constructions of near-optimal extractors using pseudorandom generators. 31st ACM Symposium on Theory of Computing, pp. 141–148, 1999.
M. A. Tsfasman, S. G. Vladut, and Th. Zink. Modular curves, Shimura curves, and Goppa codes better than the Varshamov-Gilbert bound. Math. Nachrichten, 109:21–28, 1982.
D. M. Wallner, E. J. Harder, and R. C. Agee. Key management for multicast: Issues and architectures. ftp://ietf.org/internet-drafts/draftwallner-key-arch-01.txt
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, R., Rajagopalan, S., Sahai, A. (1999). Coding Constructions for Blacklisting Problems without Computational Assumptions. In: Wiener, M. (eds) Advances in Cryptology — CRYPTO’ 99. CRYPTO 1999. Lecture Notes in Computer Science, vol 1666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48405-1_38
Download citation
DOI: https://doi.org/10.1007/3-540-48405-1_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66347-8
Online ISBN: 978-3-540-48405-9
eBook Packages: Springer Book Archive