Perfectly secure message transmission in asynchronous networks

Authors:
H. M. Sayeed;H. Abu-Amara
Affiliations:
-;-
Venue:
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Year:
1995

Citing 0
Cited 12

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
Efficient reliable communication over partially authenticated networks

Distributed Computing - Special issue: PODC 02
Possibility and complexity of probabilistic reliable communication in directed networks

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks

ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality

International Journal of Applied Cryptography
Secure message transmission in asynchronous networks

Journal of Parallel and Distributed Computing
On composability of reliable unicast and broadcast

ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Simple and efficient single round almost perfectly secure message transmission tolerating generalized adversary

ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Constant phase bit optimal protocols for perfectly reliable and secure message transmission

INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
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
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of perfectly secure communication in general asynchronous networks where processors and communication lines may be Byzantine faulty. To our knowledge, this is the first work that solves the secure message transmission (SMT) problem on asynchronous networks. The algorithms we develop do not rely on any complexity theoretic assumptions and simultaneously achieve the goals of perfect secrecy and perfect resiliency. Consider a network where there are n node-disjoint wires between sender and receiver, a disrupter that has access to /spl rho/ wires and attempts to maliciously alter communication between sender and receiver, and a listener that has access to /spl rho/ wires and attempts to decipher secret messages that sender sends to receiver. Let /spl tau/ be max.