Authentication codes and bipartite graphs

DOI10.1016/J.EJC.2007.06.013MaRDI QIDQ932829zbMATH OpenOpenAlexFDO

Authors Lei Hu, Rongquan Feng, Jin Ho Kwak

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

bipartite graphsassociation schemesauthentication codesimpersinationminimal authentication code with perfect secretysubstitution attack

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 176540
• Combinatorial characterizations of authentication codes
• The combinatorics of authentication and secrecy codes
• Some constructions and bounds for authentication codes
• scientific article; zbMATH DE number 4045632
• scientific article; zbMATH DE number 1944666
• Discriminating codes in bipartite graphs
• Combinatorial characterizations of authentication codes. II
• Combinatorial Constructions for Optimal Splitting Authentication Codes
• Combinatorial bounds and characterizations of splitting authentication codes

Cites work

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

Cited in

(10)

• Authentication schemes from actions on graphs, groups, or rings
• A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM ORTHOGONAL SPACES OVER A FINITE FIELD OF ODD CHARACTERISTIC
• Combinatorial characterizations of authentication codes
• Cryptanalysis and improvements on some graph-based authentication schemes
• Anzahl formulas of subspaces in symplectic spaces and their applications
• Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields
• scientific article; zbMATH DE number 176540 (Why is no real title available?)
• Коды аутентификации с секретностью (обзор)
• New methods of construction of Cartesian authentication codes from geometries over finite commutative rings
• Singular linear space and its applications

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

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