Lower bounds for multicast message authentication

DOI10.1007/3-540-44987-6_27MaRDI QIDQ2778860zbMATH OpenFDO

Authors Dan Boneh, Glenn Durfee, Matthew Franklin

Publication date 21 March 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2045/20450437

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Multireceiver authentication codes: Models, bounds, constructions, and extensions
• Bounds and constructions for multireceiver authentication codes
• Aggregate Message Authentication Codes
• New results on multi-receiver authentication codes
• Multisender authentication systems with unconditional security

Cited in

(7)

• Lower bounds on the probability of successful substitution of messages
• Collusion-Resistant Message Authentication in Overlay Multicast Communication
• Multi-verifier signatures
• Broadcast authentication in group communication
• MMH: Software message authentication in the Gbit/second rates
• A Family of Collusion Resistant Symmetric Key Protocols for Authentication
• Aggregate Message Authentication Codes

This page was built for publication: Lower bounds for multicast message authentication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778860)