GOB designs for authentication codes with arbitration

DOI10.1007/S10623-006-0021-7zbMath1202.94202OpenAlexW2168568352MaRDI QIDQ851760

Gennian Ge, Ying Miao, Lie Zhu

Publication date: 22 November 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-006-0021-7

zbMATH Keywords

OptimalAuthentication code with arbitrationCombinatorial characterizationGOB design

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorial structures in finite projective spaces (51E20) Combinatorial codes (94B25) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration

Cites Work

• Unnamed Item
• The combinatorics of authentication and secrecy codes
• A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
• Combinatorial classification of optimal authentication codes with arbitration
• Error-correcting codes for authentication and subliminal channels
• Optimal authentication systems and combinatorial designs
• Lower bounds on the probability of deception in authentication with arbitration
• A2-code = Affine resolvable + BIBD
• Combinatorial bounds on authentication codes with arbitration.

This page was built for publication: GOB designs for authentication codes with arbitration