The Combinatorics of Perfect Authentication Schemes

DOI10.1137/S0895480190178187MaRDI QIDQ4287943zbMATH OpenOpenAlexFDO

Authors Michael Walker, Peter R. Wild, 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

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

Cited in

(6)

• Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes
• A lower bound on authentication after having observed a sequence of messages
• The combinatorial complexity of masterkeying
• Three constructions of authentication/secrecy codes
• Authentication schemes from actions on graphs, groups, or rings
• Authentication codes and bipartite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287943)