On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Perfectly secure message transmission
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Secure hypergraphs: privacy from partial broadcast
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Easy impossibility proofs for distributed consensus problems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
From partial consistency to global broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Levels of Authentication in Distributed Agreement
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Efficient Byzantine Agreement Secure Against General Adversaries
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model
Proceedings of the 13th International Symposium on Distributed Computing
Perfectly Secure Message Transmission Revisited
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
On the Number of Authenticated Rounds in Byzantine Agreement
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Perfectly secure message transmission in asynchronous networks
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The Byzantine Generals strike again
The Byzantine Generals strike again
Possibility and complexity of probabilistic reliable communication in directed networks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
On expected constant-round protocols for Byzantine agreement
Journal of Computer and System Sciences
On proactive perfectly secure message transmission
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Hi-index | 0.00 |
In the recent past composability has emerged as a key requirement for various distributed protocols. It is not enough for a protocol to be robust when it runs in isolation or in a "stand-alone" setting but it should be robust even in an environment where several copies of the same protocol or other protocol(s) are running simultaneously. In this work, we investigate the composability for protocols that tolerate a bounded adversary modeled as a probabilistic polynomial time Turing machine. We examine composability of protocols for two fundamental problems in distributed computing - reliable unicast and reliable broadcast. We show that any composable protocol - for reliable unicast tolerating an adversary, that corrupts up to any t nodes, requires 2t+1 connectivity and for reliable broadcast tolerating an adversary, that corrupts up to any t nodes, requires n 3t and 2t + 1 connectivity.