Combinatorial Bounds on Authentication Codes with Arbitration

Authors:
Kaoru Kurosawa;Satoshi Obana
Affiliations:
Department of Communication and Integrated Systems, Faculty of Engineering, Tokyo Institute of Technology, 2-12-1, O-okayama, Meguro-ku, Tokyo 152, Japan;C&C Media Research Laboratories, NEC Corporation, 4-1-1 Myazaki, Myamae-ku, Kawasaki, Kanagawa 216-8555, Japan
Venue:
Designs, Codes and Cryptography
Year:
2001

Citing 14
Cited 4

Authentication theory/coding theory

Proceedings of CRYPTO 84 on Advances in cryptology
Some constructions and bounds for authentication codes

Journal of Cryptology
The combinatorics of authentication and secrecy codes

Journal of Cryptology
A Cartesian product construction for unconditionally secure authentication codes that permit arbitration

Journal of Cryptology
Combinatorial characterizations of authentication codes

Designs, Codes and Cryptography
Universal hashing and authentication codes

Designs, Codes and Cryptography
Authentication codes for nontrusting parties obtained from rank metric codes

Designs, Codes and Cryptography
Cryptography: Theory and Practice

Cryptography: Theory and Practice
Abritrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks (Extended Abstract)

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
On Families of Hash Functions via Geometric Codes and Concatenation

CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
On the Construction of Perfect Authentication Codes that Permit Arbitration

CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
New Bound on Authentication Code with Arbitration

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
A2-codes from universal hash classes

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques

Combinatorial Classification of Optimal AuthenticationCodes with Arbitration

Designs, Codes and Cryptography
GOB designs for authentication codes with arbitration

Designs, Codes and Cryptography
Combinatorial Designs for Authentication and Secrecy Codes

Foundations and Trends in Communications and Information Theory
Combinatorial bounds and characterizations of splitting authentication codes

Cryptography and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In 1987, Teirlinckproved that if t and v are two integerssuch that v \equiv t \pmod {(t+1)!^{(2t+1)}} andv \geqslant t+1 0, then there exists a t-(v,t+1,(t+1)!^{(2t+1)})design. ...