The Combinatorics of Perfect Authentication Schemes

DOI10.1137/S0895480190178187zbMath0793.94003OpenAlexW2067047154MaRDI QIDQ4287943

Peter R. Wild, Michael Walker, Chris J. Mitchell

Publication date: 19 April 1994

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480190178187

zbMATH Keywords

maximum distance separable codesincidence structuresperfect authentication schemes

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Bounds on codes (94B65)

Related Items (4)

Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes ⋮ Authentication codes and bipartite graphs ⋮ Three constructions of authentication/secrecy codes ⋮ A lower bound on authentication after having observed a sequence of messages

This page was built for publication: The Combinatorics of Perfect Authentication Schemes