Knowledge and common knowledge in a Byzantine environment I: crash failures
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the Composition of Zero-Knowledge Proof Systems
SIAM Journal on Computing
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
SIAM Journal on Computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
On the composition of authenticated byzantine agreement
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On the concurrent composition of zero-knowledge proofs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Round-Efficient Secure Computation in Point-to-Point Networks
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Improving the Round Complexity of VSS in Point-to-Point Networks
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On expected constant-round protocols for Byzantine agreement
Journal of Computer and System Sciences
Improving the round complexity of VSS in point-to-point networks
Information and Computation
From passive to covert security at low cost
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Constant-round multiparty computation using a black-box pseudorandom generator
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Universally composable simultaneous broadcast
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
On expected constant-round protocols for byzantine agreement
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Scalable secure multiparty computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Hi-index | 0.00 |
The question of the composition of protocols is an important and heavily researched one. In this paper we consider the problem of sequential composition of synchronous protocols that do not have simultaneous termination; i.e., the parties do not necessarily conclude a protocol execution in the same round. A problem arises becauses such protocols must begin in synchrony; therefore a second execution cannot follow from the first in a straightforward manner. An important example of a protocol with this property is that of randomized Byzantine Agreement with an expected constant number of rounds (such as the one due to Feldman and Micali). We note that expected constant-round Byzantine Agreement cannot have simultaneous termination and thus this (problematic) property is inherent.Given that the termination of the parties is not simultaneous, a natural question to consider is how to synchronize the parties so that such protocols can be sequentially composed. Furthermore, such a composition should preserve the original running-time of the protocol, i.e. running the protocol ℓ times sequentially should take in the order of ℓ times the running-time of the protocol. In this paper, we present a method for sequentially composing any protocol in which the players do not terminate in the same round, while preserving the original round complexity. An important application of this result is the sequential composition of parallel Byzantine Agreement. Such a composition can be used by parties connected in a point-to-point network to run protocols designed for the broadcast model, while maintaining the original round complexity.