New results on multi-receiver authentication codes

  • R. Safavi-Naini
  • H. Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1403)


Multi-receiver authentication is an extension of traditional point-to-point message authentication in which a sender broadcasts a single authenticated message such that all the receivers can independently verify the authenticity of the message, and malicious groups of up to a given size of receivers can not successfully impersonate the transmitter, or substitute a transmitted message. This paper presents some new results on unconditionally secure multi-receiver authentication codes. First we generalize a polynomial construction due to Desmedt, Frankel and Yung, to allow multiple messages be authenticated with each key. Second, we propose a new flexible construction for multi-receiver A-code by combining an A-code and an (n, m, k)-cover-free family. Finally, we introduce the model of multi-receiver A-code with dynamic sender and present an efficient construction for that.


Authentication code Multi-receiver authentication code 


  1. 1.
    R. Blom, An optimal class of symmetric key generation systems, Lecture Notes in Computer Science, 209(1985), 335–338 (Advances in Cryptology-Eurocrypt '84)Google Scholar
  2. 2.
    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).MATHGoogle Scholar
  3. 3.
    B. den Boer, A simple and key-economical unconditional authentication scheme, Journal of Computer Security 2(1993), 65–71.Google Scholar
  4. 4.
    Y. Desmedt and Y. Frankel, Shared generation of authenticators and signatures, Adv. in Cryptology — Crypto '91, Lecture Notes in Comput. Sci., 576, 457–469.Google Scholar
  5. 5.
    Y. Desmedt, Y. Frankle and M. Yung, Multi-receiver/Multi-sender network security: efficient authenticated multicast/feedback, IEEE Infocom'92, (1992) 2045–2054.Google Scholar
  6. 6.
    Y. Desmedt and M. Yung, Arbitrated unconditionally secure authentication can be unconditionally protected against arbiter's attacks, Lecture Notes in Computer Science, 537(1991), 177–188 (Advances in Cryptology — Crypto '90).MATHGoogle Scholar
  7. 7.
    M. Dyer, T. Fenner, A. Frieze and A. Thomason, On key storage in secure networks, Journal of Cryptology 8(1995), 189–200.MATHCrossRefGoogle Scholar
  8. 8.
    P. Erdös, P. Frankl, and Z. Furedi, Families of finite sets in which no sets is covered by the union of two others, Journal of Combinatorial Theory, Series A 33(1982), 158–166.MATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    P. Erdös, P. Franlkl, and Z. Furedi, Families of finite sets in which no sets is covered by the union of r others, Israel Journal of Mathematics, 51(1985), 79–89.MATHMathSciNetGoogle Scholar
  10. 10.
    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.MATHCrossRefGoogle Scholar
  11. 11.
    J. L. Massey, Cryptography — a selective survey, Digital Communications, North Holland(pub) (1986)3–21.Google Scholar
  12. 12.
    G. J. Simmons, A survey of information authentication, in Contemporary Cryptology, The Science of Information Integrity, G.J. Simmons, ed., IEEE Press, (1992), 379–419.Google Scholar
  13. 13.
    D. R. Stinson, Universal hashing and authentication codes, Designs, Codes and Cryptography, 4(1994), 369–380.MATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    D. R. Stinson, On some methods for unconditionally secure key distribution and broadcast encryption, Designs, Codes and Cryptography, 12(1997), 215–243.MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • R. Safavi-Naini
    • 1
  • H. Wang
    • 1
  1. 1.School of IT and CSUniversity of WollongongWollongongAustralia

Personalised recommendations