Asynchronous Secure Communication Tolerating Mixed Adversaries

Authors:
K. Srinathan;M. V. N. Ashwin Kumar;C. Pandu Rangan
Affiliations:
-;-;-
Venue:
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Year:
2002

Citing 9
Cited 4

Perfectly secure message transmission

Journal of the ACM (JACM)
Asynchronous secure computation

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Asynchronous secure computations with optimal resilience (extended abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Anonymous secret sharing schemes

Discrete Applied Mathematics
On perfectly secure communication over arbitrary networks

Proceedings of the twenty-first annual symposium on Principles of distributed computing
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
Perfectly secure message transmission in asynchronous networks

SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
On the Power of Nonlinear Secret-Sharing

CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity

On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks

ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Secure message transmission in asynchronous networks

Journal of Parallel and Distributed Computing
Simple and communication complexity efficient almost secure and perfectly secure message transmission schemes

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
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 secure communication tolerating generalized mixed adversaries across an underlying completely asynchronous incomplete network. We explore the interplay between the minimal network connectivity required and the degree of security attainable, and completely characterize the network requirements for attaining perfect and unconditional (with negligible error) security. We also consider networks with additional broadcast capabilities and prove that unconditionally secure communication can be achieved with much lesser connectivity if the network assures the broadcast primitive.