Abstract
Message integrity from one sender to one receiver is typically achieved by having the two parties share a secret key to compute a Message Authentication Code (MAC). We consider the “multicast MAC”, which is a natural generalization to multiple receivers. We prove that one cannot build a short and efficient collusion resistant multicast MAC without a new advance in digital signature design.
Supported by NSF and the Packard Foundation.
Supported by a Microsoft Graduate Research Fellowship.
References
R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas, “Multicast Security: A taxonomy and some efficient constructions”, in IEEE INFOCOM'99, vol. 2, pp. 708–716, 1999.
A. De Santis and M. Yung, “On the design of provably-secure cryptographic hash functions”, in Proc. of Eurocrypt '90, LNCS 473, pp. 412–431, 1990.
Y. Desmedt, Y. Frankel, and M. Yung, “Multi-receiver/Multi-sender network security: efficient authenticated multicast/feedback”, in IEEE INFOCOM '92, pp. 2045–2054, 1992.
F. Fujii, W. Kachen, and K. Kurosawa, “Combinatorial bounds and design of broadcast authentication”, in IEICE Trans., vol. E79-A, no. 4, pp. 502–506, 1996.
R. Gennaro and P. Rohatgi, “How to sign digital streams”, in Proc. of Crypto '97, 1997.
S. Goldwasser, S. Micali, and R. Rivest, “A digital signature scheme secure against adaptive chosen-message attacks”, SIAM Journal of Computing, vol. 17, pp. 281–308, 1988.
P. Golle, N. Modadugo, “Streamed authentication in the presence of random packet loss”, in Proc..of 8th Annual Internet Society Symposium on Network and Distributed System Security (NDSS '01), San Diego, 2001.
K. Kurosawa, S. Obana, “Characterization of (k, n) multi-receiver authentication”, in Information Security and Privacy, ACISP '97, LNCS 1270, pp. 205–215, 1997.
M. Naor and M. Yung, “Universal one-way hash functions and their cryptographic applications”, in Proc. of 21st Annual ACM Symposium on Theory of Computing, pp. 33–43, 1989.
A. Perrig, R. Canetti, D. Tygar, D. Song, “Efficient Authentication and Signature of Multicast Streams over Lossy Channels”, in Proc. of 2000 IEEE Symposium on Security and Privacy, Oakland, 2000.
A. Perrig, R. Canetti, D. Song, D. Tygar, “Efficient and Secure Source Authentication for Multicast”, in Proc. of 8th Annual Internet Society Symposium on Network and Distributed System Security (NDSS '01), San Diego, 2001.
P. Rohatgi, “A compact and fast hybrid signature scheme for multicast packet authentication”, in Proc. of 6th ACM conference on Computer and Communication Security, 1999.
J. Rompel, “One-way functions are necessary and sufficient for secure signatures”, in Proc. of 22nd Annual ACM Symposium on Theory of Computing, pp. 387–394, 1990.
R. Safavi-Naini, H. Wang, “Multireceiver authentication codes: models, bounds, constructions and extensions”, Information and Computation, vol. 151, no. 1/2, pp. 148–172, 1999.
R. Safavi-Naini, H. Wang, “New results on multireceiver authentication codes”, in Proc. of Eurocrypt '98, LNCS 1403, pp. 527–541, 1998.
G. Simmons, “A cartesian product construction for unconditionally secure authentication codes that permit arbitration”, J. Cryptology, vol. 2, no. 2, pp. 77–104, 1990.
C. K. Wong, S. S. Lam, “Digital signatures for flows and multicasts”, IEEE ICNP '98. Also, University of Texas Austin, Computer Science Technical report TR 98-15.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boneh, D., Durfee, G., Franklin, M. (2001). Lower Bounds for Multicast Message Authentication. In: Pfitzmann, B. (eds) Advances in Cryptology — EUROCRYPT 2001. EUROCRYPT 2001. Lecture Notes in Computer Science, vol 2045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44987-6_27
Download citation
DOI: https://doi.org/10.1007/3-540-44987-6_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42070-5
Online ISBN: 978-3-540-44987-4
eBook Packages: Springer Book Archive