Abstract
In this paper we study authentication codes with arbitration (A 2-codes). An A 2-code is called optimal if its cheating probabilities achieve their information-theoretic lower bounds, and has minimum number of keys. We give characterization of optimal A 2-codes in terms of combinatorial designs. This means that construction of optimal A 2-codes is reduced to the construction of the corresponding combinatorial structures.
Authors 1, 2 are supported by the Grant No. 19531020 of NNSF of China and the grant E47 of NSF of Guangdong. Authors 3,4 are partially supported by Australian Research Council Grant Number A49703076.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Y. Desmedt and M. Yung, Arbitrated Unconditionally Secure Authentication Can Be Unconditionally Protected against Arbiter’s attacks, Advances in Cryptology-CRYPTO’90, 177–188 (1991).
T. Johansson, On the construction of perfect authentication codes that permit arbitration, Advances in Cryptology-Crypto’93, Lecture Notes in Computer Science 773, Springer-Verlag, 1994, 343–354.
T. Johansson, Lower bounds on the probability of deception in authentication with arbitration, IEEE Trans. Inform. Theory, Vol.40, No.5, 1994, 1573–1585.
Y. Li, A note on authentication codes with arbitration, Chinese Quarterly Journal of Mathematics, Vol.12, No.4, 1998, 103–106.
S. Obana and K. Kurosawa, A 2-code=affine resolvable + BIBD, First international Conference, ICICS’97, Lecture Notes in Computer Science 1334, Springer-Verlag, 1997, 130–143.
D. Pei, Information-theoretic bounds for authentication codes and block designs, J. Cryptology, Vol.8 (1995), 177–188.
G. J. Simmons, Message authentication with arbitration of transmitter/receiver disputes, Advances in Cryptology-Eurocrypt’87, LNCS 304, Springer-Verlag, 1988, 151–165.
G. J. Simmons, A Cartesian product construction for unconditionally secure authentication codes that permit arbitration, J. Cryptology, Vol.2 (1990), 77–104.
Y. Wang, Information-theoretic lower bounds for authentication codes with arbitration. Advances in Cryptology-Chinacrypt’98, Science Press, 1998, 99–104.
R. Safavi-Naini, L. Tombak, Combinatorial characterization of A-codes with r-fold security. Advances in Cryptology-Asiacrypt’94, LNCS 917, Springer-Verlag, 1995, pp 211–223.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pei, D., Li, Y., Wang, Y., Safavi-Naini, R. (1999). Characterization of Optimal Authentication Codes with Arbitration. In: Pieprzyk, J., Safavi-Naini, R., Seberry, J. (eds) Information Security and Privacy. ACISP 1999. Lecture Notes in Computer Science, vol 1587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48970-3_25
Download citation
DOI: https://doi.org/10.1007/3-540-48970-3_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65756-9
Online ISBN: 978-3-540-48970-2
eBook Packages: Springer Book Archive