How to withstand mobile virus attacks (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Perfectly secure message transmission
Journal of the ACM (JACM)
Efficient perfectly secure message transmission in synchronous networks
Information and Computation
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
Perfectly Secure Message Transmission Revisited
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Perfectly secure message transmission in asynchronous networks
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Introduction to Reliable Distributed Programming
Introduction to Reliable Distributed Programming
Perfectly reliable message transmission
Information Processing Letters
Asymptotically optimal two-round perfectly secure message transmission
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
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
Perfectly reliable and secure message transmission tolerating mobile adversary
International Journal of Applied Cryptography
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
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
International Journal of Applied 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
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
| Hi-index | 0.00 |
In this paper, we study the problem of perfectly reliable message transmission(PRMT) and perfectly secure message transmission(PSMT) between a sender S and a receiver R in a synchronous network, where S and R are connected by n vertex disjoint paths called wires, each of which facilitates bidirectional communication. We assume that atmost t of these wires are under the control of adversary. We present two-phase-bit optimal PRMT protocol considering Byzantine adversary as well as mixed adversary. We also present a three phase PRMT protocol which reliably sends a message containing l field elements by overall communicating O(l) field elements. This is a significant improvement over the PRMT protocol proposed in [10] to achieve the same task which takes log(t) phases. We also present a three-phase-bit-optimal PSMT protocol which securely sends a message consisting of t field elements by communicating O(t2) field elements.