Abstract
Unconditionally secure authentication codes with arbitration (A 2-codes) protect against deceptions from the transmitter and the re- ceiver as well as that from the opponent.
In this paper, we present combinatorial lower bounds on the cheating probabilities for A 2-codes in terms of the number of source states, that of the whole messages and that of messages which the receiver accepts as authentic for each source state. Previously, only entropy based lower bounds were known. Our bounds for the model without secrecy are tight because the A 2-codes given by Johansson meet our bounds with equality.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
G.J. Simmons, “A survey of Information Authentication”, in Contemporary Cryptology, The science of information integrity, ed. G.J. Simmons, IEEE Press, New York, 1992.
G.J. Simmons, “Authentication theory/coding theory”, Proceedings of Crypto'84, Lecture Notes in Computer Science, LNCS 196, Springer Verlag, pp.411–431 (1985).
E.F. Brickell, “A few results in message authentication”, Congresus Numerantium, vol.43, pp.141–154 (1984).
G.J. Simmons, “Message authentication: a game on hypergraphs”, Congresus Numerantium, vol.45, pp.161–192 (1984).
J.L. Massey, Cryptography — a selective survey, in Digital Communications, North Holland (pub.), pp.3–21, (1986).
D.R. Stinson, “Some constructions and bounds for authentication codes”, Journal of Cryptology, Vol.1, 1988, pp.37–51, (1988).
D.R. Stinson, “The combinatorics of authentication and secrecy codes”, Journal of Cryptology, Vol.2, no 1, 1990, pp.23–49, (1990).
D.R. Stinson, “Combinatorial Characterization of Authentication Codes”, Proceedings of Crypto'91, Lecture Notes in Computer Science, LNCS 576, Springer Verlag, pp62–72 (1992).
Marijke De Soete, “New Bounds and Constructions for Authentication/Secrecy Codes with Splitting”, Journal of Cryptology, Vol.3, no 3, 1991, pp173–186 (1991).
G.J. Simmons, “Message Authentication with Arbitration of Transmitter/Receiver Disputes”, Proceedings of Eurocrypt'87, Lecture Notes in Computer Science, LNCS 304, Springer Verlag, pp.150–216 (1987)
G.J. Simmons, “A Cartesian Product Construction for Unconditionally Secure Authentication Codes that Permit Arbitration”, Journal of Cryptology, Vol.2, no.2, 1990, pp.77–104 (1990).
Thomas Johansson, “Lower Bounds on the Probability of Deception in Authentication with Arbitration”, In Proceedings of 1993 IEEE International Symposium on Information Theory, San Antonio, USA, January 17–22, 1993, pp.231.
Thomas Johansson, “Lower Bounds on the Probability of Deception in Authentication with Arbitration”, submitted to IEEE Trans. on IT (private communication).
Thomas Johansson, “On the construction of perfect authentication codes that permit arbitration”, Proceedings of Crypto'93, Lecture Notes in Computer Science, LNCS 773, Springer Verlag, pp.341–354 (1993).
K. Kurosawa, “New bound on authentication code with arbitration”, Proceedings of Crypto'94, Lecture Notes in Computer Science, LNCS 899, Springer Verlag, pp.140–149 (1994).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurosawa, K., Obana, S. (1995). Combinatorial Bounds for Authentication Codes with Arbitration. In: Guillou, L.C., Quisquater, JJ. (eds) Advances in Cryptology — EUROCRYPT ’95. EUROCRYPT 1995. Lecture Notes in Computer Science, vol 921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49264-X_23
Download citation
DOI: https://doi.org/10.1007/3-540-49264-X_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59409-3
Online ISBN: 978-3-540-49264-1
eBook Packages: Springer Book Archive