Skip to main content

A Multi-party Optimistic Non-repudiation Protocol

  • Conference paper
  • First Online:

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

Abstract

In this paper we consider the optimistic approach of the non-repudiation protocols. We study a non-repudiation protocol with off-line trusted third party and we keep on with the definition of the multi-party non-repudiation, compare it to multi-party fair exchange and show some fundamental differences between these two problems. Finally, we generalize our protocol and propose a multi-party non-repudiation

Acknowledgments

The authors would like to thank the anonymous referees for their helpful comments on the draft version of this paper.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Asokan. Fairness in Electronic Commerce. PhD thesis, University of Waterloo, May 1998.

    Google Scholar 

  2. N. Asokan, B. Baum-Waidner, M. Schunter, and M. Waidner. Optimistic synchronous multi-party contract signing. Research Report RZ 3089, IBM Research Division, Dec. 1998.

    Google Scholar 

  3. N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for multi-party fair exchange. Research Report RZ 2892 (# 90840), IBM Research, Dec. 1996.

    Google Scholar 

  4. N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for fair exchange. In T. Matsumoto, editor, 4th ACM Conference on Computer and Communications Security, pages 6, 8–17, Zurich, Switzerland, Apr. 1997. ACM Press.

    Google Scholar 

  5. F. Bao, R. Deng, K. Q. Nguyen, and V. Vardharajan. Multi-party fair exchange with an o-line trusted neutral party. In DEXA’99 Workshop on Electronic Commerce and Security, Florence, Italy, Sept. 1999.

    Google Scholar 

  6. M. Ben-Or, O. Goldreich, S. Micali, and R. L. Rivest. A fair protocol for signing contracts. IEEE Transactions on Information Theory, 36(1):40–46, 1990.

    Article  Google Scholar 

  7. C. Boyd. Some applications of multiple key ciphers. In C. G. Günther, editor, Advances in Cryptology—EUROCRYPT 88, volume 330 of Lecture Notes in Computer Science, pages 455–467, Davos, Switzerland, May 1988. Springer-Verlag.

    Google Scholar 

  8. G. Chiou and W. Chen. Secure broadcasting using the secure lock. IEEE Transactions on Software Engineering, 15(8):929–934, Aug. 1989.

    Article  Google Scholar 

  9. M. Franklin and G. Tsudik. Secure group barter: Multi-party fair exchange with semi-trusted neutral parties. Lecture Notes in Computer Science, 1465, 1998.

    Google Scholar 

  10. T. Hwang. Cryptosystem for group oriented cryptography. In I. B. Damgård, editor, Advances in Cryptology—EUROCRYPT 90, volume 473 of Lecture Notes in Computer Science, pages 352–360, Aarhus, Denmark, May 1990. Springer-Verlag, 1991.

    Google Scholar 

  11. S. Kremer and O. Markowitch. A multi-party non-repudiation protocol. In SEC 2000: 15th International Conference on Information Security, IFIP World Computer Congress, pages 271–280, Beijing, China, Aug. 2000. Kluwer Academic.

    Google Scholar 

  12. S. Kremer and O. Markowitch. Optimistic non-repudiable information exchange. In J. Biemond, editor, 21st Symp. on Information Theory in the Benelux, pages 139146, Wassenaar (NL), May25-26 2000. Werkgemeenschap Informatie-en Communicatietheorie, Enschede (NL).

    Google Scholar 

  13. O. Markowitch and Y. Roggeman. Probabilistic non-repudiation without trusted third party. In Second Conference on Security in Communication Networks’99 Amalfi,Italy,Sept. 1999.

    Google Scholar 

  14. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of applied cryptography. CRC Press series on discrete mathematics and its applications. CRC Press, 1996. ISBN 0-8493-8523-7.

    Google Scholar 

  15. J. Zhou. Non-repudiation. PhD thesis, University of London, Dec. 1996.

    Google Scholar 

  16. J. Zhou, R. Deng, and F. Bao. Evolution of fair non-repudiation with TTP. In ACISP: Information Security and Privacy: Australasian Conference, volume 1587 of Lecture Notes in Computer Science, pages 258–269. Springer-Verlag, 1999.

    Chapter  Google Scholar 

  17. J. Zhou and D. Gollmann. Observations on non-repudiation. In K. Kim and T. Matsumoto, editors, Advances in Cryptology—ASIACRYPT’ 96, volume 1163 of Lecture Notes in Computer Science, pages 133–144, Kyongju, Korea, 3-7 Nov. 1996. Springer-Verlag.

    Chapter  Google Scholar 

  18. J. Zhou and D. Gollmann. An efficient non-repudiation protocol. In PCSFW: Proceedings of The 10th Computer Security Foundations Workshop. IEEE Computer Society Press, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Markowitch, O., Kremer, S. (2001). A Multi-party Optimistic Non-repudiation Protocol. In: Won, D. (eds) Information Security and Cryptology — ICISC 2000. ICISC 2000. Lecture Notes in Computer Science, vol 2015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45247-8_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45247-8_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41782-8

  • Online ISBN: 978-3-540-45247-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics