Abstract
When using cryptographic protocols for security critical applications premature abort is a serious threat. We define two important properties called quit fairness and quit correctness for protocols to resist attacks by premature abort. The main result of the paper is that quit fairness and quit correctness can be achieved for two-party secure function evaluation whereas for multi-party protocols the two properties of quit fairness and quit correctness are mutually exclusive.
This negative result implies that countermeasures to premature abort, e.g. optimistic protocols, are vital for secure electronic applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Goldwasser, S., Levin, L.A.: Fair computation of general functions in presence of immoral majority. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 77–93. Springer, Heidelberg (1991)
Pagnia, H., Vogt, H., Gärtner, F.C.: Fair exchange. The Computer Journal 46, 55–75 (2003)
Luby, M., Micali, S., Rackoff, C.: How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin. In: 24th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 1983, pp. 11–21. IEEE Computer Society, Los Alamitos (1983)
Tedrick, T.: How to exchange half a bit. In: Chaum, D. (ed.) Advances in Cryptology: Proceedings of Crypto 1983, pp. 147–151. Plenum Press, New York (1984)
Cleve, R.: Controlled gradual disclosure schemes for random bits and their applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 573–588. Springer, Heidelberg (1990)
Kremer, S., Markowitch, O., Zhou, J.: An intensive survey of fair non-repudiation protocols. Computer Communications 25, 1606–1621 (2002)
Even, S.: A protocol for signing contracts. In: Gersho, A. (ed.): Advances in Cryptology: A Report on CRYPTO 1981, U.C. Santa Barbara Dept. of Elec. and Computer Eng, pp. 148–153 (1981)
Garay, J.A., MacKenzie, P., Yang, K.: Efficient and secure multi-party computation with faulty majority and complete fairness. IACR ePrint Archive (2004), Online available at http://eprint.iacr.org/2004/009/
Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001, pp. 136–145. IEEE Computer Society, Los Alamitos (2001), Full version online available at http://www.eccc.uni-trier.de/eccc-reports/2001/TR01-016/revisn01.ps
Pinkas, B.: Fair secure two-party computation (extended abstract). In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 87–105. Springer, Heidelberg (2003)
Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: IEEE Symposium on Security and Privacy, Proceedings of SSP 2001, pp. 184–200. IEEE Computer Society, Los Alamitos (2001), Full version online available at http://eprint.iacr.org/2000/066.ps
Backes, M., Pfitzmann, B., Waidner, M.: Secure asynchronous reactive systems. In: IACR ePrint Archive (2004), Online available at http://eprint.iacr.org/2004/082.ps
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bohli, JM., Müller-Quade, J., Röhrich, S. (2005). Fairness and Correctness in Case of a Premature Abort. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds) Progress in Cryptology - INDOCRYPT 2005. INDOCRYPT 2005. Lecture Notes in Computer Science, vol 3797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596219_26
Download citation
DOI: https://doi.org/10.1007/11596219_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30805-8
Online ISBN: 978-3-540-32278-8
eBook Packages: Computer ScienceComputer Science (R0)