scientific article; zbMATH DE number 3893245
From MaRDI portal
Publication:5184944
zbMath0561.05042MaRDI QIDQ5184944
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
2-person games (91A05) Measures of information, entropy (94A17) Authentication, digital signatures and secret sharing (94A62)
Related Items (27)
On generalized Howell designs with block size three ⋮ A Howell design admitting \(A_ 5\) ⋮ Kirkman's school projects ⋮ Information-theoretic bounds for authentication codes and block designs ⋮ Some constructions and bounds for authentication codes ⋮ A construction for authentication/secrecy codes from certain combinatorial designs ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ On the existence of three dimensional room frames and Howell cubes ⋮ A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities ⋮ Multi-part balanced incomplete-block designs ⋮ A construction for authentication/secrecy codes from 3-homogeneous permutation groups ⋮ The combinatorics of authentication and secrecy codes ⋮ A Cartesian product construction for unconditionally secure authentication codes that permit arbitration ⋮ New combinatorial designs and their applications to authentication codes and secret sharing schemes. ⋮ New bounds and constructions for authentication/secrecy codes with splitting ⋮ On existence of two classes of generalized Howell designs with block size three and index two ⋮ Incidence structures applied to cryptography ⋮ Combinatorial characterizations of authentication codes ⋮ Every SOMA\((n - 2, n)\) is Trojan ⋮ Symmetric factorial designs in blocks ⋮ Construction of 2-designs ⋮ Substitutes for the non-existent square lattice designs for 36 varieties ⋮ Message Authentication with Arbitration of Transmitter/Receiver Disputes ⋮ On balanced orthogonal multi-arrays: Existence, construction and application to design of experiments ⋮ Kirkman school project designs ⋮ Multireceiver authentication codes: Models, bounds, constructions, and extensions ⋮ A lower bound on authentication after having observed a sequence of messages
This page was built for publication:
