Abstract
Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we give a formal definition of multireceiver authentication codes, derive information theoretic and combinatorial lower bounds on their performance and give new efficient constructions for such codes, our constructions are based on the linear error-correcting codes.
Chapter PDF
Similar content being viewed by others
References
A. Beutelspacher, Perfect and essentially perfect authentication systems, Lecture Notes in Computer Science 304(1988), 167–170. (Advances in Cryptology—Eurocrypt’ 87).
E. F. Brickell, A few results in message authentication, Congressus Numerantium, Vol.43 (1984), 141–154.
T. Cover and J. Thomas, Elements of Information Theory, New York; Wiley, 1991.
Y. Desmedt, Y. Frankel and M. Yung, Multi-receiver/Multi-sender network security: efficient authenticated multicast/feedback, IEEE Infocom’92, (1992) 2045–2054.
A. Fiat and M. Naor, Broadcast Encryption. In “Advances in Cryptology — Crypto’ 93„, Lecture Notes in Computer Science 773 (1994), 480–491.
H. Fujii, W. Kachen and K. Kurosawa, Combinatorial bounds and design of broadcast authentication, IEICE Trans., VolE79-A, No. 4 (1996) 502–506.
E. N. Gilbert, F. J. MacWilliams and N. J. A. Sloane, Codes which detect deception, The Bell System Technical Journal, Vol.33, No.3, 405–424(1974).
T. Johansson, Lower Bounds on the Probability of Deception in Authentication with Arbitration, IEEE Trans. on Information Theory, Vol.40, No.5, (1994) 1573–1585.
T. Johansson, G. Kabatianskii and B. Smeets, On the relation between A-codes and codes correcting independent errors. In “Advances in Cryptology — Eurocrypt’ 93„, Lecture Notes in Computer Science 765 (1993), 1–11.
K. Kurosawa and S. Obana, Characterisation of (k; n) multi-receiver authentication, Information Security and Privacy, ACISP’97, Lecture Notes in Cpmput. Sci. 1270, (1997) 204–215.
F. J. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes, New-York; NorthHolland, 1977.
J. L. Massey, Cryptography-a selective survey, Digital Communications, North Holland(pub) (1986) 3–21.
D. Pei, Information-Theoretic Bounds for Authentication Codes and Block Designs, J. of Cryptology, 8 (1995) 177–188.
R. Safavi-Naini and H. Wang, New results on multi-receiver authentication codes, Advances in Cryptology — Eurocrypt’ 98, Lecture Notes in Comp. Sci., 1403 (1998), 527–541.
R. Safavi-Naini and H. Wang, Multireceiver Authentication Codes: Model, Bounds, Constructions and Extensions, Information and Computation, to appear.
G. J. Simmons, Authentication theory/coding theory, Lecture Notes in Comput. Sci., 196 411–431. (Crypto’ 84).
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.
B. Smeets, Bounds on the Probability of Deception in Multiple Authentication, IEEE Trans. of Information Theory, Vol.40, No.5, (1994) 1586–1591.
D. R. Stinson, The combinatorics of authentication and secrecy codes, J. Cryptology 2, (1990), 23–390.
D. R. Stinson, Universal Hashing and authentication codes, Designs, Codes and Cryptography 4 (1994), 369–280.
D. R. Stinson, On some methods for unconditionally secure key distribution and broadcast encryption. Designs, Codes and Cryptography, 12 (1997), 215–243.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Safavi-Naini, R., Wang, H. (1998). Bounds and Constructions for Multireceiver Authentication Codes. In: Ohta, K., Pei, D. (eds) Advances in Cryptology — ASIACRYPT’98. ASIACRYPT 1998. Lecture Notes in Computer Science, vol 1514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49649-1_20
Download citation
DOI: https://doi.org/10.1007/3-540-49649-1_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65109-3
Online ISBN: 978-3-540-49649-6
eBook Packages: Springer Book Archive