The combinatorics of authentication and secrecy codes

DOI10.1007/BF02252868zbMath0701.94006MaRDI QIDQ914645

Douglas R. Stinson

Publication date: 1990

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

zbMATH Keywords

combinatorial designs; combinatorics of unconditionally secure secrecy and authentication codes; encoding rules

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Bounds And Constructions For Threshold Shared Generation Of Authenticators, Isomorphism classes of authentication codes, Broadcast authentication for group communication, GOB designs for authentication codes with arbitration, Information-theoretic bounds for authentication schemes, Authentication codes and bipartite graphs, New bounds and constructions for authentication/secrecy codes with splitting, Halving \(\mathrm{PGL}(2,2^f)\), \(f\) odd: a series of cryptocodes, Some highly symmetric authentication perpendicular arrays, Incidence structures applied to cryptography, Combinatorial characterizations of authentication codes, Construction of 2-designs, A lower bound on authentication after having observed a sequence of messages, A family of perpendicular arrays achieving perfect 4-fold secrecy, Universal hashing and authentication codes, Cartesian authentication codes from functions with optimal nonlinearity., Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\)., The uniformly 3-homogeneous subsets of PGL\((2,q)\), On the construction of authentication and secrecy codes, Multireceiver authentication codes: Models, bounds, constructions, and extensions, Information-theoretic bounds for authentication codes and block designs, Authentication codes for nontrusting parties obtained from rank metric codes, Authentication codes in plaintext and chosen-content attacks, Subspaces in \(d\)-bounded distance-regular graphs and their applications, A TWOOA construction for multi-receiver multi-message authentication codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steiner pentagon systems
• A construction for authentication/secrecy codes from 3-homogeneous permutation groups
• Ein elementarer und konstruktiver Beweis für die Zerlegungsgleichheit der Hill'schen Tetraeder mit einem Quader. (An elementary and constructive proof for the equivalence by dissection of the Hill tetrahedra with a rectangular parallelepipedon)
• Some constructions and bounds for authentication codes
• A class of three-designs
• Communication Theory of Secrecy Systems*
• Authentication Theory/Coding Theory
• The Practice of Authentication
• A method for obtaining digital signatures and public-key cryptosystems
• Codes Which Detect Deception