Perfectly secure message transmission
Journal of the ACM (JACM)
Efficient perfectly secure message transmission in synchronous networks
Information and Computation
Communications of the ACM
Perfectly secure message transmission in asynchronous networks
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Towards optimal and efficient perfectly secure message transmission
TCC'07 Proceedings of the 4th conference on Theory of cryptography
On proactive perfectly secure message transmission
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
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
International Journal of Applied Cryptography
Constant phase bit optimal protocols for perfectly reliable and secure message transmission
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Asymptotically optimal two-round perfectly secure message transmission
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
| Hi-index | 0.00 |
In this paper, we study the communication complexity of Reliable Message Transmission (RMT) and Secure Message Transmission (SMT) protocols in asynchronous settings. We consider two variants of the problem, namely perfect (where no error is allowed in the protocol outcome) and statistical (where the protocol may output a wrong outcome with negligible probability). RMT and SMT protocols have been investigated rigorously in synchronous settings. But not too much attention has been paid to the asynchronous version of the problem. In a significant work, Choudhury et al. (ICDCN 2009 and JPDC 2011) have studied the network connectivity requirement for asynchronous perfect and statistical SMT protocols. Their investigation reveals the following two important facts: 1 perfect SMT protocols require more network connectivity in asynchronous network than synchronous network. 2 Connectivity requirement of statistical SMT protocols is same for both synchronous and asynchronous network. Unfortunately, nothing is known about the communication complexity of RMT and SMT protocols in asynchronous settings. In this paper, we derive tight bounds on the communication complexity of the above problems and compare our results with the existing bounds for synchronous protocols. The interesting conclusions derived from our results are: 1 RMT: Asynchrony increases the communication complexity of perfect RMT protocols. However, asynchrony has no impact on the communication complexity of statistical RMT protocols. 2 SMT: Communication complexity of SMT protocols is more in asynchronous network, for both perfect as well as statistical case.