Combinatorial bounds for authentication codes with arbitration

DOI10.1007/3-540-49264-X_23MaRDI QIDQ2757252zbMATH OpenFDO

Authors Kaoru Kurosawa, Satoshi Obana

Publication date 25 November 2001

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

Full work available at URL https://doi.org/10.1007/3-540-49264-X_23

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Combinatorial bounds on authentication codes with arbitration.
• Characterization of optimal authentication codes with arbitration
• A^2-code = affine resolvable + BIBD
• New bound on authentication code with arbitration
• Lower bounds on the probability of deception in authentication with arbitration

Cited in

(15)

• New combinatorial bounds for authentication codes and key predistribution schemes
• New combinatorial designs and their applications to authentication codes and secret sharing schemes.
• Combinatorial classification of optimal authentication codes with arbitration
• Further results on asymmetric authentication schemes
• Combinatorial characterisation of -optimal authentication codes with arbitration
• scientific article; zbMATH DE number 1810262 (Why is no real title available?)
• The role of arbiters in asymmetric authentication schemes
• Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment
• Characterization of optimal authentication codes with arbitration
• Lower bounds on the probability of deception in authentication with arbitration
• Combinatorial structure of A-codes with r-fold security
• On A^ 2-codes including arbiter's attacks
• New bound on authentication code with arbitration
• Combinatorial bounds on authentication codes with arbitration.
• New bound for affine resolvable designs and its application to authentication codes

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

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