Skip to main content

Timeout Estimation Using a Simulation Model for Non-repudiation Protocols

  • Conference paper
Computational Science and Its Applications – ICCSA 2004 (ICCSA 2004)

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

Included in the following conference series:

Abstract

An essential issue for the best operation of non-repudiation protocols is to figure out their timeouts. In this paper, we propose a simulation model for this purpose since timeouts depend on specific scenario features such as network speed, TTP characteristics, number of originators and recipients, etc. Based on a one-to-many Markowicth’s protocol simulation model as a specific example, we have worked out various simulation experiments.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
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.

References

  1. Zhou, J., Gollmann, D.: A fair non-repudiation protocol. In: Proceedings of 1996 IEEE Symposium on Research in Security and Privacy, Oakland, CA, May 1996, pp. 55–61 (1996)

    Google Scholar 

  2. Gonzalez-Deleito, N., Markowitch, O.: An optimistic multi-party fair exchange protocol with reduced trust requirements. In: Proceedings of 4th International Conference on Information Security and Cryptology, Seoul, Korea, December 2001, pp. 258–267 (2001)

    Google Scholar 

  3. Kim, J., Ryou, J.: Multi-party fair exchange protocol using ring architecture model. In: Proceedings of Japan-Korea Joint Workshop on Information Security and Cryptology (January 2000)

    Google Scholar 

  4. Markowitch, O., Kremer, S.: A multi-party non-repudiation protocol. In: Proceedings of 15th IFIP International Information Security Conference, Beijing, China, August 2000, pp. 271–280 (2000)

    Google Scholar 

  5. Markowitch, O., Kremer, S.: A multi-party optimistic non-repudiation protocol. In: Proceedings of 3rd International Conference on Information Security and Cryptology, Seoul, Korea, December 2000, pp. 109–122 (2000)

    Google Scholar 

  6. Onieva, J., Zhou, J., Carbonell, M., Lopez, J.: A multi-party non-repudiation protocol for exchange of different messages. In: Proceedings of 18th IFIP International Information Security Conference, Athens, Greece (May 2003)

    Google Scholar 

  7. Onieva, J., Zhou, J., Carbonell, M., Lopez, J.: Intermediary non-repudiation protocols. In: Proceedings of IEEE Conference on Electronic Commerce, Newport Beach, CA (June 2003)

    Google Scholar 

  8. Chiou, G., Chen, W.: Secure broadcasting using the secure lock. IEEE Transaction on Software Engineering 15(8) (August 1989)

    Google Scholar 

  9. Banks, J., Carson, J., Nelson, B.: Discrete-event system simulation. Prentice-Hall, Englewood Cliffs (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carbonell, M., Onieva, J.A., Lopez, J., Galpert, D., Zhou, J. (2004). Timeout Estimation Using a Simulation Model for Non-repudiation Protocols. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3043. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24707-4_103

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24707-4_103

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22054-1

  • Online ISBN: 978-3-540-24707-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics