Keynote Talk: Communication Without Repudiation: The Unanswered Question

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8593)

Abstract

A non-repudiation protocol is to be executed by two parties, say \(S\) and \(R\), in order to (1) enable \(S\) to send some text to \(R\) then receive some non-repudiated evidence that \(R\) has indeed received the text, and (2) enable \(R\) to receive both the sent text from \(S\) and some non-repudiated evidence that this text was indeed sent from \(S\) to \(R\). Since 1995, tens of non-repudiation protocols have been proposed, but every one of these protocols seems to suffer from one or more well-known problems. For example, most protocols assume the existence of a third party that is trusted by both \(S\) and \(R\). This observation reminds us that the following core question has never been answered. Can there be a non-repudiation protocol that does not suffer from any of these problems?

References

  1. 1.
    Herda, S.: Non-repudiation: constituting evidence and proof in digital cooperation. Comput. Stand. Interf. 17(1), 69–79 (1995)CrossRefGoogle Scholar
  2. 2.
    Cox, B., Tygar, D., Sirbu, M.: NetBill security and transaction protocol. In: Proceedings of USENIX Workshop on Electronic Commerce, pp. 77–88, July 1995Google Scholar
  3. 3.
    Zhou, J., Gollmann, D.: A fair non-repudiation protocol. In: Proceedings of the IEEE Symposium on Security and Privacy, pp. 55–61, May 1996Google Scholar
  4. 4.
    Zhou, J., Gollmann, D.: An efficient non-repudiation protocol. In: Proceedings of the IEEE Computer Security Foundations Workshop, pp. 126–132, June 1997Google Scholar
  5. 5.
    Markowitch, O., Roggeman, Y.: Probabilistic non-repudiation without trusted third party. In: Proceedings of the Conference on Security in Communication Networks, September 1999Google Scholar
  6. 6.
    Hernandez-Ardieta, J., Gonzalez-Tablas, A., Alvarez, B.: An optimistic fair exchange protocol based on signature policies. Comput. Secur. 27(7–8), 309–322 (2008)CrossRefGoogle Scholar
  7. 7.
    Kremer, S., Markowitch, O., Zhou, J.: An intensive survey of fair non-repudiation protocols. Comput. Commun. 25(17), 1606–1621 (2002)CrossRefGoogle Scholar
  8. 8.
    Muntean, C., Dojen, R., Coffey, T.: Establishing and preventing a new replay attack on a non-repudiation protocol. In: Proceedings of the 5-th IEEE International Conference on Intelligent Computer Communication and Processing (ICCP), pp. 283–290, August 2009Google Scholar
  9. 9.
    Chen, M., Wu, K., Xu, J., He, P.: A new method for formalizing optimistic fair exchange protocols. In: Soriano, M., Qing, S., López, J. (eds.) ICICS 2010. LNCS, vol. 6476, pp. 251–265. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  10. 10.
    Kremer, S., Markowitch, O.: A multi-party non-repudiation protocol. In: Qing, S., Eloff, J.H.P. (eds.) Information Security for Global Information Infrastructures. IFIP, vol. 47, pp. 271–280. Springer, Heidelberg (2000) CrossRefGoogle Scholar
  11. 11.
    Markowitch, O., Kremer, S.: A multi-party optimistic non-repudiation protocol. In: Won, D. (ed.) ICISC 2000. LNCS, vol. 2015, pp. 109–122. Springer, Heidelberg (2001) CrossRefGoogle Scholar
  12. 12.
    Zhou, J., Onieva, J., Lopez, J.: Optimized multi-party certified email protocols. Inf. Manag. Comput. Secur. 13(5), 350–366 (2005)Google Scholar
  13. 13.
    Ferrer-Gomilla, J., Onieva, J., Payeras, M., Lopez, J.: Certified electronic mail: properties revisited. Comput. Secur. 29(2), 167–179 (2010)CrossRefGoogle Scholar
  14. 14.
    Oppliger, R.: Providing certified mail services on the Internet. IEEE Secur. Priv. 5(1), 16–22 (2007)CrossRefGoogle Scholar
  15. 15.
    Tauber, A.: A survey of certified mail systems provided on the Internet. Comput. Secur. 30(6–7), 464–485 (2011)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.University of Texas at AustinAustinUSA

Personalised recommendations