Broadcast authentication in group communication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1716, Issue , 1999, Pages 1-14

  Safavi Naini, Rei ^a   Wang, Huaxiong ^b  

^a UNIVERSITY OF WOLLONGONG   (Australia)

^b Department of Computer Science ^*  (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; COMPUTATION THEORY; COMPUTER NETWORKS; CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS; MULTICASTING; SECURITY OF DATA;

AUTHENTICATION CODES; AUTHENTICATION SYSTEMS; BROADCAST AUTHENTICATION; COMPUTATIONAL SECURITY; CONFERENCE KEY DISTRIBUTION SYSTEM; GROUP COMMUNICATIONS; MESSAGE AUTHENTICATION; PERFECT HASH FAMILY;

CODES (SYMBOLS);

EID: 84956852177     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (24)

1. M. Atici, S.S. Magliveras, D. R. Stinson and W.D. Wei, Some Recursive Constructions for Perfect Hash Families. Journal of Combinatorial Designs 4(1996), 353-363. 408
2. M. Bellare, R. Canetti and H. Krawczyk, Key hash functions for message authentication, in Advance in Cryptology–Crypto’96, LNCS, 1109(1996), 1-15.
3. S. R. Blackburn, Combinatorics and Threshold Cryptology, in Combinatorial Designs and their Applications, Chapman & Hall/CRC Res. Notes Math. Vol. 403(1997), 49-70. 407, 408
4. S. R. Blackburn, M. Burmester, Y. Desmedt and P. R. Wild, “Efficient multiplicative sharing schemes,” in Advance in Cryptology–Eurocrypt’96, LNCS, 1070(1996), 107-118. 407
5. S.R. Blackburn and P.R. Wild, Optimal linear perfect hash families, J. Comb. Theory - Series A, 83(1998), 233-250. 408
6. C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro and M. Yung, Perfectly secure key distribution for dynamic conferences. Lecture Notes in Computer Science 740(1993), 471-486 (Advances in Cryptology – CRYPTO’92) 401, 408
7. Z. J. Czech, G. Havas and B. S. Majewski, Perfect Hasing, Theoretical Computer Science 182(1997), 1-143. 408
8. Y. Desmedt, Y. Frankel and M. Yung, Multi-receiver/Multi-sender network security: efficient authenticated multicast/feedback, IEEE Infocom’92, (1992) 2045-2054. 400, 402, 406
9. M. Dyer, T. Fenner, A. Frieze and A. Thomason, On key storage in secure Networks. Journal of Cryptology 8(1995), 189-200. 404
10. A. Fiat and M. Naor, Broadcast Encryption. In “Advances in Cryptology – Crypto’93”, Lecture Notes in Computer Science 773 (1994), 480-491. 407, 408
11. H. Fujii, W. Kachen and K. Kurosawa, Combinatorial bounds and design of broadcast authentication, IEICE Trans., VolE79-A, No. 4(1996)502-506. 402
12. L. Gong and D. J. Wheeler, A matrix key-distribution scheme. J. Cryptology, Vol.2(1990), 51-59. 404
13. K. Kurosawa and S. Obana, Characterization of (k, n) multi-receiver authentication, Information Security and Privacy, ACISP’97, Lecture Notes in Comput. Sci. 1270,(1997) 204-215. 402
14. T. Matsumoto, Incidence structures for key sharing, Lecture Notes in Computer Science 917(1995), 242-253(Advances in Cryptology–Asiacrypt’94). 404
15. K. Mehlhorn, Data Structures and Algorithms, Vol. 1, Springer-Verlag, 1984. 408
16. C. J. Mitchell and F. C. Piper, Key storage in secure networks. Discrete Applied Mathematics21(1988), 215-228. 401, 404
17. C. M. O’Keefe, Key distribution patterns using Minkowski planes.Designs, Codes and Cryptography 5(1995) 261-267. 404
18. R. Safavi-Naini and H. Wang, New results on multi-receiver authentication codes, Advances in Cryptology – Eurocrypt’98, Lecture Notes in Computer Science, 1438(1998), 527-541. 400, 401, 402, 404
19. R. Safavi-Naini and H. Wang, Bounds and constructions for multireceiver authentication codes, Advances in Cryptology – Asiacrypt’98, Lecture Notes in Computer Science, 242-256.
20. R. Safavi-Naini and H. Wang, Multireceiver authentication codes: models, bounds, constructions and extensions, Information and Computation 151(1999), 148-172 401, 404
21. G. J. Simmons, A survey of information authentication, in Contemporary Cryptol-ogy, The Science of Information Integrity, G.J. Simmons, ed., IEEE Press, (1992), 379-419.
22. D. R. Stinson, On some methods for unconditionally secure key distribution and broadcast encryption. Designs, Codes and Cryptography, 12(1997), 215-243. 404, 408
23. D. R. Stinson, T. van Trung and R. Wei, Secure frameproof codes, key distribution patterns, group testing algorithms and related structures, J. Statist. Plan. Infer., to appear. 401, 404
24. M. N. Wegman and J. L. Carter, New hash functions and their use in authentication and set equality, J. of Computer and System Science 22(1981), 265-279. 410