Abstract
Agreement problems are one of the keys to distributed computing. In this paper, we propose a construction of the ideal-model functionality of one of the most important agreement problems, non-blocking atomic commitment (NBAC), in the universally-composability (UC) framework. NBAC is not only important in realizing dependable transactions in distributed computing environments but also useful in constructing security protocols that require the fairness property, such as fair exchange protocols. Our construction of NBAC functionality (namely \({\mathcal F}_{\rm NBAC}\)) is exactly equivalent to the NBAC definition; it is formally proved that a protocol UC-securely realizes \({\mathcal F}_{\rm NBAC}\) if and only if the protocol is an NBAC protocol. The proposed functionality and its proof of equivalence to NBAC enables the NBAC protocols to be used as a provably secure building block, and thus makes it much easier to feasibly and securely create higher-level protocols.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Gray, J., Reuter, A.: Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Francisco (1992)
Goldwasser, S., Lindell, Y.: Secure computation without agreement. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 17–32. Springer, Heidelberg (2002)
Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Programming Language and Systems 4, 382–401 (1982)
Asokan, N.: Fairness in Electronic Commerce. PhD thesis, University of Waterloo (1998)
Pagnia, H., Vogt, H., Gärtner, F.C.: Fair exchange. The Computer Journal 46, 55–75 (2003)
Skeen, D.: Nonblocking commit protocols. In: Proc. 1981 ACM SIGMOD Intl. Conf. Management of Data, pp. 133–142 (1981)
Avoine, G., Gärtner, F.C., Guerraoui, R., Kursawe, K., Vaudenay, S., Vukolic, M.: Reducing fair exchange to atomic commit. Technical Report 200411, Swiss Federal Institute of Technology (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland (2004)
Terada, M., Mori, K., Hongo, S.: An optimistic NBAC-based fair exchange method for arbitrary items. In: Domingo-Ferrer, J., Posegga, J., Schreckling, D. (eds.) CARDIS 2006. LNCS, vol. 3928, pp. 105–118. Springer, Heidelberg (2006)
Gray, J., Lamport, L.: Consensus on transaction commit. Technical Report MSR-TR-2003-96, Microsoft Research (2004)
Gray, J.: A comparison of byzantine agreement problem and the transaction commit problem. In: Simons, B., Spector, A. (eds.) Fault-Tolerant Distributed Computing. LNCS, vol. 448, pp. 10–17. Springer, Heidelberg (1990)
Guerraoui, R., Kouznetsov, P.: On the weakest failure detector for non-blocking atomic commit. In: Proc. 2nd IFIP Intl. Conf. Theoretical Computer Science (TCS). IFIP Conference Proceedings, vol. 223, pp. 461–473. Kluwer, Dordrecht (2002)
Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proc. 42nd Symp. Foundations of Computer Science (FOCS) Full version at Cryptology ePrint Archive 2000/067, pp. 136–145 (2001)
Chandra, T.D., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43, 225–267 (1996)
Freiling, F.C., Guerraoui, R., Kouznetsov, P.: The failure detector abstraction. Technical Report 2006-003, Faculty of Mathematics and Computer Science, University of Mannheim (2006)
Lindell, Y., Lysyanskaya, A., Rabin, T.: On the composition of authenticated byzantine agreement. In: Proc. 34th Annual ACM Symp. Theory of Computing (STOC), pp. 514–523 (2002)
Garay, J.A., MacKenzie, P.D., Prabhakaran, M., Yang, K.: Resource fairness and composability of cryptographic protocols. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 404–428. Springer, Heidelberg (2006)
Guerraoui, R.: Revisiting the relationship between non-blocking atomic commitment and consensus. In: Helary, J.-M., Raynal, M. (eds.) WDAG 1995. LNCS, vol. 972, pp. 87–100. Springer, Heidelberg (1995)
Guerraoui, R.: Non-blocking atomic commit in asynchronous distributed systems with failure detector. Distributed Computing 15, 17–25 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Terada, M., Yoneyama, K., Hongo, S., Ohta, K. (2007). Modeling Agreement Problems in the Universal Composability Framework. In: Qing, S., Imai, H., Wang, G. (eds) Information and Communications Security. ICICS 2007. Lecture Notes in Computer Science, vol 4861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77048-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-77048-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77047-3
Online ISBN: 978-3-540-77048-0
eBook Packages: Computer ScienceComputer Science (R0)