Skip to main content
SpringerLink
Log in

On the analysis of time-aware protocols in universal composability framework

  • Regular Contribution
  • Published:
International Journal of Information Security Aims and scope Submit manuscript

Abstract

We consider the analysis of time-aware cryptographic protocols in the universal composability (UC) framework (Canetti in 2000). The tasks we consider are the timeliness of messages within an instance as well as the time of validity of cryptographic credentials where the lifetime of time stamps overlaps lots of instances. We point out that the UC analysis of time-aware protocols with global access to real time clock cannot be carried out directly within the standard model. For the resolution of the corresponding problem, we considered two ways: one is the introduction of an auxiliary timing oracle into the ideal system, while the other consists of two time models: a quantized real time source and an abstract “random-time” source, and we show an essential equivalence between them. The time models provide not only theoretical but also practical benefits.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Backes, M., Pfitzmann, B., Waidner, M.: A universally composable cryptographic library. In: IACR Cryptology ePrint Archive, Report 2003/015. http://eprint.iacr.org/ (2003)

  2. Backes, M., Pfitzmann, B.: A general composition theorem for secure reactive systems. In: Theory of Cryptograpy Conference (TCC 2004), LNCS 2951, pp. 336–354 (2004)

  3. Backes, M., Cervesato, I., Jaggard, A.D., Scedrov, A., Tsay, J.K.: Cryptographically sound security proofs for basic and public-key kerberos. In: Proceedings 11th European Symposium on Research in Computer Security (2006)

  4. Bozga, L., Ene, C., Lacknech, Y.: A symbolic decision procedure for cryptographic protocols with time stamps. J. Log. Algebr. Program. 65, 1–35 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Buldas, A., Laud, P., Saarepera, M., Willemson, J.: Universally composable time-stamping schemes with audit. In: ISC05, LNCS 3650. Cryptology ePrint Archive: Report (2005/198)

  6. Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Cryptology ePrint Archive: Report 2006/432. 20 (2006)

  7. Canetti, R.: Universally composable security:“a new paradigm for cryptographic protocols”. In: Cryptology ePrint Archive: Report 2000/067 (2000)

  8. Canetti, R., Rabin, T.: Universal composition with joint state. In: Crypto’03 (2003)

  9. Canetti, R., Krawczyk, H.: Universally composable notions of key exchange and secure channels. In: Knudsen, L.R. (ed.) EUROCRYPT 2002, LNCS 2332, pp.337–351 (2002)

  10. Matsuo, T., Matsuo, S.: On universal composable security of time-stamping protocols. In: Cryptology ePrint Archive: Report 2005/148

  11. Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: Proceedings 7th ACM CCS, pp. 245–254 (2000)

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, TU of Budapest, Pf. 91, Budapest, 1521, Hungary

    István Vajda

Authors
  1. István Vajda
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to István Vajda.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vajda, I. On the analysis of time-aware protocols in universal composability framework. Int. J. Inf. Secur. 15, 403–412 (2016). https://doi.org/10.1007/s10207-015-0300-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10207-015-0300-2

Keywords

Search

Navigation