Authentication codes and bipartite graphs

DOI10.1016/j.ejc.2007.06.013zbMath1168.94507OpenAlexW2028079207MaRDI QIDQ932829

Lei Hu, Jin Ho Kwok, Rong Quan Feng

Publication date: 11 July 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.06.013

zbMATH Keywords

association schemesbipartite graphsauthentication codesimpersinationminimal authentication code with perfect secretysubstitution attack

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Cryptography (94A60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

Anzahl formulas of subspaces in symplectic spaces and their applications ⋮ Singular linear space and its applications ⋮ Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields ⋮ New methods of construction of Cartesian authentication codes from geometries over finite commutative rings ⋮ Коды аутентификации с секретностью (обзор) ⋮ A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM ORTHOGONAL SPACES OVER A FINITE FIELD OF ODD CHARACTERISTIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The combinatorics of authentication and secrecy codes
• Key-minimal cryptosystems for unconditional secrecy
• Combinatorial characterizations of authentication codes
• Construction of Cartesian authentication codes from unitary geometry
• New combinatorial bounds for authentication codes and key predistribution schemes
• Bounds and characterizations of authentication/secrecy schemes
• Cartesian authentication codes from functions with optimal nonlinearity.
• Information-theoretic bounds for authentication codes and block designs
• Combinatorial characterizations of authentication codes. II
• Communication Theory of Secrecy Systems*
• Authentication Theory/Coding Theory
• On Automorphism Groups of Divisible Designs
• The Combinatorics of Perfect Authentication Schemes
• Codes Which Detect Deception
• Constructions of authentication codes from algebraic curves over finite fields
• On the cardinality of systematic authentication codes via error-correcting codes
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Authentication codes and bipartite graphs