Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Authentication codes with perfect protection

  • Conference paper
  • First Online:
Advances in Cryptology — AUSCRYPT '92 (AUSCRYPT 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 718))

Abstract

In this paper we prove new results on authentication codes with perfect protection. We will prove that perfect protection for impersonation follows from perfect protection for substitution only if the source is uniform and derive a necessary and sufficient condition for codes that provide perfect protection for both types of attack. We prove a new lower bound on the probability of deception in substitution for codes with perfect protection and characterize the codes that satisfy the bound with equality.

Support for this work was provided by Australian Research Council grant A49030136.

Support for this work was provided in part by Australian Research Council grant A49030136.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J.L. Massey, Cryptography, a selective survey, Digital Communications, ed. E. Biglieri and G. Pratti, Elsvier Science Publ., North-Holland, (1986), 3–25.

    Google Scholar 

  2. D.R. Stinson, Some constructions and bounds for authentication codes, Journal Cryptology 1, (1988), 37–51

    Google Scholar 

  3. D.R. Stinson, The combinatorics of authentication and secrecy codes, Journal Cryptology 2, (1990), 23–49

    Google Scholar 

  4. D.R. Stinson, Combinatorial characterization of authentication codes, Proceedings Crypto 91, Lecture Notes in Computer Science 576, (1992), 62–72

    Google Scholar 

  5. G.J. Simmons, Message authentication: a game on gypergraphs, Congressus Numerantium 45, (1984), 161–192

    Google Scholar 

  6. G.J. Simmons, Authentication theory/coding Theory, Proc. of Crypto '84, Lect. Notes in Comp. Science 196, (1985), 411–432

    Google Scholar 

  7. G.J. Simmons, A game theory model of digital message authentication, Congressus Numerantium 34, (1982), 413–424

    Google Scholar 

  8. E. Brickell, A Few Results in Message Authentication, Congressus Numerantium 43, (1984), 141–154

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Wollongong, Northfields Ave., 2522, Wollongong, Australia

    L. Tombak & R. Safavi-Naini

Authors
  1. L. Tombak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Safavi-Naini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jennifer Seberry Yuliang Zheng

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tombak, L., Safavi-Naini, R. (1993). Authentication codes with perfect protection. In: Seberry, J., Zheng, Y. (eds) Advances in Cryptology — AUSCRYPT '92. AUSCRYPT 1992. Lecture Notes in Computer Science, vol 718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57220-1_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-57220-1_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57220-6

  • Online ISBN: 978-3-540-47976-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation