Abstract
An A 3-code is an extension of A-code in which none of the three participants, transmitter, receiver and arbiter, is assumed trusted. In this paper we extend the previous model of A 3-codes by allowing transmitter and receiver not only to individually attack the system but also collude with the arbiter against the other. We derive information-theoretic lower bounds on success probability of various attacks, and combinatorial lower bounds on the size of key spaces. We also study combinatorial structure of optimal A 3-code against collusion attacks and give a construction of an optimal code.
Download to read the full chapter text
Chapter 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)
Desmedt, Y., Yung, M.: Arbitrated unconditionally secure authentication can be unconditionally protected against arbiter’s attack. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 177–188. Springer, Heidelberg (1991)
Johansson, T.: Further results on asymmetric authentication schemes. Information and Computation 151 (1999)
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)
Pei, D.: Information-theoretic bounds for authentication codes and block designs. Journal of Cryptology 8, 177–188 (1995)
Pei, D., Li, Y., Wang, Y., Safavi-Naini, R.: Characterization of optimal authentication codes with arbitration. In: Pieprzyk, J.P., Safavi-Naini, R., Seberry, J. (eds.) ACISP 1999. LNCS, vol. 1587, pp. 303–313. Springer, Heidelberg (1999)
Simmons, G.J.: Authentication theory/Coding theory. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 411–431. Springer, Heidelberg (1985)
Simmons, G.J.: A cartesian construction for uncondetionally 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 (1995)
Frankel, Y., Desmedt, Y., Yung, M.: Multi-receiver/multi-sender network securety: efficient authenticated multicast/feedback. In: IEEE Infocom, pp. 2045–2054 (1992)
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
Wang, Y., Safavi-Naini, R. (1999). A 3-Codes under Collusion Attacks. In: Lam, KY., Okamoto, E., Xing, C. (eds) Advances in Cryptology - ASIACRYPT’99. ASIACRYPT 1999. Lecture Notes in Computer Science, vol 1716. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48000-6_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-48000-6_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66666-0
Online ISBN: 978-3-540-48000-6
eBook Packages: Springer Book Archive