Skip to main content
SpringerLink
Log in

Three Constructions of Authentication/Secrecy Codes

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2003)

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

Abstract

In this paper, we present three algebraic constructions of authentication codes with secrecy. The codes have simple algebraic structures and are easy to implement. They are asymptotically optimal with respect to certain bounds.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. E.F. Brickel, A few results in message authentication, Congressus Numerantium 43 (1984), 141–154.

    MathSciNet  Google Scholar 

  2. L.R.A. Casse, K.M. martin, and P R. Wild, Bounds and characterizations of authentication/secrecy schemes, Designs, Codes and Cryptography 13 (1998), 107–129.

    Article  MATH  MathSciNet  Google Scholar 

  3. M. De Soete, Some constructions for authentication-secrecy codes, Advances in Cryptology — Eurocrypt’ 88, Lecture Notes in Comput. Sci., Vol. 330, Springer-Verlag, 1988, 57–76.

    Google Scholar 

  4. E. Gilbert, F.J. MacWilliams and N.J.A. Sloane, Codes which detect deception, Bell Systems Tech. J. 53 (1974), 405–424.

    MathSciNet  Google Scholar 

  5. R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and Its Application 20, Cambridge University Press, Cambridge, 1997.

    Google Scholar 

  6. J. L. Massey, Cryptography — A selective survey, in Digital Communications (1986), 3–21.

    Google Scholar 

  7. C. Mitchell, M. Walker and P. Wild, The combinatorics of perfect authentication schemes, SIAM J. Disc. Math. 7 (1994), 102–107.

    Article  MATH  MathSciNet  Google Scholar 

  8. D. Pei, Information-theoretic bounds for authentication codes and block designs, J. Cryptography 8 (1995), 177–188.

    MATH  MathSciNet  Google Scholar 

  9. R.S. Rees and D.R. Stinson, Combinatorial characterizations of authentication codes, Designs, Codes and Cryptography 7 (1996), 239–259.

    MATH  MathSciNet  Google Scholar 

  10. U. Rosenbaum, A lower bound on authentication after having observed a sequence of messages, J. Cryptography 6 (1993), 135–156.

    MATH  MathSciNet  Google Scholar 

  11. R. Safavi-Naini and L. Tombak, Authentication codes in plaintext and chosen-content attacks, Advances in Cryptology — Eurocrypt’ 94, Lecture Notes in Comput. Sci., Vol. 950 (1995), 254–265.

    Chapter  Google Scholar 

  12. A. Sgarro, Information-theoretic bounds for authentication frauds, J. Computer Security 2 (1993), 53–63.

    Google Scholar 

  13. G.J. Simmons, Authentication theory/coding theory, Advances in Cryptology — Crypto’ 84, Lecture Notes in Comput. Sci., Vol. 196 (1984), 411–431.

    Google Scholar 

  14. D.R. Stinson, A construction for authentication/secrecy codes from certain combinatorial designs, J. Cryptography 1 (1988), 119–127.

    Article  MATH  MathSciNet  Google Scholar 

  15. D.R. Stinson and L. Teirlinck, A construction for authentication/secrecy codes from 3-homogeneous permutation groups, European J. Combin. 11 (1990), 73–79.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, HKUST, Kowloon, Hong Kong, China

    Cunsheng Ding & Xiaojian Tian

  2. Turku Centre for Computer Science, DataCity, Lemminkäisenkatu 14A, FIN-20520, Turku, Finland

    Arto Salomaa

  3. CNRS-I3S, ESSI, Route des Colles, 06 903, Sophia Antipolis, France

    Patrick Solé

Authors
  1. Cunsheng Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arto Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Patrick Solé
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiaojian Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, University of Hawaii, 2540 Dole Street, Holmes Hall 455, Honolulu, HI, 96822, USA

    Marc Fossorier

  2. Department of Mathematics, The Technical University of Denmark, Bldg. 303, DK-2800, Lyngby, Denmark

    Tom Høholdt

  3. IRIT - Université Paul Sabatier, 31602, Toulouse cédex, France

    Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ding, C., Salomaa, A., Solé, P., Tian, X. (2003). Three Constructions of Authentication/Secrecy Codes. In: Fossorier, M., Høholdt, T., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2003. Lecture Notes in Computer Science, vol 2643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44828-4_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-44828-4_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40111-7

  • Online ISBN: 978-3-540-44828-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation