Combinatorial bounds on authentication codes with arbitration.

DOI10.1023/A:1008398306907zbMath1053.94016OpenAlexW1506008146MaRDI QIDQ5931255

Satoshi Obana, Kaoru Kurosawa

Publication date: 3 July 2001

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008398306907

zbMATH Keywords

cryptography, authentication code, arbitration

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

Three constructions of perfect authentication codes from projective geometry over finite fields ⋮ GOB designs for authentication codes with arbitration ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ Disjoint difference families and their applications ⋮ The power of primes: security of authentication based on a universal hash-function family

This page was built for publication: Combinatorial bounds on authentication codes with arbitration.