Combinatorial classification of optimal authentication codes with arbitration

DOI10.1023/A:1008326209304MaRDI QIDQ1581793zbMATH OpenOpenAlexFDO

Authors Satoshi Obana, Kaoru Kurosawa

Publication date 31 January 2002

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

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

zbMATH Keywords

block designlower boundsarbitrationauthentication codes

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Combinatorial characterisation of \(\ell\)-optimal authentication codes with arbitration
• scientific article; zbMATH DE number 1676650
• scientific article; zbMATH DE number 1303980
• Combinatorial bounds on authentication codes with arbitration.
• Combinatorial lower bounds of authentication codes with arbitration
• scientific article; zbMATH DE number 1810262
• scientific article; zbMATH DE number 176540
• Combinatorial characterizations of authentication codes
• Combinatorial Constructions for Optimal Splitting Authentication Codes
• The combinatorics of authentication and secrecy codes

Cited in

(7)

• On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
• Combinatorial characterisation of \(\ell\)-optimal authentication codes with arbitration
• GOB designs for authentication codes with arbitration
• scientific article; zbMATH DE number 1996490 (Why is no real title available?)
• scientific article; zbMATH DE number 1810262 (Why is no real title available?)
• scientific article; zbMATH DE number 1789834 (Why is no real title available?)
• Combinatorial Constructions for Optimal Splitting Authentication Codes

This page was built for publication: Combinatorial classification of optimal authentication codes with arbitration

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