STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Perfectly secure message transmission
Journal of the ACM (JACM)
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
Information and Computation
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time
Journal of Algorithms
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Efficient perfectly secure message transmission in synchronous networks
Information and Computation
Fully Polynomial Byzantine Agreement for Processors in Rounds
SIAM Journal on Computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The round complexity of verifiable secret sharing and secure multicast
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Distributed Algorithms
On perfectly secure communication over arbitrary networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
A Continuum of Failure Models for Distributed Computing
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model
Proceedings of the 13th International Symposium on Distributed Computing
Efficient Multiparty Protocols Using Circuit Randomization
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract)
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Perfectly Secure Message Transmission Revisited
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
General Adversaries in Unconditional Multi-party Computation
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Asynchronous Secure Communication Tolerating Mixed Adversaries
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Perfectly secure message transmission in asynchronous networks
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Efficient Byzantine-Tolerant Erasure-Coded Storage
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Truly efficient 2-round perfectly secure message transmission scheme
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Perfectly-secure MPC with linear communication complexity
TCC'08 Proceedings of the 5th conference on Theory of cryptography
On communication complexity of secure message transmission in directed networks
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Constant phase bit optimal protocols for perfectly reliable and secure message transmission
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Efficient multi-party computation with dispute control
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.00 |
Perfectly reliable message transmission (PRMT) is one of the fundamental problems in distributed computing. It allows a sender to reliably transmit a message to a receiver in an unreliable network, even in the presence of a computationally unbounded adversary. In this article, we study the inherent trade-off between the three important parameters of the PRMT protocols, namely, the network connectivity (n), the round complexity (r), and the communication complexity by considering the following generic question (which can be considered as the holy grail problem) in the context of the PRMT protocols. Given an n-connected network, a message of size ℓ (to be reliably communicated) and a limit c for the total communication allowed between the sender and the receiver, what is the minimum number of communication rounds required by a PRMT protocol to send the message, such that the communication complexity of the protocol is O(c)? We answer this interesting question by deriving a nontrivial lower bound on the round complexity. Moreover, we show that the lower bound is tight in the amortized sense, by designing a PRMT protocol whose round complexity matches the lower bound. The lower bound is the first of its kind, that simultaneously captures the inherent tradeoff between the three important parameters of a PRMT protocol.