Abstract
In the model of (k,n) multi-receiver authentication codes there are n receivers. An opponent and any k — 1 receivers cannot cheat any other receiver. Here we show tight lower bounds on the size of messages and the size of keys for given cheating probabilities. We also show a necessary and sufficient condition for the optimum scheme, which is given by a combinatorial characterization between the transmitter's keys and the keys of each receiver.
Preview
Unable to display preview. Download preview PDF.
References
G. J. Simmons: A survey of Information Authentication, Contemporary Cryptology, The science of information integrity, ed. G. J. Simmons, IEEE Press, New York, (1992)
G. J. Simmons: Authentication theory/coding theory, Proc. Crypto '84, Lecture Notes in Computer Science 196, Springer Verlag (1985) 411–431
E. F. Brickell: A few results in message authentication, Congresus Numerantium, vol. 43 (1984) 141–154
G. J. Simmons: Message authentication: a game on hypergraphs, Congr. Number. 45 (1984) 161–192
J. L. Massey: Cryptography — a selective survey, Digital Communications, North Holland (pub.) (1986) 3–21
D. R. Stinson: Some constructions and bounds for authentication codes, Journal of Cryptology 1 (1988) 37–51
D. R. Stinson: The combinatorics of authentication and secrecy codes, Journal of Cryptology, Vol. 2, no 1 (1990) 23–49
D.R. Stinson: Combinatorial Characterization of Authentication Codes, Proc. Crypto'91, Lecture Notes in Computer Science 576, Springer Verlag (1992) 62–72
Marijke De Soete: New Bounds and Constructions for Authentication/Secrecy Codes with Splitting, Journal of Cryptology, Vol. 3, no 3 (1991) 173–186
Y. Desmedt, Y. Frankel and M. Yung: Multi-receiver/Multi-sender network security: efficient authenticated multicast/feedback, IEEE Infocom'92, (1992) 2045–2054
S. Raghavarao: Constructions and combinatorial problems in design of experiments, John Wiley & Sons, Inc. (1971).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurosawa, K., Obana, S. (1997). Characterization of (k, n) multi-receiver authentication. In: Varadharajan, V., Pieprzyk, J., Mu, Y. (eds) Information Security and Privacy. ACISP 1997. Lecture Notes in Computer Science, vol 1270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027927
Download citation
DOI: https://doi.org/10.1007/BFb0027927
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63232-0
Online ISBN: 978-3-540-69237-9
eBook Packages: Springer Book Archive