Abstract
Authentication codes (A-codes, for short) are considered as important building blocks for constructing unconditionally secure authentication schemes. Since in the conventional A-codes, two communicating parties, transmitter and receiver, utilized a common secret key, and such A-codes do not provide non-repudiation. With the aim of enhancing with non-repudiation property, Simmons introduced A2-codes [16,17]. Later, Johansson [6] formally defined an improved version of A2-codes called, the A3-codes. Unlike A2-codes, A3-codes do not require an arbiter to be fully trusted. In this paper, we clarify the security definition of A3-codes which may be misdefined. We show a concrete attack against an A3-code and conclude that concrete constructions of A3-codes implicitly assumes a trusted arbiter. We also show that there is no significant difference between A2-codes and A3-codes in a practical sense and further argue that it is impossible to construct an “ideal” A3-codes, that is, without any trusted arbiter. Finally, we introduce a novel model of asymmetric A-codes with an arbiter but do not have to be fully trusted, and also show a concrete construction of the asymmetric A-codes for the model. Since our proposed A-code does not require fully trusted arbiters, it is more secure than A2-codes or A3-codes.
The first author is supported by a Research Fellowship from Japan Society for the Promotion of Science (JSPS).
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.
References
Brickell, E.F., Stinson, D.R.: Authentication codes with multiple arbiters. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 51–55. Springer, Heidelberg (1988)
Cavallar, S., Dodson, B., Lenstra, A.K., et al.: Factorization of a 512-bit RSA modulus. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 1–18. Springer, Heidelberg (2000)
Gilbert, E.N., MacWilliams, F.J., Sloane, N.J.A.: Codes which detect deception. Bell System Technical Journal 53, 405–425 (1974)
Hanaoka, G., Shikata, J., Zheng, Y., Imai, H.: Unconditionally secure digital signature schemes admitting transferability. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 130–142. Springer, Heidelberg (2000)
Johansson, T.: Lower bounds on the probability of deception in authentication with arbitration. IEEE Trans. Inform. Theory IT-40(5), 1573–1585 (1994)
Johansson, T.: Further results on asymmetric authentication schemes. Information and Computation 151, 100–133 (1999)
Kurosawa, K.: New bound on authentication code with arbitration. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 140–149. Springer, Heidelberg (1994)
Kurosawa, K., Obana, S.: Combinatorial bounds for authentication codes with arbitration. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 289–300. Springer, Heidelberg (1995)
Naor, M., Pinkas, B.: Secure and efficient metering. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 576–590. Springer, Heidelberg (1998)
Obana, S., Kurosawa, K.: A2-code = affine resolvable + BIBD. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 118–129. Springer, Heidelberg (1997)
Ogata, W., Kurosawa, K.: Provably secure metering scheme. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 388–398. Springer, Heidelberg (2000)
Ogata, W., Kurosawa, K.: Bounds for robust metering schemes and their relationship with A-code. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 64–80. Springer, Heidelberg (2002)
Safavi-Naini, R., Wang, Y.: A3-codes under collusion attacks. Journal of Combinatorial Mathematics and Combinatorial Computing (to appear)
Shikata, J., Hanaoka, G., Zheng, Y., Imai, H.: Security notions for unconditionally secure signature schemes. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 434–449. Springer, Heidelberg (2002)
Simmons, G.J.: Authentication theory/coding theory. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 411–431. Springer, Heidelberg (1984)
Simmons, G.J.: Message authentication with arbitration of transmitter/receiver disputes. In: Proc. of Eurocyrpt 1987, pp. 151–165. Springer, Heidelberg (1987)
Simmons, G.J.: A Cartesian construction for unconditionally secure authentication codes that permit arbitration. Journal of Cryptology 2, 77–104 (1990)
Taylor, R.: Near optimal unconditionally secure authentication. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 244–253. Springer, Heidelberg (1994)
Wang, Y., Safavi-Naini, R.: A3-codes under collusion attacks. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 390–398. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hanaoka, G., Shikata, J., Hanaoka, Y., Imai, H. (2003). The Role of Arbiters in Asymmetric Authentication Schemes. In: Boyd, C., Mao, W. (eds) Information Security. ISC 2003. Lecture Notes in Computer Science, vol 2851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10958513_33
Download citation
DOI: https://doi.org/10.1007/10958513_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20176-2
Online ISBN: 978-3-540-39981-0
eBook Packages: Springer Book Archive