Multireceiver authentication codes: Models, bounds, constructions, and extensions

DOI10.1006/inco.1998.2769zbMath1011.94018OpenAlexW2077147915MaRDI QIDQ1854288

Huaxiong Wang, Reihaneh Safavi-Naini

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a36fea5aaefbe4a73268f67c2e0a136123be5335

zbMATH Keywords

performance boundsmultireceiver authentication

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (10)

Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Logarithm Cartesian authentication codes. ⋮ Some new constructions of authentication codes with arbitration and multi-receiver from singular symplectic geometry ⋮ Cartesian authentication codes from functions with optimal nonlinearity. ⋮ A TWOOA construction for multi-receiver multi-message authentication codes ⋮ Generalized cover-free families. ⋮ A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields ⋮ Broadcast authentication for group communication ⋮ A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields ⋮ Construction of Multi-receiver Multi-fold Authentication Codes from Singular Symplectic Geometry over Finite Fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The combinatorics of authentication and secrecy codes
• Families of finite sets in which no set is covered by the union of \(r\) others
• Key storage in secure networks
• New hash functions and their use in authentication and set equality
• Families of finite sets in which no set is covered by the union of two others
• Some constructions for key distribution patterns
• Universal hashing and authentication codes
• On some methods for unconditionally secure key distribution and broadcast encryption
• On key storage in secure networks
• Universal Hashing and Multiple Authentication
• Authentication Theory/Coding Theory
• Lower bounds on the probability of deception in authentication with arbitration
• Bounds on the probability of deception in multiple authentication

This page was built for publication: Multireceiver authentication codes: Models, bounds, constructions, and extensions