Skip to main content
SpringerLink
Log in

Incremental Authentication of Tree-Structured Documents

  • Conference paper
Information and Communication Security (ICICS 1999)

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

Included in the following conference series:

Abstract

A new message authentication code (MAC) is described that exploits the tree structure present in many modern document formats, e.g. SGML and XML. The new code supports incremental updating of the cryptographic checksum in the process of making incremental changes to the document. Theoretical bounds on the probability of a successful substitution attack are derived. Through experimental results we demonstrate that for randomly chosen messages the success probability of such an attack will be smaller and is easily identified.

This work was supported in part by the Swedish National Board for Industrial and Technical Development, grant #97-9630.

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. Bellare, M., Goldreich, O., Goldwasser, S.: Incremental cryptography: the case of hashing and signing. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 216–233. Springer, Heidelberg (1994)

    Google Scholar 

  2. Bellare, M., Goldreich, O., Goldwasser, S.: Incremental cryptography with application to virus protection. In: Proceedings of the 27th Annual Symposium on Theory of Computing. ACM Press, New York (1995)

    Google Scholar 

  3. Bellare, M., Micciancia, D.: A New Paradigm for Collision-Free Hashing: Incremental at Reduced Cost. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 163–192. Springer, Heidelberg (1997)

    Google Scholar 

  4. Johansson, T.: Contributions to Unconditionally Secure Authentication. Ph.D. Thesis. Dept of Information Theory. Lund University (1994)

    Google Scholar 

  5. Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Mathematics and its Applications, vol. 20. Addison-Wesley, Reading (1983)

    MATH  Google Scholar 

  6. Menezes, A.J., van Oorshot, P., Vanstone, S.: Handbook of applied cryptography. CRC Press series on discrete mathematics and its applications (1996)

    Google Scholar 

  7. 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)

    Google Scholar 

  8. Wegman, M.N., Carter, J.L.: New Hash Functions and Their Use in Authentication and Set Equality. Journal of Computer and System Science 22, 265–279 (1981)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Technology, Lund University, PO Box 118, S-221 00, Lund, Sweden

    Patrik Ekdahl

  2. Ericsson Mobile Communications AB, Scheelevägen 7, S-221 83, Lund, Sweden

    Ben Smeets

Authors
  1. Patrik Ekdahl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ben Smeets
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Macquarie University, Sydney, Australia

    Vijay Varadharajan

  2. Centre for Computer and Information Security Research School of Computer Science and Software Engineering, University of Wollongong, Australia

    Yi Mu

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ekdahl, P., Smeets, B. (1999). Incremental Authentication of Tree-Structured Documents. In: Varadharajan, V., Mu, Y. (eds) Information and Communication Security. ICICS 1999. Lecture Notes in Computer Science, vol 1726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-47942-0_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-47942-0_23

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation