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
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)
Efficient perfectly secure message transmission in synchronous networks
Information and Computation
Perfectly Secure Message Transmission Revisited
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: 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
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Efficient multiparty computations secure against an adaptive adversary
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
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
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
Efficient multi-party computation with dispute control
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Secure message transmission in asynchronous networks
Journal of Parallel and Distributed Computing
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Secure message transmission in asynchronous directed graphs
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
On the communication complexity of reliable and secure message transmission in asynchronous networks
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Theoretical Computer Science
Hi-index | 0.01 |
In the PSMT problem, a sender S and a receiver R are part of a distributed network and connected through n node disjoint paths, also called as wires among which at most t are controlled by an all powerful Byzantine adversary ${\mathcal{A}_t}$. S has a message m , which S intends to send to R. The challenge is to design a protocol, such that at the end, R should correctly output m without any error (perfect reliability) and ${\mathcal{A}_t}$ should not get any information about m , what so ever, in information theoretic sense (perfect security). The problem of USMT is same as PSMT, except that R should output m with a small probability of error. Sayeed et al. [15] have given a PSMT protocol in an asynchronous network tolerating ${\mathcal A}_t$, where S and R are connected by n = 2t + 1 wires. However, we show that their protocol does not provide perfect security. We then prove that in an asynchronous network, if all the n wires are directed from S to R, then any PSMT protocol tolerating ${\mathcal{A}_t}$ is possible iff n 3t . Surprisingly, we further prove that even if all the n wires are bi-directional, then any PSMT protocol in asynchronous network tolerating ${\mathcal{A}_t}$ is possible iff n 3t . This is quite interesting because for synchronous networks, by the results of Dolev et al. [6] , if all the wires are unidirectional (directed from S to R), then PSMT tolerating ${\mathcal{A}_t}$ is possible iff n 3t , where as if all the wires are bi-directional then PSMT tolerating ${\mathcal{A}_t}$ is possible iff n 2t . This shows that synchrony of the network affects the connectivity requirement for PSMT protocols. However, we show that n 2t wires are necessary and sufficient for the existence of any USMT protocol in asynchronous network tolerating ${\mathcal{A}_t}$, irrespective of whether the n wires are unidirectional from S to R or the n wires are bi-directional.