Skip to main content
Springer Nature Link
Log in

Linear Authentication Codes: Bounds and Constructions

  • Conference paper
  • First Online:
Progress in Cryptology — INDOCRYPT 2001 (INDOCRYPT 2001)

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

Included in the following conference series:

Abstract

In this paper, we consider a new class of unconditionally secure authentication codes, called linear authentication code (or linear A-code). We show that a linear A-code can be characterised by a family of subspaces of a vector space over a finite field. We then derive an upper bound on the size of source space when other parameters of the systems, that is the size of the key space and the authenticator space, and the deception probability, are fixed. We give constructions that are asymptotically close to the bound and show application of these codes in constructing distributed authentication systems.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

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. Bierbrauer, “Universal hashing and geometric codes”, Designs, Codes and Cryptography, Vol.11, pp. 207–221,1997.

    Article  MATH  MathSciNet  Google Scholar 

  2. J. Bierbrauer, T. Johansson, G. Kabatianskii and B. Smeets, “On families of hash functions via geometric codes and concatenation”, Advances in Cryptology-CRYPTO’93, Lecture Notes in Computer Science, 773, pp. 331–342, 1994.

    Google Scholar 

  3. E. F. Brickell, A few results in message authentication, Congressus Numerantium, Vol.43 (1984), 141–154.

    MathSciNet  Google Scholar 

  4. Y. Desmedt, Society and group oriented cryptology: a new concept, Advances in Cryptography-CRYPTO’ 87, Lecture Notes in Compute. Sci. 293, 1988, 120–127.

    Google Scholar 

  5. Y. Desmedt, Some recent research aspects of threshold cryptography, 1997 Information Security Workshop, Japan (JSW’ 97), LNCS, 1396 (1998), 99–114.

    Google Scholar 

  6. Y. Desmedt, Y. Frankel and M. Yung, Multi-receiver/Multi-sender network security: efficient authenticated multicast/feedback, IEEE Infocom’92, 1992, 2045–2054.

    Google Scholar 

  7. M. van Dijk, C. Gehrmann and B. Smeets, Unconditionally Secure Group Authentication, Designs, Codes and Cryptography, 14 (1998), 281–296.

    Article  MATH  Google Scholar 

  8. E. M. Gabidulin, Theory of codes with maximum rank distance, Problems of Information Transmission, 21(1) (19850, 1–12.

    Google Scholar 

  9. E. N. Gilbert, F. J. MacWilliams and N. J. A. Sloane, Codes which detect deception, The Bell System Technical Journal, 33 (1974), 405–424.

    MathSciNet  Google Scholar 

  10. T. Johansson, Contributions to unconditionally secure authentication, Ph.D. thesis, Lund University, 1994.

    Google Scholar 

  11. T. Johansson, Authentication codes for non-trusting parties obtained from rank metric codes, Designs, Codes and Cryptography, 6:205–218, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  12. G. Kabatianskii, B. Smeets, and T. Johansson, “On the cardinality of systematic authentication codes via error correcting”, IEEE Trans. Inform. Theory, Vol. 42, pp. 566–578, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  13. F. J. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes, New-York; NorthHolland, 1977.

    Google Scholar 

  14. K. Martin and R. Safavi-Naini, Multisender Authentication Schemes with Unconditional Security, Information and Communications Security, LNCS, 1334 (1997), 130–143.

    Chapter  Google Scholar 

  15. A. Shamir, How to Share a Secret, Communications of the ACM, 22, 1979, 612–613.

    Article  MATH  MathSciNet  Google Scholar 

  16. R. Safavi-Naini, W. Susilo and H. Wang, Fail-Stop Signature for long messages, Indocrypt’00, LNCS, 1977(2000), 165–177.

    Google Scholar 

  17. G. J. Simmons, Authentication theory/coding theory, In Advances in Cryptology-Crypto’ 84, LNCS, 196 (1984), 411–431.

    Google Scholar 

  18. G. J. Simmons, A survey of information authentication, in Contemporary Cryptology, The Science of Information Integrity, G.J. Simmons, ed., IEEE Press, 1992, 379–419.

    Google Scholar 

  19. B. Smeets, P. Vanroose and Zhe-Xian Wan, On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2, In Advances in Cryptology-Eurocrypt’ 90, LNCS, 473 (1990), 306–312.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  21. D. R. Stinson, Universal Hashing and authentication codes, Designs, Codes and Cryptography 4 (1994), 369–280.

    Article  MATH  MathSciNet  Google Scholar 

  22. M. N. Wegman and J. L. Carter, “New hash functions and their use in authentication and set equality”, Journal of Computer and System Sciences, Vol. 22, pp. 265–279, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  23. C. Xing, H. Wang and K. Y. Lam, Constructions of authentication codes from algebraic curves over finite fields, IEEE Trans.on Info.Theory, 46(2000), 886–892.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of IT and CS, University of Wollongong, Australia

    Rei Safavi-Naini & Huaxiong Wang

  2. Department of Mathematics, National University of Singapore, Singapore

    Chaoping Xing

Authors
  1. Rei Safavi-Naini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huaxiong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chaoping Xing
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai, India

    C. Pandu Rangan

  2. Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong

    Cunsheng Ding

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Safavi-Naini, R., Wang, H., Xing, C. (2001). Linear Authentication Codes: Bounds and Constructions. In: Rangan, C.P., Ding, C. (eds) Progress in Cryptology — INDOCRYPT 2001. INDOCRYPT 2001. Lecture Notes in Computer Science, vol 2247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45311-3_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45311-3_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43010-0

  • Online ISBN: 978-3-540-45311-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics