Information-theoretic bounds for authentication codes and block designs

DOI10.1007/BF00191354zbMath0839.94008OpenAlexW2037666339MaRDI QIDQ1903343

Pei Dingyi

Publication date: 24 June 1996

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

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

zbMATH Keywords

authentication codessubstitutionimpersonationpartially balanced \(t\)-designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Authentication, digital signatures and secret sharing (94A62)

Related Items

A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities ⋮ A construction for \(t\)-fold perfect authentication codes with arbitration ⋮ On message authentication with a correlated setup ⋮ Existence of optimal strong partially balanced designs with block size five. ⋮ Authentication codes and bipartite graphs ⋮ A new class of 3-fold perfect splitting authentication codes ⋮ Existence of optimal strong partially balanced designs ⋮ Some new classes of 2-fold optimal or perfect splitting authentication codes ⋮ A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields ⋮ The spectrum of optimal strong partially balanced designs with block size five ⋮ Three constructions of authentication/secrecy codes ⋮ Existence of resolvable optimal strong partially balanced designs ⋮ The power of primes: security of authentication based on a universal hash-function family ⋮ Resolvable optimal strong partially balanced designs with block size four

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The combinatorics of authentication and secrecy codes
• Information-theoretic bounds for authentication schemes
• 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 lower bound on authentication after having observed a sequence of messages
• Authentication Theory/Coding Theory
• Application of the Geometry of Quadrics for Constructing PBIB Designs
• Bounds on the probability of deception in multiple authentication