New bound on authentication code with arbitration

MaRDI QIDQ4940692zbMATH OpenFDO

Authors Kaoru Kurosawa

Publication date 1 March 2000

zbMATH Keywords

authentication model with arbitrationlower boundsize of encoding rules

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1676650
• Combinatorial bounds on authentication codes with arbitration.
• Lower bounds on the probability of deception in authentication with arbitration
• On the construction of perfect authentication codes that permit arbitration
• Characterization of optimal authentication codes with arbitration

Cited in

(12)

• New combinatorial designs and their applications to authentication codes and secret sharing schemes.
• Further results on asymmetric authentication schemes
• scientific article; zbMATH DE number 1676650 (Why is no real title available?)
• The power of primes: security of authentication based on a universal hash-function family
• scientific article; zbMATH DE number 1810262 (Why is no real title available?)
• Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment
• Lower bounds on the probability of deception in authentication with arbitration
• Combinatorial bounds on authentication codes with arbitration.
• Combinatorial bounds and characterizations of splitting authentication codes
• New bound for affine resolvable designs and its application to authentication codes
• Non-repudiation without public-key
• Further results on the existence of splitting BIBDs and application to authentication codes

This page was built for publication: New bound on authentication code with arbitration

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