Abstract
Traceability schemes for broadcast encryption are defined by Chor, Fiat and Naor in [6] to protect against a possible coalition of users producing an illegal decryption key. Their scheme was then generalized by Stinson and Wei in [17]. These schemes assume that every user can decrypt the secret value. In this paper we discuss key preassigned traceability schemes, in which only the users in a specified privileged subset can decrypt. A new scheme is presented in this paper, which has better traceability than previous schemes. We also present a new threshold traceability scheme by using ramp scheme. All the constructions are explicit and could be implemented easily.
Chapter PDF
Similar content being viewed by others
Keywords
References
S. Berkovits, How to broadcast a secret, Advances in Cryptology: EUROCRYPT’ 91, Lecture Notes in Computer Science, 547 (1992), 536–541.
J. Bierbrauer, T. Johansson, G. Kabatianskii and B. Smeets, On families of hash functions via geometric codes and concatenation, Advances in Cryptology-CRYPTO’ 93, Lecture Notes in Computer Science, 773 (1994), 331–342.
C. Blundo, and A. Cresti, Space requirement for broadcast encryption, Advances in Cryptology: EUROCRYPT’94, Lecture Notes in Computer Science, 950 (1995), 287–298.
C. Blundo, L.A. Frota Mattos and D.R. Stinson, Trade-offs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution, Advances in Cryptology: CRYPTO’96, Lecture Notes in Computer Science, 1109 (1996), 387–400.
J. L. Carter and M. N. Wegman, Universal classes of hash functions, J. Computer and System Sci., 18 (1979), 143–154.
B. Chor, A. Fiat and M. Naor, Tracing traitors, Advances in Cryptology: CRYPTO’ 94, Lecture Notes in Computer Science 839 (1994), 257–270.
C.J. Colbourn and J.H. Dinitz, eds., CRC Handbook of Combinatorial Designs, CRC Press, Inc., 1996.
A. Fiat and M. Naor, Broadcast encryption, Advances in Cryptology: CRYPTO’93, Lecture Notes in Computer Science, 773 (1994), 480–491.
W-A. Jackson and K. M. Martin, A combinatorial interpretation of ramp schemes, Austral. J. Combinatorics 14 (1996), 51–60.
K. Kurosawa and Y. Desmedt, Optimum traitor tracing and asymmetric schemes, Advances in Cryptology: EUROCRYPT’98, Lecture Notes in Computer Science, 1403 (1998), 145–157.
M. Naor and B. Pinkas, Threshold traitor tracing, Advances in Cryptology: CRYPTO’ 98, Lecture Notes in Computer Science 1462 (1998), 502–517.
B. Pfitzmann, Trials of traced traitors, Information Hiding, Lecture Notes in Computer Science, 1174 (1996), 49–64. collusions, In
J.N. Staddon, A combinatorial study of communication, storage and traceability in broadcast encryption systems, PhD thesis, University of California at Berkeley, 1997.
D.R. Stinson, An explication of secret sharing schemes, Designs, Codes and Cryptography, 2 (1992), 357–390.
D.R. Stinson, On some methods for unconditionally secure key distribution and broadcast encryption, Designs, Codes and Cryptography, 12 (1997), 215–243
D.R. Stinson and Tran van Trung, Some new results on key distribution patterns and broadcast encryption, Designs, Codes and Cryptography, 14 (1998), 261–279.
D.R. Stinson and R. Wei, Combinatorial properties and constructions of traceability schemes and frameproof codes, SIAM J. Discrete Math, 11 (1998), 41–53.
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
Stinson, D.R., Wei, R. (1999). Key Preassigned Traceability Schemes for Broadcast Encryption. In: Tavares, S., Meijer, H. (eds) Selected Areas in Cryptography. SAC 1998. Lecture Notes in Computer Science, vol 1556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48892-8_12
Download citation
DOI: https://doi.org/10.1007/3-540-48892-8_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65894-8
Online ISBN: 978-3-540-48892-7
eBook Packages: Springer Book Archive