Authentication codes and bipartite graphs
DOI10.1016/J.EJC.2007.06.013zbMATH Open1168.94507OpenAlexW2028079207MaRDI QIDQ932829FDOQ932829
Jin Ho Kwak, Lei Hu, Rongquan 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
bipartite graphsassociation schemesauthentication codesimpersinationminimal authentication code with perfect secretysubstitution attack
Cryptography (94A60) Association schemes, strongly regular graphs (05E30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Communication Theory of Secrecy Systems*
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Codes Which Detect Deception
- On Automorphism Groups of Divisible Designs
- Combinatorial characterizations of authentication codes. II
- Authentication Theory/Coding Theory
- Key-minimal cryptosystems for unconditional secrecy
- Cartesian authentication codes from functions with optimal nonlinearity.
- Bounds and characterizations of authentication/secrecy schemes
- On the cardinality of systematic authentication codes via error-correcting codes
- Construction of Cartesian authentication codes from unitary geometry
- Information-theoretic bounds for authentication codes and block designs
- Combinatorial characterizations of authentication codes
- The combinatorics of authentication and secrecy codes
- The Combinatorics of Perfect Authentication Schemes
- Constructions of authentication codes from algebraic curves over finite fields
- New combinatorial bounds for authentication codes and key predistribution schemes
Cited In (9)
- Коды аутентификации с секретностью (обзор)
- A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM ORTHOGONAL SPACES OVER A FINITE FIELD OF ODD CHARACTERISTIC
- Combinatorial characterizations of authentication codes
- New methods of construction of Cartesian authentication codes from geometries over finite commutative rings
- Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields
- Authentication schemes from actions on graphs, groups, or rings
- Title not available (Why is that?)
- Singular linear space and its applications
- Anzahl formulas of subspaces in symplectic spaces and their applications
Recommendations
- Title not available (Why is that?) 👍 👎
- Combinatorial characterizations of authentication codes 👍 👎
- The combinatorics of authentication and secrecy codes 👍 👎
- Some constructions and bounds for authentication codes 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- 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 👍 👎
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)
