Information-theoretic bounds for authentication schemes

DOI10.1007/BF00190800zbMath0705.94008OpenAlexW2046667687MaRDI QIDQ918497

Michael Walker

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1007/bf00190800

zbMATH Keywords

probabilityencoding schemeincidence structuresauthentication checksequence of messages

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Essentiallys-fold secure authentication systems of levell ⋮ Information-theoretic bounds for authentication codes and block designs ⋮ Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes ⋮ On message authentication with a correlated setup ⋮ Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction ⋮ A lower bound on authentication after having observed a sequence of messages

Cites Work

• Unnamed Item
• Unnamed Item
• The combinatorics of authentication and secrecy codes
• 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)
• A construction for authentication/secrecy codes from certain combinatorial designs
• Authentication Theory/Coding Theory
• Codes Which Detect Deception

This page was built for publication: Information-theoretic bounds for authentication schemes