On perfectly secure communication over arbitrary networks

Authors:
M V N Ashwin Kumar;Pranava R. Goundan;K Srinathan;C. Pandu Rangan
Affiliations:
Indian Institute of Technology, Madras, Chennai-600036, INDIA;Indian Institute of Technology, Madras, Chennai-600036, INDIA;Indian Institute of Technology, Madras, Chennai-600036, INDIA;Indian Institute of Technology, Madras, Chennai-600036, INDIA
Venue:
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Year:
2002

Citing 14
Cited 26

Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols

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)
Secure hypergraphs: privacy from partial broadcast

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Efficient perfectly secure message transmission in synchronous networks

Information and Computation
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A characterization of span program size and improved lower bounds for monotone span programs

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
How to share a secret

Communications of the ACM
Perfectly Secure Message Transmission Revisited

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
On the Power of Nonlinear Secret-Sharing

CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
General secure multi-party computation from any linear secret-sharing scheme

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

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
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 private computation in incomplete networks

Distributed Computing
Truly efficient 2-round perfectly secure message transmission scheme

IEEE Transactions on Information Theory
On proactive perfectly secure message transmission

ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Perfectly secure message transmission in directed networks tolerating threshold and non threshold adversary

CANS'07 Proceedings of the 6th international conference on Cryptology and network security
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
Building a Quantum Network: How to Optimize Security and Expenses

Journal of Network and Systems Management
Cryptanalysis of secure message transmission protocols with feedback

ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality

International Journal of Applied Cryptography
Minimal connectivity for unconditionally secure message transmission in synchronous directed networks

ICITS'11 Proceedings of the 5th international conference on Information theoretic security
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
Revisiting colored networks and privacy preserving censorship

CRITIS'06 Proceedings of the First international conference on Critical Information Infrastructures 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
A complete characterization of tolerable adversary structures for secure point-to-point transmissions without feedback

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On private computation in incomplete networks

SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Round-efficient perfectly secure message transmission scheme against general adversary

Designs, Codes and Cryptography
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
Secure communication in multicast graphs

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Secure message transmission in asynchronous directed graphs

INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission

Journal of the ACM (JACM)
Human perfectly secure message transmission protocols and their applications

SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks

Quantified Score

Hi-index	0.06

Visualization

Abstract

We study the interplay of network connectivity and perfectly secure message transmission under the corrupting influence of generalized Byzantine adversaries. It is known that in the threshold adversary model, where the Byzantine adversary can corrupt upto any t among the n players (nodes), perfectly secure communication among any pair of players is possible if and only if the underlying synchronous network is (2t + 1)-connected. Strictly generalizing these results to the non-threshold setting, we show that perfectly secure communication among any pair of players is possible if and only if the union of no two sets in the adversary structure is a vertex cutset of the synchronous network. The computation and communication complexities of the transmission protocol are polynomial in the size of the network and the maximal basis of the adversary structure.