Abstract
The traditional authentication model assumes that the data loss on the communication channel between the sender and the receiver is handled by mechanisms that should be studied separately. In this paper, we consider a more general setting where both unconditionally secure information authentication and loss-resilience are achieved at the same time via erasure-tolerant authentication codes (or η-codes), and we address some fundamental questions concerning erasure-tolerant authentication codes. Namely, we adapt several lower bounds on the probability of successful deception derived for the traditional authentication model to the setting that we consider here. We also analyze the distance properties of the η-codes and the security properties of the η-codes constructed by means of concatenation and composition. One interesting class of η-codes is the class of η-codes with minimal probabilities of successful impersonation and substitution. We show that all members of this class can be represented as a composition of an authentication code with minimal impersonation and substitution probabilities and an erasure-resilient code. Finally, we present some examples of η-code constructions.
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
Afanassiev, V., Gehrmann, C., Smeets, B.: Fast Message Authentication Using Efficient Polynomial Evaluation. In: Proceedings of Fast Software Encryption Workshop, pp. 190–204 (1997)
Anderson, R., Bergadano, F., Crispo, B., Lee, J., Manifavas, C., Needham, R.: A New Family of Authentication Protocols. ACM Operating Systems Review 32(4), 9–20 (1998)
Bergadano, F., Cavagnino, D., Crispo, B.: Chained Stream Authentication. In: Proceeding of Selected Areas in Cryptography 2000, pp. 142–155 (2000)
Bierbrauer, J., Johansson, T., Kabatianskii, G., Smeets, B.: On Families of Hash Functions Via Geometric Codes and Concatenation. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 331–342. Springer, Heidelberg (1994)
Carter, J.L., Wegman, M.N.: Universal Classes of Hash Functions. Journal of Computer and System Sciences 18, 143–154 (1979)
Cheung, S.: An Efficient Message Authentication Scheme for Link State Routing. In: Proceedings of the 13th Annual Computer Security Application Conference (1997)
Desmedt, Y., Frankel, Y., Yung, M.: Multi-Receiver/Multi-Sender Network Security: Efficient Authenticated Multicast/Feedback. In: Proceeding of INFOCOM 1992, pp. 2045–2054 (1992)
Gennaro, R., Rohatgi, P.: How to Sign Digital Streams. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 180–197. Springer, Heidelberg (1997)
Johansson, T., Kabatianskii, G., Smeets, B.: On the Relation Between A-codes and Codes Correcting Independent Errors. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 1–11. Springer, Heidelberg (1994)
Luby, M., Mitzenmacher, M., Shokrollahi, M.A., Spielman, D.A., Stemann, V.: Practical Loss-Resilient Codes. In: Proceedings of the 29th Symp. on Theory of Computing, pp. 150–159 (1997)
Luby, M.: LT codes. In: The 43rd IEEE Symposium on Foundations of Computer Science (2002)
Massey, J.L.: Contemporary Cryptology: An Introduction. In: Simmons, G.J. (ed.) Contemporary Cryptology, The Science of Information Integrity. IEEE Press, New York (1992)
Mills, W.H.: Covering design I: coverings by a small number of subsets. Ars Combin 8, 199–315 (1979)
Perrig, A., Canneti, R., Tygar, J.D., Song, D.: Efficient Authentication and Signing of Multicast Streams Over Lossy Channels. In: Proceedings of the IEEE Security and Privacy Symposium (2000)
Rabin, M.: Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance. J. ACM 36(2), 335–348
Rees, R., Stinson, D.R., Wei, R., van Rees, G.H.J.: An application of covering designs: Determining the maximum consistent set of shares in a threshold scheme. Ars Combin 531, 225–237 (1999)
Rogaway, P.: Bucket hashing and its application to fast message authentication. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 29–42. Springer, Heidelberg (1995)
Simmons, G.J.: Authentication Theory / Coding Theory. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 411–432. Springer, Heidelberg (1985)
Simmons, G.J.: A Survey of Information Authentication. In: Simmons, G.J. (ed.) Contemporary Cryptology, The Science of Information Integrity. IEEE Press, New York (1992)
Stinson, D.R.: Some Constructions and Bounds for Authentication Codes. Journal of Cryptology 1, 37–51 (1988)
Stinson, D.R.: The Combinatorics of Authentication and Secrecy Codes. Journal of Cryptology 2, 23–49 (1990)
Stinson, D.R.: Combinatorial Characterizations of Authentication Codes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 62–73. Springer, Heidelberg (1992)
Stinson, D.R.: Universal Hashing and Authentication Codes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 74–85. Springer, Heidelberg (1992)
Wegman, M.N., Carter, J.L.: New Hash Functions and Their Use in Authentication and Set Equality. Journal of Computer and System Sciences 22, 265–279 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jakimoski, G. (2005). Unconditionally Secure Information Authentication in Presence of Erasures. In: Smart, N.P. (eds) Cryptography and Coding. Cryptography and Coding 2005. Lecture Notes in Computer Science, vol 3796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11586821_21
Download citation
DOI: https://doi.org/10.1007/11586821_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30276-6
Online ISBN: 978-3-540-32418-8
eBook Packages: Computer ScienceComputer Science (R0)