Modeling agreement problems in the universal composability framework

Authors:
Masayuki Terada;Kazuki Yoneyama;Sadayuki Hongo;Kazuo Ohta
Affiliations:
NTT DoCoMo, Inc., Yokosuka, Kanagawa, Japan and University of Electro-Communications, Chofu, Tokyo, Japan;University of Electro-Communications, Chofu, Tokyo, Japan;NTT DoCoMo, Inc., Yokosuka, Kanagawa, Japan;University of Electro-Communications, Chofu, Tokyo, Japan
Venue:
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Year:
2007

Citing 14
Cited 0

A comparison of the Byzantine agreement problem and the transaction commit problem

Fault-tolerant distributed computing
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
Fairness in electronic commerce

Fairness in electronic commerce
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the composition of authenticated byzantine agreement

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Transaction Processing: Concepts and Techniques

Transaction Processing: Concepts and Techniques
Nonblocking commit protocols

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus

WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Secure Computation without Agreement

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
On the Weakest Failure Detector for Non-Blocking Atomic Commit

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Non-blocking atomic commit in asynchronous distributed systems with failure detectors

Distributed Computing
An optimistic NBAC-Based fair exchange method for arbitrary items

CARDIS'06 Proceedings of the 7th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Resource fairness and composability of cryptographic protocols

TCC'06 Proceedings of the Third conference on Theory of Cryptography

Quantified Score

Hi-index	0.00

Visualization

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, nonblocking 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 FNBAC) is exactly equivalent to the NBAC definition; it is formally proved that a protocol UC-securely realizes FNBAC 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.