Skip to main content
SpringerLink
Log in

Progressive Verification: The Case of Message Authentication

  • Conference paper
Progress in Cryptology - INDOCRYPT 2003 (INDOCRYPT 2003)

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

Included in the following conference series:

Abstract

We introduce the concept of progressive verification for cryptographic primitives like message authentication codes, signatures and identification. This principle overcomes the traditional property that the verifier remains oblivious about the validity of the verified instance until the full verification procedure is completed. Progressive verification basically says that the more work the verifier invests, the better can the verifier approximate the decision.

In this work we focus on message authentication. We present a comprehensive formal framework and describe several constructions of such message authentication codes, called pv-MACs (for progressively verifiable MACs). We briefly discuss implications to other areas like signatures and identification but leave it as an open problem to find satisfactory solutions for these primitives.

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 and Application to Virus Protection. In: Proceedings of the 27th ACM Symposium on Theory of Computing (STOC), pp. 45–56 (1995)

    Google Scholar 

  3. Bellare, M., Guerin, R., Rogaway, P.: XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Funtions. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 15–29. Springer, Heidelberg (1995)

    Google Scholar 

  4. Bellare, M., Kilian, J., Rogaway, P.: The Security of Cipher Block Chaining Message Authentication Code. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 341–358. Springer, Heidelberg (1994)

    Google Scholar 

  5. Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P.: UMAC: Fast and Secure Message Authentication. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 216–233. Springer, Heidelberg (1999)

    Google Scholar 

  6. Black, J., Rogaway, P.: CBC MACs for Arbitrary-Length Messages: The Three-Key Construction. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 197–215. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Black, J., Rogaway, P.: A Block-Cipher Mode of Operation for Parallelizable Message Authentication. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 384–397. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Feige, U., Fiat, A., Shami, A.: Zero Knowledge Proofs of Identity. Journal of Cryptology 1, 77–94 (1988)

    Article  MATH  Google Scholar 

  9. Fischlin, M.: Incremental Cryptography and Memory Checkers. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 393–408. Springer, Heidelberg (1997)

    Google Scholar 

  10. Fischlin, M.: Lower Bounds for the Signature Size of Incremental Schemes. In: Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 438–447. IEEE Computer Society Press, Los Alamitos (1997)

    Chapter  Google Scholar 

  11. Fischlin, M.: Fast Verification of Hash Chains. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 339–352. Springer, Heidelberg (2004) (to appear)

    Chapter  Google Scholar 

  12. Guillou, L.C., Quisquater, J.-J.: A Practical Zero-Knowledge Protocol Fitted to Security Microprocessors Minimizing Both Transmission and Memory. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 123–128. Springer, Heidelberg (1988)

    Google Scholar 

  13. Kocher, P.C.: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104–113. Springer, Heidelberg (1996)

    Google Scholar 

  14. Schnorr, C.P.: Efficient Signature Generation by Smart Cards. Journal of Cryptology 4, 161–174 (1991)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, University of California, San Diego, USA

    Marc Fischlin

Authors
  1. Marc Fischlin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electrical and Information Technology, Lund University, P.O. Box 118, 221 00, Lund, Sweden

    Thomas Johansson

  2. Indian Statistical Institute, 203 B T Road, 700 108, Kolkata, India

    Subhamoy Maitra

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fischlin, M. (2003). Progressive Verification: The Case of Message Authentication. In: Johansson, T., Maitra, S. (eds) Progress in Cryptology - INDOCRYPT 2003. INDOCRYPT 2003. Lecture Notes in Computer Science, vol 2904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24582-7_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24582-7_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20609-5

  • Online ISBN: 978-3-540-24582-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation