A lower bound on authentication after having observed a sequence of messages

DOI10.1007/BF00198462zbMath0782.68041MaRDI QIDQ1310451

Ute Rosenbaum

Publication date: 3 January 1994

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

zbMATH Keywords

authentication systems

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (9)

Information-theoretic bounds for authentication codes and block designs ⋮ Authentication codes in plaintext and chosen-content attacks ⋮ Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes ⋮ On message authentication with a correlated setup ⋮ A class of authentication codes with secrecy ⋮ Some new classes of 2-fold optimal or perfect splitting authentication codes ⋮ Three constructions of authentication/secrecy codes ⋮ Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction ⋮ General lower bounds for chosen-content attacks against authentication codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The combinatorics of authentication and secrecy codes
• Information-theoretic bounds for authentication schemes
• Some constructions and bounds for authentication codes
• Authentication Theory/Coding Theory
• The Practice of Authentication
• The Combinatorics of Perfect Authentication Schemes
• Bounds on the probability of deception in multiple authentication
• Codes Which Detect Deception

This page was built for publication: A lower bound on authentication after having observed a sequence of messages