Some constructions and bounds for authentication codes

DOI10.1007/BF00206324zbMath0654.94011MaRDI QIDQ1109006

Douglas R. Stinson

Publication date: 1988

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

authentication codescombinatorial designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Cryptography (94A60) Other types of codes (94B60)

Related Items (16)

Universal hashing and authentication codes ⋮ A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ A construction for authentication/secrecy codes from certain combinatorial designs ⋮ Authentication codes in plaintext and chosen-content attacks ⋮ Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes ⋮ A construction for authentication/secrecy codes from 3-homogeneous permutation groups ⋮ Algebraic manipulation detection codes ⋮ The combinatorics of authentication and secrecy codes ⋮ A construction of maximal linearly independent array ⋮ Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\). ⋮ New bounds and constructions for authentication/secrecy codes with splitting ⋮ Affine-invariant strictly cyclic Steiner quadruple systems ⋮ Incidence structures applied to cryptography ⋮ On the construction of authentication and secrecy codes ⋮ A lower bound on authentication after having observed a sequence of messages ⋮ A shift register construction of unconditionally secure authentication codes

Cites Work

• Authentication Theory/Coding Theory
• Codes Which Detect Deception
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some constructions and bounds for authentication codes