Skip to main content
Log in

A mutual non-repudiation protocol with privacy

  • Science & Engineering
  • Published:
Journal of Zhejiang University-SCIENCE A Aims and scope Submit manuscript

Abstract

Non-repudiation services provide the parties involved in a transaction with protection against the other party by denying that a particular event or action took place. They collect irrefutable evidence to support the resolution of any such disagreement. We address this security issue by first examining the previous work done in this area, and then propose a novel protocol to achieve mutual non-repudiation service, encompassing both mandatory evidence of origin and mandatory evidence of receipt. By using two simple ideas, a conditional signature and a public notice board, the novel protocol can achieve this security service in a simple but effective manner. By applying cryptography technology, this protocol also provides privacy for the parties using the security service.

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

Access this article

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

Instant access to the full article PDF.

References

  • Ander, R., 1994. Why cryptosystems fail.Communications of the ACM,37(11): 32–41.

    Article  Google Scholar 

  • Brema, A., Tygar, J. D., 1994. Certified electronic fail.In Proc. Of the Internet Society Symposium on Network and Distributed System Security. IEEE Computer Society Press, New York, p. 3–19.

    Google Scholar 

  • Balenson, D., 1993. Privacy enhancement for Internet electronic mail: Part III-Algorithms, modes, and identifiers.RFC 1423.

  • Coffey, T., Saidha P., 1996. Non-repudiation with mandatory proof of receipt.Computer Communication Review,26(1):6–18.

    Article  Google Scholar 

  • Gong, L., 1993. Increasing availability and security of an authentication service.IEEE Journal on Selected Areas in Communications,11(6):657–662.

    Article  Google Scholar 

  • Shamir, A., 1979. How to share a secret.Communications of the ACM,22(11):612–613.

    Article  MathSciNet  MATH  Google Scholar 

  • Tanenbaum, A. S., 1996. Computer Networks. 3rd edition. Inc., a Simon & Schuster Company, Prentice Hall, p. 577–622

  • Zhou, J., Gollmann, D., 1997. An effcient non-repudiation protocol.In: Proc. Of the 10th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, Rockport, Massachusetts, p. 126–132.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xiao-ning, J., Cheng-qing, Y. A mutual non-repudiation protocol with privacy. J. Zhejiang Univ. Sci. A 1, 317–321 (2000). https://doi.org/10.1631/BF02910643

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1631/BF02910643

Key words

Document code

CLC number

Navigation