Combinatorial characterizations of authentication codes

DOI10.1007/3-540-46766-1_4MaRDI QIDQ4035707zbMATH OpenFDO

Authors D. R. Stinson

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46766-1_4

zbMATH Keywords

authentication codesbalanced incomplete block designscombinatorial characterizationsorthogonal arrays

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Combinatorial characterizations of authentication codes
• Combinatorial characterizations of authentication codes. II
• Construction and comparison of authentication codes
• The combinatorics of authentication and secrecy codes
• Authentication codes and bipartite graphs

Cited in

(12)

• Combinatorial characterizations of authentication codes
• Combinatorial classification of optimal authentication codes with arbitration
• Authentication codes in plaintext and chosen-content attacks
• Combinatorial characterizations of authentication codes. II
• Combinatorial characterisation of -optimal authentication codes with arbitration
• Combinatorial structure of A-codes with r-fold security
• Authentication codes and combinatorial designs.
• Combinatorial Constructions for Optimal Splitting Authentication Codes
• Combinatorial design of key distribution mechanisms for wireless sensor networks
• Difference packing arrays and systematic authentication codes
• The combinatorics of authentication and secrecy codes
• Authentication codes and bipartite graphs

This page was built for publication: Combinatorial characterizations of authentication codes

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